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.r048-tajo-171620399800587.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 itstools
Input is BusinessProcesses-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800587
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 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 177K 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-18-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716337096216

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 00:18:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:18:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:18:17] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-22 00:18:17] [INFO ] Transformed 717 places.
[2024-05-22 00:18:17] [INFO ] Transformed 642 transitions.
[2024-05-22 00:18:17] [INFO ] Found NUPN structural information;
[2024-05-22 00:18:17] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 15 places in 16 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 105 place count 597 transition count 530
Iterating global reduction 1 with 97 rules applied. Total rules applied 202 place count 597 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 203 place count 597 transition count 529
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 255 place count 545 transition count 477
Iterating global reduction 2 with 52 rules applied. Total rules applied 307 place count 545 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 308 place count 544 transition count 476
Iterating global reduction 2 with 1 rules applied. Total rules applied 309 place count 544 transition count 476
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 310 place count 543 transition count 475
Iterating global reduction 2 with 1 rules applied. Total rules applied 311 place count 543 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 312 place count 542 transition count 474
Iterating global reduction 2 with 1 rules applied. Total rules applied 313 place count 542 transition count 474
Applied a total of 313 rules in 266 ms. Remains 542 /702 variables (removed 160) and now considering 474/627 (removed 153) transitions.
// Phase 1: matrix 474 rows 542 cols
[2024-05-22 00:18:18] [INFO ] Computed 106 invariants in 50 ms
[2024-05-22 00:18:18] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-22 00:18:18] [INFO ] Invariant cache hit.
[2024-05-22 00:18:19] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-22 00:18:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/541 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/541 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 1/542 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 21 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 97 places in 198 ms of which 3 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 4 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 121 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 4 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 4 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 4 ms to minimize.
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 4 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 4 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 96 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:18:40] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 2 ms to minimize.
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 20/166 constraints. Problems are: Problem set: 9 solved, 464 unsolved
[2024-05-22 00:18:40] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:18:40] [INFO ] Deduced a trap composed of 105 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:18:40] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 103 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 121 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 6 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:18:43] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:18:43] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:18:43] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 20/186 constraints. Problems are: Problem set: 9 solved, 464 unsolved
[2024-05-22 00:18:47] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:18:47] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:18:47] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:18:47] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:18:47] [INFO ] Deduced a trap composed of 93 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:18:49] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:18:49] [INFO ] Deduced a trap composed of 103 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:18:49] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:18:49] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:18:50] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 3 ms to minimize.
SMT process timed out in 30289ms, After SMT, problems are : Problem set: 9 solved, 464 unsolved
Search for dead transitions found 9 dead transitions in 30318ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 542/702 places, 465/627 transitions.
Applied a total of 0 rules in 24 ms. Remains 542 /542 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32047 ms. Remains : 542/702 places, 465/627 transitions.
Support contains 22 out of 542 places after structural reductions.
[2024-05-22 00:18:50] [INFO ] Flatten gal took : 79 ms
[2024-05-22 00:18:50] [INFO ] Flatten gal took : 39 ms
[2024-05-22 00:18:50] [INFO ] Input system was already deterministic with 465 transitions.
RANDOM walk for 40000 steps (205 resets) in 1378 ms. (29 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40003 steps (31 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (40 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (36 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (34 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (35 resets) in 166 ms. (239 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (41 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
// Phase 1: matrix 465 rows 542 cols
[2024-05-22 00:18:51] [INFO ] Computed 106 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 119/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 263/392 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 135/527 variables, 39/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/530 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 457/987 variables, 530/636 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/987 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 17/1004 variables, 9/645 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1004 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/1007 variables, 3/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1007 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1007 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 648 constraints, problems are : Problem set: 0 solved, 5 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 119/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 263/392 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 38 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 39 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 135/527 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 6 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 3/530 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 457/987 variables, 530/651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/987 variables, 5/656 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/987 variables, 5/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/987 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 17/1004 variables, 9/670 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
Problem AtomicPropp5 is UNSAT
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1004 variables, 2/672 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1004 variables, 0/672 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 3/1007 variables, 3/675 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1007 variables, 0/675 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1007 variables, 0/675 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 675 constraints, problems are : Problem set: 1 solved, 4 unsolved in 3111 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 22/22 constraints]
After SMT, in 3841ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 0 properties in 1507 ms.
Support contains 8 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 465/465 transitions.
Graph (trivial) has 254 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 3 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 1186 edges and 537 vertex of which 536 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 536 transition count 395
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 474 transition count 395
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 126 place count 474 transition count 281
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 378 place count 336 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 382 place count 332 transition count 277
Iterating global reduction 2 with 4 rules applied. Total rules applied 386 place count 332 transition count 277
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 281 rules applied. Total rules applied 667 place count 190 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 669 place count 189 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 670 place count 189 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 671 place count 188 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 672 place count 187 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 673 place count 186 transition count 139
Applied a total of 673 rules in 94 ms. Remains 186 /542 variables (removed 356) and now considering 139/465 (removed 326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 186/542 places, 139/465 transitions.
RANDOM walk for 33397 steps (1586 resets) in 723 ms. (46 steps per ms) remains 0/4 properties
FORMULA BusinessProcesses-PT-18-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 486 stabilizing places and 419 stable transitions
Graph (complete) has 1201 edges and 542 vertex of which 541 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 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&&G(F(p0)))))'
Support contains 1 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 465/465 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 533 transition count 456
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 533 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 531 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 531 transition count 454
Applied a total of 22 rules in 31 ms. Remains 531 /542 variables (removed 11) and now considering 454/465 (removed 11) transitions.
// Phase 1: matrix 454 rows 531 cols
[2024-05-22 00:18:57] [INFO ] Computed 106 invariants in 9 ms
[2024-05-22 00:18:57] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 00:18:57] [INFO ] Invariant cache hit.
[2024-05-22 00:18:57] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2024-05-22 00:18:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 100 places in 159 ms of which 4 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 4 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 103 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 4 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 5 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 113 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 114 places in 120 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 95 places in 169 ms of which 5 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 75 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 3 ms to minimize.
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/186 constraints. Problems are: Problem set: 14 solved, 439 unsolved
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 121 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 101 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 5 ms to minimize.
Problem TDEAD380 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/206 constraints. Problems are: Problem set: 17 solved, 436 unsolved
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 5 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 95 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
SMT process timed out in 30206ms, After SMT, problems are : Problem set: 17 solved, 436 unsolved
Search for dead transitions found 17 dead transitions in 30217ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/542 places, 437/465 transitions.
Applied a total of 0 rules in 21 ms. Remains 531 /531 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30862 ms. Remains : 531/542 places, 437/465 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-03 finished in 31315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F((p1||G(p2))))))'
Support contains 5 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 465/465 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 535 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 535 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 533 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 533 transition count 456
Applied a total of 18 rules in 43 ms. Remains 533 /542 variables (removed 9) and now considering 456/465 (removed 9) transitions.
// Phase 1: matrix 456 rows 533 cols
[2024-05-22 00:19:28] [INFO ] Computed 106 invariants in 11 ms
[2024-05-22 00:19:28] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-22 00:19:28] [INFO ] Invariant cache hit.
[2024-05-22 00:19:29] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-05-22 00:19:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 1/533 variables, 66/103 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 4 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 4 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 100 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 3 ms to minimize.
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/126 constraints. Problems are: Problem set: 13 solved, 442 unsolved
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 118 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 126 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 90 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 91 places in 159 ms of which 4 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 8 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 126 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 119 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 118 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 125 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/146 constraints. Problems are: Problem set: 13 solved, 442 unsolved
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/166 constraints. Problems are: Problem set: 13 solved, 442 unsolved
[2024-05-22 00:19:52] [INFO ] Deduced a trap composed of 96 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:19:52] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 116 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 123 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 97 places in 126 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
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 20/186 constraints. Problems are: Problem set: 18 solved, 437 unsolved
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 97 places in 201 ms of which 3 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 4 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 119 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:58] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:58] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:58] [INFO ] Deduced a trap composed of 122 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:58] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:58] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 20/206 constraints. Problems are: Problem set: 18 solved, 437 unsolved
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 30227ms, After SMT, problems are : Problem set: 18 solved, 437 unsolved
Search for dead transitions found 18 dead transitions in 30232ms
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 : 533/542 places, 438/465 transitions.
Applied a total of 0 rules in 11 ms. Remains 533 /533 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31118 ms. Remains : 533/542 places, 438/465 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-07
Stuttering criterion allowed to conclude after 165 steps with 1 reset in 3 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-07 finished in 31280 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 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 465/465 transitions.
Graph (trivial) has 260 edges and 542 vertex of which 6 / 542 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 1194 edges and 537 vertex of which 536 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 535 transition count 391
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 469 transition count 391
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 134 place count 469 transition count 277
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 387 place count 330 transition count 277
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 392 place count 325 transition count 272
Iterating global reduction 2 with 5 rules applied. Total rules applied 397 place count 325 transition count 272
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 686 place count 179 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 688 place count 178 transition count 132
Applied a total of 688 rules in 60 ms. Remains 178 /542 variables (removed 364) and now considering 132/465 (removed 333) transitions.
// Phase 1: matrix 132 rows 178 cols
[2024-05-22 00:19:59] [INFO ] Computed 78 invariants in 1 ms
[2024-05-22 00:19:59] [INFO ] Implicit Places using invariants in 176 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 178 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/542 places, 132/465 transitions.
Applied a total of 0 rules in 6 ms. Remains 150 /150 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 150/542 places, 132/465 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-08
Product exploration explored 100000 steps with 13711 reset in 284 ms.
Stack based approach found an accepted trace after 4296 steps with 586 reset with depth 18 and stack size 13 in 20 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-08 finished in 593 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 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 465/465 transitions.
Graph (trivial) has 261 edges and 542 vertex of which 6 / 542 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 1194 edges and 537 vertex of which 536 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 535 transition count 392
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 470 transition count 392
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 132 place count 470 transition count 277
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 387 place count 330 transition count 277
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 394 place count 323 transition count 270
Iterating global reduction 2 with 7 rules applied. Total rules applied 401 place count 323 transition count 270
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 684 place count 180 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 686 place count 179 transition count 133
Applied a total of 686 rules in 73 ms. Remains 179 /542 variables (removed 363) and now considering 133/465 (removed 332) transitions.
// Phase 1: matrix 133 rows 179 cols
[2024-05-22 00:20:00] [INFO ] Computed 78 invariants in 12 ms
[2024-05-22 00:20:00] [INFO ] Implicit Places using invariants in 242 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 243 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/542 places, 133/465 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 321 ms. Remains : 151/542 places, 133/465 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-10
Product exploration explored 100000 steps with 11376 reset in 188 ms.
Product exploration explored 100000 steps with 11330 reset in 330 ms.
Computed a total of 129 stabilizing places and 116 stable transitions
Computed a total of 129 stabilizing places and 116 stable transitions
Detected a total of 129/151 stabilizing places and 116/133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 71 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 31 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5307 resets) in 531 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2426 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 544 steps, run visited all 1 properties in 9 ms. (steps per millisecond=60 )
Probabilistic random walk after 544 steps, saw 209 distinct states, run finished after 12 ms. (steps per millisecond=45 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 109 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 30 ms :[(NOT p0)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 133/133 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 151 cols
[2024-05-22 00:20:01] [INFO ] Computed 50 invariants in 1 ms
[2024-05-22 00:20:01] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 00:20:01] [INFO ] Invariant cache hit.
[2024-05-22 00:20:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 00:20:02] [INFO ] Implicit Places using invariants and state equation in 175 ms returned [3, 36, 37, 52, 54, 58, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 133, 135, 137]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 274 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/151 places, 133/133 transitions.
Graph (complete) has 389 edges and 124 vertex of which 117 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 117 transition count 118
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 105 transition count 118
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 97 transition count 101
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 97 transition count 101
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 44 place count 97 transition count 98
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 47 place count 94 transition count 98
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 50 place count 91 transition count 95
Iterating global reduction 4 with 3 rules applied. Total rules applied 53 place count 91 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 55 place count 91 transition count 93
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 65 place count 86 transition count 88
Applied a total of 65 rules in 9 ms. Remains 86 /124 variables (removed 38) and now considering 88/133 (removed 45) transitions.
// Phase 1: matrix 88 rows 86 cols
[2024-05-22 00:20:02] [INFO ] Computed 20 invariants in 1 ms
[2024-05-22 00:20:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 00:20:02] [INFO ] Invariant cache hit.
[2024-05-22 00:20:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:20:02] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 167 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/151 places, 88/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 459 ms. Remains : 85/151 places, 88/133 transitions.
Computed a total of 63 stabilizing places and 71 stable transitions
Graph (complete) has 285 edges and 85 vertex of which 82 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 63 stabilizing places and 71 stable transitions
Detected a total of 63/85 stabilizing places and 71/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 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 42 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5339 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2445 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 213 steps, run visited all 1 properties in 6 ms. (steps per millisecond=35 )
Probabilistic random walk after 213 steps, saw 94 distinct states, run finished after 6 ms. (steps per millisecond=35 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 87 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 21 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11353 reset in 97 ms.
Product exploration explored 100000 steps with 11385 reset in 107 ms.
Built C files in :
/tmp/ltsmin8998338991735148738
[2024-05-22 00:20:02] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-22 00:20:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:20:02] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-22 00:20:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:20:02] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-22 00:20:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:20:02] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8998338991735148738
Running compilation step : cd /tmp/ltsmin8998338991735148738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 375 ms.
Running link step : cd /tmp/ltsmin8998338991735148738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin8998338991735148738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9840254575947229431.hoa' '--buchi-type=spotba'
LTSmin run took 224 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-18-LTLCardinality-10 finished in 3282 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' '!((p0 U (G(p0)||(p0&&G(!p1)))))'
Support contains 3 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 465/465 transitions.
Graph (trivial) has 259 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1194 edges and 537 vertex of which 536 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 535 transition count 392
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 470 transition count 392
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 132 place count 470 transition count 278
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 384 place count 332 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 390 place count 326 transition count 272
Iterating global reduction 2 with 6 rules applied. Total rules applied 396 place count 326 transition count 272
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 285 rules applied. Total rules applied 681 place count 182 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 683 place count 181 transition count 134
Applied a total of 683 rules in 34 ms. Remains 181 /542 variables (removed 361) and now considering 134/465 (removed 331) transitions.
// Phase 1: matrix 134 rows 181 cols
[2024-05-22 00:20:03] [INFO ] Computed 79 invariants in 2 ms
[2024-05-22 00:20:03] [INFO ] Implicit Places using invariants in 136 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 138 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/542 places, 134/465 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 152/542 places, 134/465 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 668 steps with 90 reset in 3 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-12 finished in 294 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((G((p1 U p2))||p0)))))'
Support contains 5 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 465/465 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 535 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 535 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 534 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 534 transition count 457
Applied a total of 16 rules in 24 ms. Remains 534 /542 variables (removed 8) and now considering 457/465 (removed 8) transitions.
// Phase 1: matrix 457 rows 534 cols
[2024-05-22 00:20:03] [INFO ] Computed 106 invariants in 5 ms
[2024-05-22 00:20:04] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-22 00:20:04] [INFO ] Invariant cache hit.
[2024-05-22 00:20:04] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
Running 456 sub problems to find dead transitions.
[2024-05-22 00:20:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (OVERLAPS) 1/534 variables, 66/104 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 100 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 118 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-22 00:20:17] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:20:17] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:20:17] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:20:17] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:20:17] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:20:17] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:20:17] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 126 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 101 places in 178 ms of which 2 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 93 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-22 00:20:26] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:20:26] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:20:27] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:20:27] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:20:27] [INFO ] Deduced a trap composed of 119 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:20:27] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:20:27] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:20:27] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:20:28] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:20:28] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:20:28] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:20:28] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:20:28] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:20:28] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:20:28] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:20:29] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:20:29] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:20:29] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:20:29] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:20:29] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/186 constraints. Problems are: Problem set: 10 solved, 446 unsolved
[2024-05-22 00:20:30] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:20:30] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:20:30] [INFO ] Deduced a trap composed of 122 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:20:30] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:20:30] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:20:30] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:20:31] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:20:31] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:20:31] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:20:31] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:20:31] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:20:31] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:20:31] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 3 ms to minimize.
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/206 constraints. Problems are: Problem set: 18 solved, 438 unsolved
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 2 ms to minimize.
SMT process timed out in 30198ms, After SMT, problems are : Problem set: 18 solved, 438 unsolved
Search for dead transitions found 18 dead transitions in 30205ms
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 : 534/542 places, 439/465 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 533 transition count 439
Applied a total of 1 rules in 11 ms. Remains 533 /534 variables (removed 1) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 533 cols
[2024-05-22 00:20:34] [INFO ] Computed 108 invariants in 6 ms
[2024-05-22 00:20:35] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-22 00:20:35] [INFO ] Invariant cache hit.
[2024-05-22 00:20:35] [INFO ] Implicit Places using invariants and state equation in 528 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 794 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 532/542 places, 439/465 transitions.
Applied a total of 0 rules in 11 ms. Remains 532 /532 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31809 ms. Remains : 532/542 places, 439/465 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 287 ms.
Product exploration explored 100000 steps with 33333 reset in 236 ms.
Computed a total of 477 stabilizing places and 394 stable transitions
Graph (complete) has 1141 edges and 532 vertex of which 531 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 477 stabilizing places and 394 stable transitions
Detected a total of 477/532 stabilizing places and 394/439 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 29 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLCardinality-14 finished in 32575 ms.
All properties solved by simple procedures.
Total runtime 138926 ms.

BK_STOP 1716337236617

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-18, 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 r048-tajo-171620399800587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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