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.r504-tall-171649613000555.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 ltsminxred
Input is Medical-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649613000555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 13 14:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 14:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717230024202

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:20:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:20:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:20:25] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2024-06-01 08:20:25] [INFO ] Transformed 312 places.
[2024-06-01 08:20:25] [INFO ] Transformed 5431 transitions.
[2024-06-01 08:20:25] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 242 places in 25 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-12-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 227
Applied a total of 2 rules in 16 ms. Remains 67 /69 variables (removed 2) and now considering 227/227 (removed 0) transitions.
[2024-06-01 08:20:26] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 67 cols
[2024-06-01 08:20:26] [INFO ] Computed 8 invariants in 11 ms
[2024-06-01 08:20:26] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-01 08:20:26] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-06-01 08:20:26] [INFO ] Invariant cache hit.
[2024-06-01 08:20:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 08:20:26] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-06-01 08:20:26] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-06-01 08:20:26] [INFO ] Invariant cache hit.
[2024-06-01 08:20:26] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-01 08:20:27] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 9 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 220 unsolved
[2024-06-01 08:20:28] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:20:28] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
[2024-06-01 08:20:28] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 3/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 182/247 variables, 65/77 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 56/133 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/133 constraints. Problems are: Problem set: 6 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/249 variables, 2/135 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/135 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/135 constraints. Problems are: Problem set: 6 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 135 constraints, problems are : Problem set: 6 solved, 216 unsolved in 5948 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 6 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/8 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/10 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 182/247 variables, 65/77 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 56/133 constraints. Problems are: Problem set: 6 solved, 216 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 133/266 constraints. Problems are: Problem set: 9 solved, 213 unsolved
[2024-06-01 08:20:34] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:20:34] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD170 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 2/268 constraints. Problems are: Problem set: 12 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/268 constraints. Problems are: Problem set: 12 solved, 210 unsolved
At refinement iteration 11 (OVERLAPS) 2/249 variables, 2/270 constraints. Problems are: Problem set: 12 solved, 210 unsolved
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 83/353 constraints. Problems are: Problem set: 17 solved, 205 unsolved
[2024-06-01 08:20:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:20:38] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 2/355 constraints. Problems are: Problem set: 18 solved, 204 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/355 constraints. Problems are: Problem set: 18 solved, 204 unsolved
At refinement iteration 15 (OVERLAPS) 0/249 variables, 0/355 constraints. Problems are: Problem set: 18 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 355 constraints, problems are : Problem set: 18 solved, 204 unsolved in 11034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 216/222 constraints, Known Traps: 8/8 constraints]
After SMT, in 17253ms problems are : Problem set: 18 solved, 204 unsolved
Search for dead transitions found 18 dead transitions in 17267ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 209/227 transitions.
Reduce places removed 4 places and 43 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 63 transition count 166
Reduce places removed 2 places and 31 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 61 transition count 135
Reduce places removed 2 places and 14 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 59 transition count 121
Reduce places removed 3 places and 19 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 11 place count 56 transition count 102
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 11 rules in 2 ms. Remains 56 /67 variables (removed 11) and now considering 102/209 (removed 107) transitions.
[2024-06-01 08:20:43] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
// Phase 1: matrix 90 rows 56 cols
[2024-06-01 08:20:43] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 08:20:43] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 08:20:43] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
[2024-06-01 08:20:43] [INFO ] Invariant cache hit.
[2024-06-01 08:20:43] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 08:20:43] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/69 places, 102/227 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17826 ms. Remains : 56/69 places, 102/227 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Support contains 3 out of 52 places after structural reductions.
FORMULA Medical-PT-12-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 08:20:43] [INFO ] Flatten gal took : 32 ms
[2024-06-01 08:20:44] [INFO ] Flatten gal took : 20 ms
[2024-06-01 08:20:44] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 40004 steps (184 resets) in 1138 ms. (35 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (40 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (25 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
[2024-06-01 08:20:44] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
// Phase 1: matrix 90 rows 52 cols
[2024-06-01 08:20:44] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 08:20:44] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/28 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 10/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 22/50 variables, 8/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 2/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/90 variables, 10/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 1/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 5/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/92 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/92 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 32/124 variables, 13/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/124 variables, 22/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/124 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/140 variables, 11/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/140 variables, 2/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/140 variables, 4/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/140 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/142 variables, 2/103 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/142 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/142 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 103 constraints, problems are : Problem set: 1 solved, 1 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/30 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 8/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/32 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/43 variables, 7/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/43 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/43 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/43 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 49/92 variables, 6/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/92 variables, 24/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/92 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 37/129 variables, 21/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/129 variables, 3/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/129 variables, 6/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/129 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/131 variables, 1/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/131 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 11/142 variables, 9/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/142 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/142 variables, 3/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/142 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/142 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 104 constraints, problems are : Problem set: 1 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 795ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 102/102 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 52 transition count 99
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 49 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 48 transition count 99
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 48 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 46 transition count 97
Applied a total of 12 rules in 33 ms. Remains 46 /52 variables (removed 6) and now considering 97/102 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 46/52 places, 97/102 transitions.
RANDOM walk for 40017 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2034535 steps, run timeout after 3001 ms. (steps per millisecond=677 ) properties seen :0 out of 1
Probabilistic random walk after 2034535 steps, saw 1182026 distinct states, run finished after 3012 ms. (steps per millisecond=675 ) properties seen :0
[2024-06-01 08:20:48] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
// Phase 1: matrix 84 rows 46 cols
[2024-06-01 08:20:48] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 08:20:48] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/31 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 32/64 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/64 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/64 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/64 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 49/113 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/113 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/113 variables, 23/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/113 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 17/130 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/130 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/130 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/130 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/130 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 44/44 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/31 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/32 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/32 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 32/64 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/64 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/64 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/64 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 49/113 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/113 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/113 variables, 23/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/113 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 17/130 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/130 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/130 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/130 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/130 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 46/46 places, 97/97 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-06-01 08:20:48] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
[2024-06-01 08:20:48] [INFO ] Invariant cache hit.
[2024-06-01 08:20:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 08:20:48] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
[2024-06-01 08:20:48] [INFO ] Invariant cache hit.
[2024-06-01 08:20:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 08:20:48] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-06-01 08:20:48] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-06-01 08:20:48] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
[2024-06-01 08:20:48] [INFO ] Invariant cache hit.
[2024-06-01 08:20:48] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 08:20:49] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:20:49] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 84/130 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 44/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 100 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1417 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 84/130 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 44/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 96/196 constraints. Problems are: Problem set: 8 solved, 88 unsolved
[2024-06-01 08:20:50] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:20:50] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/198 constraints. Problems are: Problem set: 8 solved, 88 unsolved
[2024-06-01 08:20:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/199 constraints. Problems are: Problem set: 8 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/199 constraints. Problems are: Problem set: 8 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/199 constraints. Problems are: Problem set: 8 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 199 constraints, problems are : Problem set: 8 solved, 88 unsolved in 1965 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 5/5 constraints]
After SMT, in 3421ms problems are : Problem set: 8 solved, 88 unsolved
Search for dead transitions found 8 dead transitions in 3423ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 46/46 places, 89/97 transitions.
Reduce places removed 4 places and 14 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 75
Reduce places removed 1 places and 8 transitions.
Graph (complete) has 138 edges and 41 vertex of which 1 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 67 output transitions
Drop transitions (Output transitions of discarded places.) removed 67 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1 transition count 0
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 6 rules in 16 ms. Remains 1 /46 variables (removed 45) and now considering 0/89 (removed 89) transitions.
[2024-06-01 08:20:52] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 08:20:52] [INFO ] Implicit Places using invariants in 11 ms returned []
[2024-06-01 08:20:52] [INFO ] Invariant cache hit.
[2024-06-01 08:20:52] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/46 places, 0/97 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3608 ms. Remains : 1/46 places, 0/97 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
FORMULA Medical-PT-12-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 22 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((!p0&&X(F(p0)))))))'
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-06-01 08:20:52] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
// Phase 1: matrix 90 rows 52 cols
[2024-06-01 08:20:52] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 08:20:52] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 08:20:52] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
[2024-06-01 08:20:52] [INFO ] Invariant cache hit.
[2024-06-01 08:20:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 08:20:52] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-06-01 08:20:52] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
[2024-06-01 08:20:52] [INFO ] Invariant cache hit.
[2024-06-01 08:20:52] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 08:20:52] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:20:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 90/140 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 2/142 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 08:20:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/142 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/142 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 106 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2505 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 90/140 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 62/165 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 08:20:55] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 2/142 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 35/203 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 08:20:56] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/142 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/142 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (OVERLAPS) 0/142 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 205 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3322 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 5/5 constraints]
After SMT, in 5862ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 5864ms
Finished structural reductions in LTL mode , in 1 iterations and 5999 ms. Remains : 52/52 places, 102/102 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Medical-PT-12-LTLCardinality-00
Product exploration explored 100000 steps with 5307 reset in 222 ms.
Product exploration explored 100000 steps with 5224 reset in 169 ms.
Computed a total of 7 stabilizing places and 22 stable transitions
Computed a total of 7 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 7 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 114 steps (3 resets) in 5 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 102/102 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 52 transition count 99
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 49 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 48 transition count 99
Applied a total of 8 rules in 11 ms. Remains 48 /52 variables (removed 4) and now considering 99/102 (removed 3) transitions.
[2024-06-01 08:20:59] [INFO ] Flow matrix only has 86 transitions (discarded 13 similar events)
// Phase 1: matrix 86 rows 48 cols
[2024-06-01 08:20:59] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 08:20:59] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 08:20:59] [INFO ] Flow matrix only has 86 transitions (discarded 13 similar events)
[2024-06-01 08:20:59] [INFO ] Invariant cache hit.
[2024-06-01 08:20:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 08:20:59] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-06-01 08:20:59] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 08:20:59] [INFO ] Flow matrix only has 86 transitions (discarded 13 similar events)
[2024-06-01 08:20:59] [INFO ] Invariant cache hit.
[2024-06-01 08:20:59] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 08:21:00] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 86/134 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 44/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 101 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1298 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 86/134 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 44/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 97/198 constraints. Problems are: Problem set: 8 solved, 89 unsolved
[2024-06-01 08:21:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:21:01] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:21:01] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:21:02] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:21:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 5/203 constraints. Problems are: Problem set: 8 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/203 constraints. Problems are: Problem set: 8 solved, 89 unsolved
[2024-06-01 08:21:02] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/134 variables, 1/204 constraints. Problems are: Problem set: 8 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/204 constraints. Problems are: Problem set: 8 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/204 constraints. Problems are: Problem set: 8 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 204 constraints, problems are : Problem set: 8 solved, 89 unsolved in 2768 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints]
After SMT, in 4094ms problems are : Problem set: 8 solved, 89 unsolved
Search for dead transitions found 8 dead transitions in 4096ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 48/52 places, 91/102 transitions.
Reduce places removed 4 places and 14 transitions.
Reduce places removed 2 places and 8 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 69
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 41 transition count 67
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 40 transition count 62
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5 place count 39 transition count 58
Applied a total of 5 rules in 10 ms. Remains 39 /48 variables (removed 9) and now considering 58/91 (removed 33) transitions.
[2024-06-01 08:21:03] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 39 cols
[2024-06-01 08:21:03] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 08:21:03] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 08:21:03] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-06-01 08:21:03] [INFO ] Invariant cache hit.
[2024-06-01 08:21:03] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-01 08:21:04] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/52 places, 58/102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4352 ms. Remains : 39/52 places, 58/102 transitions.
Computed a total of 8 stabilizing places and 12 stable transitions
Computed a total of 8 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 112 steps (4 resets) in 4 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6016 reset in 106 ms.
Stack based approach found an accepted trace after 6494 steps with 390 reset with depth 43 and stack size 43 in 12 ms.
FORMULA Medical-PT-12-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Medical-PT-12-LTLCardinality-00 finished in 12495 ms.
All properties solved by simple procedures.
Total runtime 39473 ms.
ITS solved all properties within timeout

BK_STOP 1717230064869

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="Medical-PT-12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Medical-PT-12, 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 r504-tall-171649613000555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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