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.r492-smll-171636265900004.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 EGFr-PT-02010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636265900004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 11 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 11 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 59K 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 EGFr-PT-02010-LTLFireability-00
FORMULA_NAME EGFr-PT-02010-LTLFireability-01
FORMULA_NAME EGFr-PT-02010-LTLFireability-02
FORMULA_NAME EGFr-PT-02010-LTLFireability-03
FORMULA_NAME EGFr-PT-02010-LTLFireability-04
FORMULA_NAME EGFr-PT-02010-LTLFireability-05
FORMULA_NAME EGFr-PT-02010-LTLFireability-06
FORMULA_NAME EGFr-PT-02010-LTLFireability-07
FORMULA_NAME EGFr-PT-02010-LTLFireability-08
FORMULA_NAME EGFr-PT-02010-LTLFireability-09
FORMULA_NAME EGFr-PT-02010-LTLFireability-10
FORMULA_NAME EGFr-PT-02010-LTLFireability-11
FORMULA_NAME EGFr-PT-02010-LTLFireability-12
FORMULA_NAME EGFr-PT-02010-LTLFireability-13
FORMULA_NAME EGFr-PT-02010-LTLFireability-14
FORMULA_NAME EGFr-PT-02010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717193248950

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EGFr-PT-02010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:07:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:07:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:07:31] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2024-05-31 22:07:32] [INFO ] Transformed 40 places.
[2024-05-31 22:07:32] [INFO ] Transformed 68 transitions.
[2024-05-31 22:07:32] [INFO ] Found NUPN structural information;
[2024-05-31 22:07:32] [INFO ] Parsed PT model containing 40 places and 68 transitions and 338 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA EGFr-PT-02010-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 19 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-31 22:07:32] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2024-05-31 22:07:32] [INFO ] Computed 20 invariants in 10 ms
[2024-05-31 22:07:32] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-31 22:07:32] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2024-05-31 22:07:32] [INFO ] Invariant cache hit.
[2024-05-31 22:07:32] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 22:07:32] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-31 22:07:32] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2024-05-31 22:07:32] [INFO ] Invariant cache hit.
[2024-05-31 22:07:32] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-31 22:07:33] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 16 ms to minimize.
[2024-05-31 22:07:33] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-31 22:07:33] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-31 22:07:33] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 4 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-31 22:07:33] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-31 22:07:33] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 6/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/106 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 19/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 125 constraints, problems are : Problem set: 9 solved, 56 unsolved in 2095 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 9 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 6/64 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/65 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 39/79 variables, 40/106 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 19/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 56/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 181 constraints, problems are : Problem set: 15 solved, 50 unsolved in 1398 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 56/65 constraints, Known Traps: 6/6 constraints]
After SMT, in 3609ms problems are : Problem set: 15 solved, 50 unsolved
Search for dead transitions found 15 dead transitions in 3633ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 53/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4214 ms. Remains : 40/40 places, 53/68 transitions.
Support contains 35 out of 40 places after structural reductions.
[2024-05-31 22:07:36] [INFO ] Flatten gal took : 29 ms
[2024-05-31 22:07:36] [INFO ] Flatten gal took : 13 ms
[2024-05-31 22:07:36] [INFO ] Input system was already deterministic with 53 transitions.
Support contains 33 out of 40 places (down from 35) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 24 to 21
RANDOM walk for 40000 steps (1791 resets) in 2522 ms. (15 steps per ms) remains 11/21 properties
BEST_FIRST walk for 40003 steps (396 resets) in 333 ms. (119 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (490 resets) in 217 ms. (183 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (399 resets) in 168 ms. (236 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (460 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (398 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (454 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (356 resets) in 136 ms. (291 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (452 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (390 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (415 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (450 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
[2024-05-31 22:07:38] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2024-05-31 22:07:38] [INFO ] Computed 20 invariants in 0 ms
[2024-05-31 22:07:38] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 3/38 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 8/34 variables, 8/46 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 8/54 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
Problem AtomicPropp0 is UNSAT
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
Problem AtomicPropp2 is UNSAT
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem AtomicPropp6 is UNSAT
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Problem AtomicPropp11 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 4/58 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/58 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 27/61 variables, 34/92 constraints. Problems are: Problem set: 6 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 16/108 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/61 variables, 0/108 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/64 variables, 3/111 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/64 variables, 0/111 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 9/73 variables, 6/117 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/73 variables, 6/123 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/73 variables, 3/126 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 0/126 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/73 variables, 0/126 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 126 constraints, problems are : Problem set: 6 solved, 5 unsolved in 500 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 6 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 3/13 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/14 variables, 4/17 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 4/21 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/21 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 14/28 variables, 14/35 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 5/40 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 3/43 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 0/43 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 10/38 variables, 8/51 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 0/51 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 26/64 variables, 20/71 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/64 variables, 20/91 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/64 variables, 10/101 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/64 variables, 2/103 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/64 variables, 3/106 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/64 variables, 0/106 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 3/67 variables, 4/110 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/67 variables, 2/112 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/67 variables, 0/112 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 6/73 variables, 6/118 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/73 variables, 6/124 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/73 variables, 3/127 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/73 variables, 4/131 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/73 variables, 0/131 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 0/73 variables, 0/131 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 131 constraints, problems are : Problem set: 6 solved, 5 unsolved in 369 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 5/11 constraints, Known Traps: 7/7 constraints]
After SMT, in 882ms problems are : Problem set: 6 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 10 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 53/53 transitions.
Graph (complete) has 116 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 30 transition count 39
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 29 transition count 37
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 29 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 28 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 27 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 25 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 23 transition count 34
Applied a total of 21 rules in 46 ms. Remains 23 /40 variables (removed 17) and now considering 34/53 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 23/40 places, 34/53 transitions.
RANDOM walk for 40000 steps (3260 resets) in 826 ms. (48 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1010 resets) in 462 ms. (86 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (988 resets) in 443 ms. (90 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (999 resets) in 516 ms. (77 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (859 resets) in 310 ms. (128 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (971 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
Probably explored full state space saw : 496 states, properties seen :0
Probabilistic random walk after 2398 steps, saw 496 distinct states, run finished after 34 ms. (steps per millisecond=70 ) properties seen :0
Explored full state space saw : 496 states, properties seen :0
Exhaustive walk after 2398 steps, saw 496 distinct states, run finished after 24 ms. (steps per millisecond=99 ) properties seen :0
Successfully simplified 14 atomic propositions for a total of 10 simplifications.
FORMULA EGFr-PT-02010-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 7 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(F(((!p0&&F(!p1)) U (G((!p0&&F(!p1)))||(F(!p1)&&p2))))))'
Support contains 12 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 36 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 34 transition count 50
Applied a total of 5 rules in 10 ms. Remains 34 /40 variables (removed 6) and now considering 50/53 (removed 3) transitions.
[2024-05-31 22:07:40] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
// Phase 1: matrix 30 rows 34 cols
[2024-05-31 22:07:40] [INFO ] Computed 17 invariants in 1 ms
[2024-05-31 22:07:40] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 22:07:40] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
[2024-05-31 22:07:40] [INFO ] Invariant cache hit.
[2024-05-31 22:07:40] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 22:07:40] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-31 22:07:40] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-31 22:07:40] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
[2024-05-31 22:07:40] [INFO ] Invariant cache hit.
[2024-05-31 22:07:40] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:07:40] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-31 22:07:40] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 22:07:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-31 22:07:40] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 4/55 constraints. Problems are: Problem set: 1 solved, 45 unsolved
[2024-05-31 22:07:40] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-31 22:07:41] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 2/57 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 30/64 variables, 34/91 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 15/106 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 106 constraints, problems are : Problem set: 1 solved, 45 unsolved in 1094 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 34/34 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 17/51 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 6/57 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 30/64 variables, 34/91 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 15/106 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 45/151 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 151 constraints, problems are : Problem set: 1 solved, 45 unsolved in 553 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 34/34 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/46 constraints, Known Traps: 6/6 constraints]
After SMT, in 1677ms problems are : Problem set: 1 solved, 45 unsolved
Search for dead transitions found 1 dead transitions in 1679ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 34/40 places, 49/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-05-31 22:07:42] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1836 ms. Remains : 34/40 places, 49/53 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Running random walk in product with property : EGFr-PT-02010-LTLFireability-05
Product exploration explored 100000 steps with 6968 reset in 546 ms.
Product exploration explored 100000 steps with 6962 reset in 307 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (OR (AND p2 p1) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (OR (AND p2 p1) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 330 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
RANDOM walk for 40000 steps (2244 resets) in 77 ms. (512 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (544 resets) in 448 ms. (89 steps per ms) remains 1/1 properties
[2024-05-31 22:07:44] [INFO ] Flow matrix only has 29 transitions (discarded 20 similar events)
// Phase 1: matrix 29 rows 34 cols
[2024-05-31 22:07:44] [INFO ] Computed 17 invariants in 2 ms
[2024-05-31 22:07:44] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/14 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/23 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/28 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/43 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/43 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/43 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/43 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/46 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/46 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/55 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/55 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/55 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/55 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/57 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/57 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/63 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/63 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/63 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/63 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/63 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 34/34 constraints, ReadFeed: 15/15 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/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/14 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:07:44] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Problem apf2 is UNSAT
After SMT solving in domain Int declared 14/63 variables, and 22 constraints, problems are : Problem set: 1 solved, 0 unsolved in 74 ms.
Refiners :[Domain max(s): 14/34 constraints, Positive P Invariants (semi-flows): 7/17 constraints, State Equation: 0/34 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 225ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (OR (AND p2 p1) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (OR (AND p2 p1) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (G (OR p2 p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (OR (NOT p2) (NOT p1)) (OR p0 (NOT p1))))), (F p0), (F p1), (F (NOT p2)), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 11 factoid took 866 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1]
Support contains 12 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 49/49 transitions.
Applied a total of 0 rules in 9 ms. Remains 34 /34 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-05-31 22:07:45] [INFO ] Flow matrix only has 29 transitions (discarded 20 similar events)
[2024-05-31 22:07:45] [INFO ] Invariant cache hit.
[2024-05-31 22:07:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 22:07:45] [INFO ] Flow matrix only has 29 transitions (discarded 20 similar events)
[2024-05-31 22:07:45] [INFO ] Invariant cache hit.
[2024-05-31 22:07:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 22:07:45] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-31 22:07:45] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-31 22:07:45] [INFO ] Flow matrix only has 29 transitions (discarded 20 similar events)
[2024-05-31 22:07:45] [INFO ] Invariant cache hit.
[2024-05-31 22:07:45] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-31 22:07:46] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:07:46] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:07:46] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:07:46] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 29/63 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 15/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 104 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1010 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 34/34 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-31 22:07:46] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 29/63 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 15/105 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 45/150 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/63 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 150 constraints, problems are : Problem set: 0 solved, 45 unsolved in 671 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 34/34 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 5/5 constraints]
After SMT, in 1707ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1709ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1905 ms. Remains : 34/34 places, 49/49 transitions.
Computed a total of 10 stabilizing places and 9 stable transitions
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1]
RANDOM walk for 110 steps (5 resets) in 7 ms. (13 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F p1), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1]
Product exploration explored 100000 steps with 7005 reset in 301 ms.
Product exploration explored 100000 steps with 6962 reset in 481 ms.
Support contains 12 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 49/49 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-05-31 22:07:49] [INFO ] Flow matrix only has 29 transitions (discarded 20 similar events)
[2024-05-31 22:07:49] [INFO ] Invariant cache hit.
[2024-05-31 22:07:49] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 22:07:49] [INFO ] Flow matrix only has 29 transitions (discarded 20 similar events)
[2024-05-31 22:07:49] [INFO ] Invariant cache hit.
[2024-05-31 22:07:49] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 22:07:49] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-31 22:07:49] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-31 22:07:49] [INFO ] Flow matrix only has 29 transitions (discarded 20 similar events)
[2024-05-31 22:07:49] [INFO ] Invariant cache hit.
[2024-05-31 22:07:49] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-31 22:07:49] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:07:49] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:07:49] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:07:50] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 29/63 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 15/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 104 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1159 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 34/34 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-31 22:07:51] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 29/63 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 15/105 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 45/150 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/63 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 150 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1027 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 34/34 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 5/5 constraints]
After SMT, in 2204ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 2205ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2416 ms. Remains : 34/34 places, 49/49 transitions.
Treatment of property EGFr-PT-02010-LTLFireability-05 finished in 11519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(!p0)&&G(p1)) U (p0||X(p2)))))'
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-31 22:07:51] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2024-05-31 22:07:51] [INFO ] Computed 20 invariants in 3 ms
[2024-05-31 22:07:52] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-31 22:07:52] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-31 22:07:52] [INFO ] Invariant cache hit.
[2024-05-31 22:07:52] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 22:07:52] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-05-31 22:07:52] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-31 22:07:52] [INFO ] Invariant cache hit.
[2024-05-31 22:07:52] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 7/65 constraints. Problems are: Problem set: 1 solved, 49 unsolved
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:07:52] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:07:53] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 7/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 33/73 variables, 40/114 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 19/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 133 constraints, problems are : Problem set: 1 solved, 49 unsolved in 2199 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 1 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 14/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 33/73 variables, 40/114 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 19/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 49/182 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 182 constraints, problems are : Problem set: 1 solved, 49 unsolved in 1302 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 49/50 constraints, Known Traps: 14/14 constraints]
After SMT, in 3532ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 3534ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 52/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3788 ms. Remains : 40/40 places, 52/53 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p1)]
Running random walk in product with property : EGFr-PT-02010-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA EGFr-PT-02010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EGFr-PT-02010-LTLFireability-08 finished in 4069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0) U !p1)))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2024-05-31 22:07:55] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 39 cols
[2024-05-31 22:07:55] [INFO ] Computed 19 invariants in 2 ms
[2024-05-31 22:07:56] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-31 22:07:56] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-31 22:07:56] [INFO ] Invariant cache hit.
[2024-05-31 22:07:56] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 22:07:56] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-31 22:07:56] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-31 22:07:56] [INFO ] Invariant cache hit.
[2024-05-31 22:07:56] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 22:07:56] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:07:56] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-31 22:07:56] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 22:07:56] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:07:56] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:07:56] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:07:56] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-31 22:07:56] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:07:56] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-31 22:07:56] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-31 22:07:57] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:07:57] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 89 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1914 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 136 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1151 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 12/12 constraints]
After SMT, in 3092ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 3094ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 50/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3340 ms. Remains : 39/40 places, 50/53 transitions.
Stuttering acceptance computed with spot in 279 ms :[p1, p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : EGFr-PT-02010-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA EGFr-PT-02010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EGFr-PT-02010-LTLFireability-12 finished in 3646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 8 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2024-05-31 22:07:59] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-31 22:07:59] [INFO ] Invariant cache hit.
[2024-05-31 22:07:59] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-31 22:07:59] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-31 22:07:59] [INFO ] Invariant cache hit.
[2024-05-31 22:07:59] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 22:07:59] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-05-31 22:07:59] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-31 22:07:59] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-31 22:07:59] [INFO ] Invariant cache hit.
[2024-05-31 22:07:59] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 22:08:00] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 14 ms to minimize.
[2024-05-31 22:08:00] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:08:00] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 22:08:00] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:08:00] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:08:00] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-31 22:08:00] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-31 22:08:00] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
[2024-05-31 22:08:00] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-31 22:08:00] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-31 22:08:00] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:08:00] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 89 constraints, problems are : Problem set: 1 solved, 47 unsolved in 2067 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 136 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 12/12 constraints]
After SMT, in 3218ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 3219ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 39/40 places, 50/53 transitions.
Applied a total of 0 rules in 6 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-31 22:08:03] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 3477 ms. Remains : 39/40 places, 50/53 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : EGFr-PT-02010-LTLFireability-15
Product exploration explored 100000 steps with 33364 reset in 259 ms.
Product exploration explored 100000 steps with 33316 reset in 294 ms.
Computed a total of 15 stabilizing places and 11 stable transitions
Computed a total of 15 stabilizing places and 11 stable transitions
Detected a total of 15/39 stabilizing places and 11/50 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 245 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 256 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2024-05-31 22:08:04] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 39 cols
[2024-05-31 22:08:04] [INFO ] Computed 19 invariants in 2 ms
[2024-05-31 22:08:04] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-31 22:08:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 22:08:04] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 22:08:04] [INFO ] [Real]Added 19 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:08:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:08:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-31 22:08:04] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 22:08:04] [INFO ] [Nat]Added 19 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:08:04] [INFO ] Computed and/alt/rep : 47/63/29 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 22:08:04] [INFO ] Added : 10 causal constraints over 2 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 50/50 transitions.
Applied a total of 0 rules in 5 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-31 22:08:04] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2024-05-31 22:08:04] [INFO ] Invariant cache hit.
[2024-05-31 22:08:04] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 22:08:04] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2024-05-31 22:08:04] [INFO ] Invariant cache hit.
[2024-05-31 22:08:04] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 22:08:04] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-31 22:08:04] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-31 22:08:04] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2024-05-31 22:08:04] [INFO ] Invariant cache hit.
[2024-05-31 22:08:04] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-31 22:08:05] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:08:05] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:08:05] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:08:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-31 22:08:05] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-31 22:08:05] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:08:05] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
[2024-05-31 22:08:05] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-31 22:08:05] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-31 22:08:05] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 32/71 variables, 39/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 87 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1565 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 32/71 variables, 39/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 47/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 134 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints]
After SMT, in 2671ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2676ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2918 ms. Remains : 39/39 places, 50/50 transitions.
Computed a total of 15 stabilizing places and 11 stable transitions
Computed a total of 15 stabilizing places and 11 stable transitions
Detected a total of 15/39 stabilizing places and 11/50 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 240 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 7 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 283 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-31 22:08:08] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2024-05-31 22:08:08] [INFO ] Invariant cache hit.
[2024-05-31 22:08:08] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-31 22:08:08] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 22:08:08] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 22:08:08] [INFO ] [Real]Added 19 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:08:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:08:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-31 22:08:08] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 22:08:08] [INFO ] [Nat]Added 19 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:08:08] [INFO ] Computed and/alt/rep : 47/63/29 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 22:08:08] [INFO ] Added : 5 causal constraints over 1 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33344 reset in 157 ms.
Product exploration explored 100000 steps with 33277 reset in 192 ms.
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 50/50 transitions.
Applied a total of 0 rules in 6 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-31 22:08:08] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2024-05-31 22:08:08] [INFO ] Invariant cache hit.
[2024-05-31 22:08:09] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-31 22:08:09] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2024-05-31 22:08:09] [INFO ] Invariant cache hit.
[2024-05-31 22:08:09] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 22:08:09] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-31 22:08:09] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-31 22:08:09] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2024-05-31 22:08:09] [INFO ] Invariant cache hit.
[2024-05-31 22:08:09] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-31 22:08:09] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
[2024-05-31 22:08:09] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:08:09] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:08:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:08:09] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:08:09] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:08:09] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:08:09] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-31 22:08:09] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-31 22:08:09] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 32/71 variables, 39/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 87 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 32/71 variables, 39/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 47/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 134 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints]
After SMT, in 2976ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2978ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3237 ms. Remains : 39/39 places, 50/50 transitions.
Treatment of property EGFr-PT-02010-LTLFireability-15 finished in 12618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&F(!p1)) U (G((!p0&&F(!p1)))||(F(!p1)&&p2))))))'
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))'
[2024-05-31 22:08:12] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:08:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2024-05-31 22:08:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 53 transitions and 278 arcs took 4 ms.
Total runtime 41318 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA EGFr-PT-02010-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA EGFr-PT-02010-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717193293544

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name EGFr-PT-02010-LTLFireability-05
ltl formula formula --ltl=/tmp/1279/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 40 places, 53 transitions and 278 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1279/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1279/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1279/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1279/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 41 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 41, there are 78 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6267
pnml2lts-mc( 0/ 4): unique states count: 6267
pnml2lts-mc( 0/ 4): unique transitions count: 41949
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 35940
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6483
pnml2lts-mc( 0/ 4): - cum. max stack depth: 86
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6483 states 43790 transitions, fanout: 6.755
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 72033, Transitions per second: 486556
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 9.1 B/state, compr.: 5.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 53 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name EGFr-PT-02010-LTLFireability-15
ltl formula formula --ltl=/tmp/1279/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 40 places, 53 transitions and 278 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1279/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1279/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1279/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1279/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 42 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 41, there are 57 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8
pnml2lts-mc( 0/ 4): unique states count: 8
pnml2lts-mc( 0/ 4): unique transitions count: 8
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 22
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22 states 28 transitions, fanout: 1.273
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 30.0 B/state, compr.: 18.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 53 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EGFr-PT-02010"
export BK_EXAMINATION="LTLFireability"
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 EGFr-PT-02010, 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 r492-smll-171636265900004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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