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.r224-tall-171649613000532.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 Medical-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649613000532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 13 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:27 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-06-LTLFireability-00
FORMULA_NAME Medical-PT-06-LTLFireability-01
FORMULA_NAME Medical-PT-06-LTLFireability-02
FORMULA_NAME Medical-PT-06-LTLFireability-03
FORMULA_NAME Medical-PT-06-LTLFireability-04
FORMULA_NAME Medical-PT-06-LTLFireability-05
FORMULA_NAME Medical-PT-06-LTLFireability-06
FORMULA_NAME Medical-PT-06-LTLFireability-07
FORMULA_NAME Medical-PT-06-LTLFireability-08
FORMULA_NAME Medical-PT-06-LTLFireability-09
FORMULA_NAME Medical-PT-06-LTLFireability-10
FORMULA_NAME Medical-PT-06-LTLFireability-11
FORMULA_NAME Medical-PT-06-LTLFireability-12
FORMULA_NAME Medical-PT-06-LTLFireability-13
FORMULA_NAME Medical-PT-06-LTLFireability-14
FORMULA_NAME Medical-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716606545123

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-25 03:09:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 03:09:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 03:09:06] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2024-05-25 03:09:06] [INFO ] Transformed 312 places.
[2024-05-25 03:09:06] [INFO ] Transformed 5431 transitions.
[2024-05-25 03:09:06] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 440 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 242 places in 23 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA Medical-PT-06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 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-05-25 03:09:06] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 67 cols
[2024-05-25 03:09:06] [INFO ] Computed 8 invariants in 12 ms
[2024-05-25 03:09:07] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-25 03:09:07] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-25 03:09:07] [INFO ] Invariant cache hit.
[2024-05-25 03:09:07] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-25 03:09:07] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-05-25 03:09:07] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-25 03:09:07] [INFO ] Invariant cache hit.
[2024-05-25 03:09:07] [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-05-25 03:09:08] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 8 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-05-25 03:09:09] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-25 03:09:09] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
[2024-05-25 03:09:09] [INFO ] Deduced a trap composed of 7 places in 21 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 5906 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
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/266 constraints. Problems are: Problem set: 9 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 2/249 variables, 2/268 constraints. Problems are: Problem set: 9 solved, 213 unsolved
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 83/351 constraints. Problems are: Problem set: 14 solved, 208 unsolved
[2024-05-25 03:09:17] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-25 03:09:18] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD170 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 2/353 constraints. Problems are: Problem set: 18 solved, 204 unsolved
[2024-05-25 03:09:19] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 1/354 constraints. Problems are: Problem set: 18 solved, 204 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/354 constraints. Problems are: Problem set: 18 solved, 204 unsolved
At refinement iteration 15 (OVERLAPS) 0/249 variables, 0/354 constraints. Problems are: Problem set: 18 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 354 constraints, problems are : Problem set: 18 solved, 204 unsolved in 11025 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: 7/7 constraints]
After SMT, in 17171ms problems are : Problem set: 18 solved, 204 unsolved
Search for dead transitions found 18 dead transitions in 17197ms
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 5 places and 43 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 62 transition count 166
Reduce places removed 4 places and 31 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 58 transition count 135
Reduce places removed 2 places and 14 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 56 transition count 121
Reduce places removed 3 places and 19 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 14 place count 53 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 14 rules in 5 ms. Remains 53 /67 variables (removed 14) and now considering 102/209 (removed 107) transitions.
[2024-05-25 03:09:24] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
// Phase 1: matrix 90 rows 53 cols
[2024-05-25 03:09:24] [INFO ] Computed 9 invariants in 2 ms
[2024-05-25 03:09:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-25 03:09:24] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
[2024-05-25 03:09:24] [INFO ] Invariant cache hit.
[2024-05-25 03:09:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-25 03:09:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 53/69 places, 102/227 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17769 ms. Remains : 53/69 places, 102/227 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Support contains 3 out of 52 places after structural reductions.
FORMULA Medical-PT-06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 03:09:24] [INFO ] Flatten gal took : 34 ms
[2024-05-25 03:09:24] [INFO ] Flatten gal took : 14 ms
[2024-05-25 03:09:24] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 40004 steps (214 resets) in 743 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (10 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1774169 steps, run timeout after 3001 ms. (steps per millisecond=591 ) properties seen :0 out of 1
Probabilistic random walk after 1774169 steps, saw 995725 distinct states, run finished after 3005 ms. (steps per millisecond=590 ) properties seen :0
[2024-05-25 03:09:28] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
// Phase 1: matrix 90 rows 52 cols
[2024-05-25 03:09:28] [INFO ] Computed 8 invariants in 3 ms
[2024-05-25 03:09:28] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/34 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/59 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 42/101 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/103 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/103 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/103 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 30/133 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/133 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/133 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/133 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/135 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/135 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/135 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/142 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/142 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/142 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/142 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 43/43 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/34 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/59 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 42/101 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/101 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/103 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/103 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/103 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 30/133 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/133 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/133 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/133 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/135 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/135 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/135 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/142 variables, 7/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/142 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/142 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/142 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 186ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 3 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
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 49 transition count 96
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 46 transition count 96
Applied a total of 12 rules in 15 ms. Remains 46 /52 variables (removed 6) and now considering 96/102 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 46/52 places, 96/102 transitions.
RANDOM walk for 40008 steps (8 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2010860 steps, run timeout after 3001 ms. (steps per millisecond=670 ) properties seen :0 out of 1
Probabilistic random walk after 2010860 steps, saw 1129367 distinct states, run finished after 3001 ms. (steps per millisecond=670 ) properties seen :0
[2024-05-25 03:09:31] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 46 cols
[2024-05-25 03:09:31] [INFO ] Computed 8 invariants in 5 ms
[2024-05-25 03:09:31] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/34 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/60 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 43/103 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/103 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/125 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/125 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/125 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/130 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/130 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/130 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/130 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/130 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/34 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/60 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/103 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/103 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/103 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/125 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/125 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/125 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/130 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/130 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/130 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/130 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/130 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 46/46 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-25 03:09:31] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-25 03:09:31] [INFO ] Invariant cache hit.
[2024-05-25 03:09:31] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-25 03:09:31] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-25 03:09:31] [INFO ] Invariant cache hit.
[2024-05-25 03:09:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-25 03:09:31] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-25 03:09:31] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-25 03:09:31] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-25 03:09:31] [INFO ] Invariant cache hit.
[2024-05-25 03:09:31] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 03:09:32] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-25 03:09:32] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 84/130 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 43/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 03:09:32] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 95 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 100 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1387 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 84/130 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 43/100 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 95/195 constraints. Problems are: Problem set: 2 solved, 93 unsolved
[2024-05-25 03:09:33] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-25 03:09:33] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-25 03:09:33] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD27 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 3/198 constraints. Problems are: Problem set: 4 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/198 constraints. Problems are: Problem set: 4 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/198 constraints. Problems are: Problem set: 4 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 198 constraints, problems are : Problem set: 4 solved, 91 unsolved in 1759 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 6/6 constraints]
After SMT, in 3183ms problems are : Problem set: 4 solved, 91 unsolved
Search for dead transitions found 4 dead transitions in 3185ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 46/46 places, 92/96 transitions.
Reduce places removed 3 places and 11 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 43 transition count 81
Reduce places removed 2 places and 8 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 41 transition count 73
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 40 transition count 71
Applied a total of 6 rules in 13 ms. Remains 40 /46 variables (removed 6) and now considering 71/92 (removed 21) transitions.
[2024-05-25 03:09:35] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
// Phase 1: matrix 64 rows 40 cols
[2024-05-25 03:09:35] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 03:09:35] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-25 03:09:35] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
[2024-05-25 03:09:35] [INFO ] Invariant cache hit.
[2024-05-25 03:09:35] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-25 03:09:35] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 40/46 places, 71/96 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3445 ms. Remains : 40/46 places, 71/96 transitions.
RANDOM walk for 40012 steps (8 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2384865 steps, run timeout after 3001 ms. (steps per millisecond=794 ) properties seen :0 out of 1
Probabilistic random walk after 2384865 steps, saw 1339737 distinct states, run finished after 3001 ms. (steps per millisecond=794 ) properties seen :0
[2024-05-25 03:09:38] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
[2024-05-25 03:09:38] [INFO ] Invariant cache hit.
[2024-05-25 03:09:38] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/29 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/53 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/83 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/83 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/83 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/99 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/99 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/99 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/99 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/100 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/100 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/100 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/104 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/104 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/104 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/104 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/104 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 33/33 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/29 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/53 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 30/83 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/83 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/83 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/83 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/99 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/99 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/99 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/99 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/100 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/100 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/100 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/104 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/104 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/104 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/104 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/104 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 82 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 71/71 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 40/40 places, 71/71 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 71/71 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-25 03:09:38] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
[2024-05-25 03:09:38] [INFO ] Invariant cache hit.
[2024-05-25 03:09:38] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-25 03:09:38] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
[2024-05-25 03:09:38] [INFO ] Invariant cache hit.
[2024-05-25 03:09:38] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-25 03:09:38] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-25 03:09:38] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-25 03:09:38] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
[2024-05-25 03:09:38] [INFO ] Invariant cache hit.
[2024-05-25 03:09:38] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-25 03:09:38] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 33/82 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 82 constraints, problems are : Problem set: 0 solved, 70 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 33/82 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 70/152 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-25 03:09:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-25 03:09:39] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 154 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1297 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 3/3 constraints]
After SMT, in 2185ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2299 ms. Remains : 40/40 places, 71/71 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 104 edges and 40 vertex of which 38 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 12 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 0 with 13 rules applied. Total rules applied 14 place count 38 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 37 transition count 58
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 37 transition count 57
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 36 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 33 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 30 transition count 66
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 30 transition count 74
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 27 transition count 74
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 27 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 26 transition count 91
Applied a total of 34 rules in 18 ms. Remains 26 /40 variables (removed 14) and now considering 91/71 (removed -20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 91 rows 26 cols
[2024-05-25 03:09:40] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 03:09:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 03:09:40] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 03:09:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 03:09:40] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 03:09:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-25 03:09:40] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 03:09:40] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 03:09:40] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 123 ms.
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' '!(F(p0))'
Support contains 3 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
Applied a total of 6 rules in 7 ms. Remains 49 /52 variables (removed 3) and now considering 99/102 (removed 3) transitions.
[2024-05-25 03:09:40] [INFO ] Flow matrix only has 87 transitions (discarded 12 similar events)
// Phase 1: matrix 87 rows 49 cols
[2024-05-25 03:09:40] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 03:09:40] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-25 03:09:40] [INFO ] Flow matrix only has 87 transitions (discarded 12 similar events)
[2024-05-25 03:09:40] [INFO ] Invariant cache hit.
[2024-05-25 03:09:40] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-25 03:09:40] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-25 03:09:40] [INFO ] Redundant transitions in 3 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-25 03:09:40] [INFO ] Flow matrix only has 87 transitions (discarded 12 similar events)
[2024-05-25 03:09:40] [INFO ] Invariant cache hit.
[2024-05-25 03:09:40] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 03:09:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-25 03:09:41] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 87/136 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 43/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 03:09:42] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-25 03:09:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-25 03:09:42] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 3/105 constraints. Problems are: Problem set: 2 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 105 constraints, problems are : Problem set: 2 solved, 95 unsolved in 1993 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/12 constraints. Problems are: Problem set: 2 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 87/136 variables, 49/62 constraints. Problems are: Problem set: 2 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 43/105 constraints. Problems are: Problem set: 2 solved, 95 unsolved
Problem TDEAD54 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 95/200 constraints. Problems are: Problem set: 3 solved, 94 unsolved
[2024-05-25 03:09:43] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-25 03:09:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-25 03:09:43] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-25 03:09:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 4/204 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 204 constraints, problems are : Problem set: 3 solved, 94 unsolved in 1951 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 95/97 constraints, Known Traps: 9/9 constraints]
After SMT, in 3997ms problems are : Problem set: 3 solved, 94 unsolved
Search for dead transitions found 3 dead transitions in 4000ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/52 places, 96/102 transitions.
Reduce places removed 2 places and 7 transitions.
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 84
Applied a total of 1 rules in 10 ms. Remains 46 /49 variables (removed 3) and now considering 84/96 (removed 12) transitions.
[2024-05-25 03:09:44] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
// Phase 1: matrix 76 rows 46 cols
[2024-05-25 03:09:45] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 03:09:45] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-25 03:09:45] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
[2024-05-25 03:09:45] [INFO ] Invariant cache hit.
[2024-05-25 03:09:45] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-25 03:09:45] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/52 places, 84/102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4299 ms. Remains : 46/52 places, 84/102 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0)]
Running random walk in product with property : Medical-PT-06-LTLFireability-00
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 4 ms.
FORMULA Medical-PT-06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Medical-PT-06-LTLFireability-00 finished in 4523 ms.
All properties solved by simple procedures.
Total runtime 39060 ms.

BK_STOP 1716606585338

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="Medical-PT-06"
export BK_EXAMINATION="LTLFireability"
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 Medical-PT-06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-171649613000532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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