Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734919800027.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919800027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 28K Jun 2 16:33 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 MedleyA-PT-04-LTLCardinality-00
FORMULA_NAME MedleyA-PT-04-LTLCardinality-01
FORMULA_NAME MedleyA-PT-04-LTLCardinality-02
FORMULA_NAME MedleyA-PT-04-LTLCardinality-03
FORMULA_NAME MedleyA-PT-04-LTLCardinality-04
FORMULA_NAME MedleyA-PT-04-LTLCardinality-05
FORMULA_NAME MedleyA-PT-04-LTLCardinality-06
FORMULA_NAME MedleyA-PT-04-LTLCardinality-07
FORMULA_NAME MedleyA-PT-04-LTLCardinality-08
FORMULA_NAME MedleyA-PT-04-LTLCardinality-09
FORMULA_NAME MedleyA-PT-04-LTLCardinality-10
FORMULA_NAME MedleyA-PT-04-LTLCardinality-11
FORMULA_NAME MedleyA-PT-04-LTLCardinality-12
FORMULA_NAME MedleyA-PT-04-LTLCardinality-13
FORMULA_NAME MedleyA-PT-04-LTLCardinality-14
FORMULA_NAME MedleyA-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717352773014

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 18:26:15] [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-06-02 18:26:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:26:15] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-06-02 18:26:15] [INFO ] Transformed 115 places.
[2024-06-02 18:26:15] [INFO ] Transformed 107 transitions.
[2024-06-02 18:26:15] [INFO ] Found NUPN structural information;
[2024-06-02 18:26:15] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 107
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 104 transition count 97
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 104 transition count 97
Applied a total of 21 rules in 71 ms. Remains 104 /115 variables (removed 11) and now considering 97/107 (removed 10) transitions.
// Phase 1: matrix 97 rows 104 cols
[2024-06-02 18:26:16] [INFO ] Computed 8 invariants in 28 ms
[2024-06-02 18:26:16] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-06-02 18:26:16] [INFO ] Invariant cache hit.
[2024-06-02 18:26:17] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-02 18:26:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:26:18] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 39 ms to minimize.
[2024-06-02 18:26:18] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 3 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 3 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 3 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 2 ms to minimize.
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:26:21] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:26:21] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:26:21] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/201 variables, 104/142 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:26:22] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:26:22] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:26:23] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:26:23] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 3 ms to minimize.
[2024-06-02 18:26:23] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 9 ms to minimize.
[2024-06-02 18:26:23] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:26:23] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 149 constraints, problems are : Problem set: 0 solved, 96 unsolved in 9354 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:26:27] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:26:27] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:26:27] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:26:27] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:26:27] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:26:28] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:26:28] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:26:28] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 97/201 variables, 104/157 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 96/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:26:29] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:26:29] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:26:32] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:26:32] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:26:35] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:26:35] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:26:35] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:26:39] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 261 constraints, problems are : Problem set: 0 solved, 96 unsolved in 26255 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 53/53 constraints]
After SMT, in 35791ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 35817ms
Starting structural reductions in LTL mode, iteration 1 : 104/115 places, 97/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36836 ms. Remains : 104/115 places, 97/107 transitions.
Support contains 20 out of 104 places after structural reductions.
[2024-06-02 18:26:53] [INFO ] Flatten gal took : 65 ms
[2024-06-02 18:26:53] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:26:53] [INFO ] Input system was already deterministic with 97 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (1115 resets) in 1530 ms. (26 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40003 steps (320 resets) in 314 ms. (126 steps per ms) remains 1/1 properties
[2024-06-02 18:26:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/78 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 97/175 variables, 78/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/201 variables, 26/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/78 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:26:54] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:26:54] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:26:54] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 97/175 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/201 variables, 26/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/201 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 97/97 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 12 place count 104 transition count 85
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 92 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 91 transition count 84
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 26 place count 91 transition count 72
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 50 place count 79 transition count 72
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 76 transition count 69
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 76 transition count 69
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 96 place count 56 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 56 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 55 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 55 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 54 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 53 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 102 place count 53 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 103 place count 52 transition count 46
Applied a total of 103 rules in 79 ms. Remains 52 /104 variables (removed 52) and now considering 46/97 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 52/104 places, 46/97 transitions.
RANDOM walk for 10904 steps (1186 resets) in 162 ms. (66 steps per ms) remains 0/1 properties
Computed a total of 104 stabilizing places and 97 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 97
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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)&&(p1||(X(p1)&&p2)))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 103 transition count 87
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 94 transition count 87
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 18 place count 94 transition count 75
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 42 place count 82 transition count 75
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 79 transition count 72
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 79 transition count 72
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 88 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 56 transition count 50
Applied a total of 92 rules in 44 ms. Remains 56 /104 variables (removed 48) and now considering 50/97 (removed 47) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 18:26:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:26:55] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 18:26:55] [INFO ] Invariant cache hit.
[2024-06-02 18:26:55] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-02 18:26:55] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-02 18:26:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:26:55] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:26:56] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:26:56] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:26:56] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:26:56] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 68 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1557 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 49/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 1/106 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 117 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1989 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 5/5 constraints]
After SMT, in 3610ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 3612ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/104 places, 50/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3950 ms. Remains : 56/104 places, 50/97 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-03
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-03 finished in 4365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 99 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 99 transition count 92
Applied a total of 10 rules in 9 ms. Remains 99 /104 variables (removed 5) and now considering 92/97 (removed 5) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:26:59] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:26:59] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 18:26:59] [INFO ] Invariant cache hit.
[2024-06-02 18:26:59] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:26:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:27:00] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-06-02 18:27:00] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:27:00] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:27:00] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:27:00] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:27:00] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:27:01] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:27:01] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:27:02] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-06-02 18:27:02] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:27:02] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 118 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4581 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/209 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:27:05] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 3 ms to minimize.
[2024-06-02 18:27:06] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:27:08] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:27:10] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:27:13] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/191 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:27:16] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 215 constraints, problems are : Problem set: 0 solved, 91 unsolved in 20199 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 17/17 constraints]
After SMT, in 24809ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 24811ms
Starting structural reductions in LTL mode, iteration 1 : 99/104 places, 92/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25014 ms. Remains : 99/104 places, 92/97 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-05 finished in 25149 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)&&X(p1))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 99 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 99 transition count 92
Applied a total of 10 rules in 9 ms. Remains 99 /104 variables (removed 5) and now considering 92/97 (removed 5) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:27:24] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:27:24] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 18:27:24] [INFO ] Invariant cache hit.
[2024-06-02 18:27:25] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:27:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:27:25] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:27:27] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 3 ms to minimize.
[2024-06-02 18:27:27] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:27:27] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:27:28] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 119 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5249 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/210 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:27:32] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:27:34] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:27:37] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 213 constraints, problems are : Problem set: 0 solved, 91 unsolved in 15456 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 15/15 constraints]
After SMT, in 20745ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 20750ms
Starting structural reductions in LTL mode, iteration 1 : 99/104 places, 92/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21034 ms. Remains : 99/104 places, 92/97 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-06
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-06 finished in 21196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((((G(p0) U !p1) U p2)||X(G(p3))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 98 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 98 transition count 91
Applied a total of 12 rules in 8 ms. Remains 98 /104 variables (removed 6) and now considering 91/97 (removed 6) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:27:45] [INFO ] Computed 8 invariants in 6 ms
[2024-06-02 18:27:46] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 18:27:46] [INFO ] Invariant cache hit.
[2024-06-02 18:27:46] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:27:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:27:47] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:27:47] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:27:47] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:27:47] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:27:47] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:27:47] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:27:47] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:27:49] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 3 ms to minimize.
[2024-06-02 18:27:49] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:27:49] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:27:49] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:27:49] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:27:49] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:27:50] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6520 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:27:54] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:27:56] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 11853 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 18416ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 18418ms
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 91/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18680 ms. Remains : 98/104 places, 91/97 transitions.
Stuttering acceptance computed with spot in 406 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p0 p1 (NOT p3)), true, (NOT p0), p1, (NOT p2)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 3309 steps with 90 reset in 23 ms.
FORMULA MedleyA-PT-04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-08 finished in 19146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 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 12 place count 103 transition count 84
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 91 transition count 84
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 24 place count 91 transition count 74
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 44 place count 81 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 79 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 79 transition count 72
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 90 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 55 transition count 49
Applied a total of 94 rules in 31 ms. Remains 55 /104 variables (removed 49) and now considering 49/97 (removed 48) transitions.
// Phase 1: matrix 49 rows 55 cols
[2024-06-02 18:28:05] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:28:05] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 18:28:05] [INFO ] Invariant cache hit.
[2024-06-02 18:28:05] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-06-02 18:28:05] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 18:28:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:28:05] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:28:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-02 18:28:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-02 18:28:05] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-02 18:28:05] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-02 18:28:06] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 49/103 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/104 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/104 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 68 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1736 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 49/103 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 46/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/104 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:28:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/104 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (OVERLAPS) 0/104 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 115 constraints, problems are : Problem set: 0 solved, 46 unsolved in 3805 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 7/7 constraints]
After SMT, in 5576ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 5578ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/104 places, 49/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5851 ms. Remains : 55/104 places, 49/97 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-13
Stuttering criterion allowed to conclude after 17 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-13 finished in 5939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(((F(p2) U p3)||p1))||p0))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 99 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 99 transition count 92
Applied a total of 10 rules in 4 ms. Remains 99 /104 variables (removed 5) and now considering 92/97 (removed 5) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:28:11] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:28:11] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 18:28:11] [INFO ] Invariant cache hit.
[2024-06-02 18:28:11] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:28:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:28:12] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:28:12] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:28:12] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:28:12] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:28:12] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:28:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:28:13] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:28:13] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:28:13] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:28:13] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:28:13] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:28:13] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 119 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4049 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/210 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:28:16] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:28:16] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:28:17] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:28:20] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:28:20] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:28:25] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/191 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 216 constraints, problems are : Problem set: 0 solved, 91 unsolved in 18494 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 18/18 constraints]
After SMT, in 22566ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 22567ms
Starting structural reductions in LTL mode, iteration 1 : 99/104 places, 92/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22817 ms. Remains : 99/104 places, 92/97 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Product exploration explored 100000 steps with 50000 reset in 327 ms.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p3), (X p0), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 28 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLCardinality-15 finished in 23708 ms.
All properties solved by simple procedures.
Total runtime 139271 ms.

BK_STOP 1717352915060

--------------------
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="MedleyA-PT-04"
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 MedleyA-PT-04, 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 r576-smll-171734919800027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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