Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446400115.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S02J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446400115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 11K Apr 11 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 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 PolyORBLF-COL-S02J06T10-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717249314688

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:41:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:41:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:41:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:41:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:41:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 789 ms
[2024-06-01 13:41:56] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:41:57] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 8 ms.
[2024-06-01 13:41:57] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40002 steps (25 resets) in 1690 ms. (23 steps per ms) remains 7/28 properties
BEST_FIRST walk for 40000 steps (13 resets) in 412 ms. (96 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (10 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (16 resets) in 224 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (13 resets) in 194 ms. (205 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (19 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
[2024-06-01 13:41:58] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:41:58] [INFO ] Computed 26 invariants in 13 ms
[2024-06-01 13:41:58] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/50 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/53 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 5 (OVERLAPS) 26/79 variables, 14/24 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/80 variables, 1/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 6 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 6 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/23 variables, 2/4 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/46 variables, 3/7 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/49 variables, 2/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-06-01 13:41:58] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 117 constraints, problems are : Problem set: 6 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 457ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 41 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
Running 43 sub problems to find dead transitions.
[2024-06-01 13:41:58] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2024-06-01 13:41:58] [INFO ] Computed 25 invariants in 3 ms
[2024-06-01 13:41:58] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 13:41:58] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:41:58] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:41:58] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:41:59] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:41:59] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-06-01 13:41:59] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:41:59] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:41:59] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:41:59] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
[2024-06-01 13:41:59] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 4 ms to minimize.
[2024-06-01 13:41:59] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 6/36 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-06-01 13:41:59] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-06-01 13:41:59] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:41:59] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 2/39 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 43/102 variables, 59/98 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-06-01 13:42:00] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
[2024-06-01 13:42:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 2/108 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 13 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 108 constraints, problems are : Problem set: 2 solved, 41 unsolved in 2036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 2 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 8/41 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 43/102 variables, 59/100 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 41/149 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 149 constraints, problems are : Problem set: 2 solved, 41 unsolved in 1113 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 41/43 constraints, Known Traps: 16/16 constraints]
After SMT, in 3178ms problems are : Problem set: 2 solved, 41 unsolved
Search for dead transitions found 2 dead transitions in 3180ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/81 places, 42/65 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 194 edges and 57 vertex of which 1 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.2 ms
Discarding 56 places :
Also discarding 39 output transitions
Drop transitions (Output transitions of discarded places.) removed 39 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 8 ms. Remains 1 /59 variables (removed 58) and now considering 0/42 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3245 ms. Remains : 1/81 places, 0/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:42:02] [INFO ] Flatten gal took : 43 ms
[2024-06-01 13:42:02] [INFO ] Flatten gal took : 12 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:42:02] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 45 ms.
[2024-06-01 13:42:02] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 414 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 88 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 13:42:02] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-06-01 13:42:02] [INFO ] Computed 56 invariants in 65 ms
[2024-06-01 13:42:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 3 ms to minimize.
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 71 places in 460 ms of which 10 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 2 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:42:24] [INFO ] Deduced a trap composed of 433 places in 375 ms of which 5 ms to minimize.
[2024-06-01 13:42:24] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:42:24] [INFO ] Deduced a trap composed of 549 places in 428 ms of which 6 ms to minimize.
[2024-06-01 13:42:25] [INFO ] Deduced a trap composed of 223 places in 358 ms of which 5 ms to minimize.
SMT process timed out in 23108ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23145ms
[2024-06-01 13:42:25] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:42:25] [INFO ] Invariant cache hit.
[2024-06-01 13:42:25] [INFO ] Implicit Places using invariants in 471 ms returned [646, 647, 648, 649, 650, 651, 652, 653, 654, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 479 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 812/844 places, 1632/1652 transitions.
Applied a total of 0 rules in 11 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23743 ms. Remains : 812/844 places, 1632/1652 transitions.
Support contains 414 out of 812 places after structural reductions.
[2024-06-01 13:42:26] [INFO ] Flatten gal took : 130 ms
[2024-06-01 13:42:26] [INFO ] Flatten gal took : 107 ms
[2024-06-01 13:42:26] [INFO ] Input system was already deterministic with 1632 transitions.
Support contains 404 out of 812 places (down from 414) after GAL structural reductions.
RANDOM walk for 40001 steps (9 resets) in 794 ms. (50 steps per ms) remains 3/22 properties
BEST_FIRST walk for 40001 steps (10 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (12 resets) in 275 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 236 ms. (168 steps per ms) remains 3/3 properties
[2024-06-01 13:42:26] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-06-01 13:42:26] [INFO ] Computed 46 invariants in 34 ms
[2024-06-01 13:42:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 694/776 variables, 19/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:42:28] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:42:28] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/776 variables, 7/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/776 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/789 variables, 12/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 13:42:28] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:42:28] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/789 variables, 2/41 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 810/2424 variables, and 54 constraints, problems are : Problem set: 3 solved, 0 unsolved in 1502 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 1573ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1) U (!p0 U X(X(p2))))))'
Support contains 41 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 12 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 13:42:28] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:42:28] [INFO ] Invariant cache hit.
[2024-06-01 13:42:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:42:54] [INFO ] Deduced a trap composed of 73 places in 354 ms of which 5 ms to minimize.
[2024-06-01 13:42:55] [INFO ] Deduced a trap composed of 207 places in 372 ms of which 4 ms to minimize.
[2024-06-01 13:42:58] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:43:04] [INFO ] Deduced a trap composed of 117 places in 291 ms of which 5 ms to minimize.
[2024-06-01 13:43:04] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:43:09] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:43:10] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 1)
(s16 0)
(s17 1)
(s18 1)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)timeout

(s156 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 56 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 12/12 constraints]
After SMT, in 43221ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 43242ms
[2024-06-01 13:43:12] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:43:12] [INFO ] Invariant cache hit.
[2024-06-01 13:43:12] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-06-01 13:43:12] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:43:12] [INFO ] Invariant cache hit.
[2024-06-01 13:43:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:43:24] [INFO ] Implicit Places using invariants and state equation in 12141 ms returned []
Implicit Place search using SMT with State Equation took 12754 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 13:43:24] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:43:24] [INFO ] Invariant cache hit.
[2024-06-01 13:43:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 6 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 11 ms to minimize.
[2024-06-01 13:43:54] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:43:54] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:43:54] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:43:54] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:43:57] [INFO ] Deduced a trap composed of 457 places in 337 ms of which 5 ms to minimize.
[2024-06-01 13:43:57] [INFO ] Deduced a trap composed of 412 places in 370 ms of which 4 ms to minimize.
[2024-06-01 13:43:57] [INFO ] Deduced a trap composed of 471 places in 379 ms of which 5 ms to minimize.
SMT process timed out in 33051ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 33070ms
Finished structural reductions in LTL mode , in 1 iterations and 89114 ms. Remains : 812/812 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 441 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-04
Stuttering criterion allowed to conclude after 49923 steps with 648 reset in 354 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-04 finished in 89983 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(F(p0)))))'
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 14 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 13:43:58] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:43:58] [INFO ] Invariant cache hit.
[2024-06-01 13:43:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 13:44:23] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:44:23] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:44:23] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:44:23] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:44:23] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:44:24] [INFO ] Deduced a trap composed of 73 places in 353 ms of which 5 ms to minimize.
[2024-06-01 13:44:24] [INFO ] Deduced a trap composed of 207 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:44:27] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:44:34] [INFO ] Deduced a trap composed of 117 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:44:34] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:44:38] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 1 ms to minimize.
[2024-06-01 13:44:40] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 56 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 12/12 constraints]
After SMT, in 43172ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 43193ms
[2024-06-01 13:44:41] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:44:41] [INFO ] Invariant cache hit.
[2024-06-01 13:44:42] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-06-01 13:44:42] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:44:42] [INFO ] Invariant cache hit.
[2024-06-01 13:44:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:44:59] [INFO ] Implicit Places using invariants and state equation in 16776 ms returned []
Implicit Place search using SMT with State Equation took 17257 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 13:44:59] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:44:59] [INFO ] Invariant cache hit.
[2024-06-01 13:44:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:45:27] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 457 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 412 places in 331 ms of which 4 ms to minimize.
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 471 places in 340 ms of which 4 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 426 places in 299 ms of which 3 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 465 places in 369 ms of which 9 ms to minimize.
[2024-06-01 13:45:31] [INFO ] Deduced a trap composed of 434 places in 359 ms of which 4 ms to minimize.
[2024-06-01 13:45:31] [INFO ] Deduced a trap composed of 444 places in 365 ms of which 5 ms to minimize.
[2024-06-01 13:45:31] [INFO ] Deduced a trap composed of 445 places in 365 ms of which 4 ms to minimize.
[2024-06-01 13:45:32] [INFO ] Deduced a trap composed of 450 places in 319 ms of which 5 ms to minimize.
SMT process timed out in 33331ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 33365ms
Finished structural reductions in LTL mode , in 1 iterations and 93837 ms. Remains : 812/812 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-06
Product exploration explored 100000 steps with 25000 reset in 377 ms.
Product exploration explored 100000 steps with 25000 reset in 507 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 439 steps (0 resets) in 8 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 15 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 13:45:34] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:45:34] [INFO ] Invariant cache hit.
[2024-06-01 13:45:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 13:45:57] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:45:59] [INFO ] Deduced a trap composed of 73 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:45:59] [INFO ] Deduced a trap composed of 207 places in 327 ms of which 4 ms to minimize.
[2024-06-01 13:46:01] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:46:06] [INFO ] Deduced a trap composed of 117 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:46:06] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:46:10] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:46:11] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:46:13] [INFO ] Deduced a trap composed of 424 places in 312 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints]
After SMT, in 42565ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42583ms
[2024-06-01 13:46:16] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:46:16] [INFO ] Invariant cache hit.
[2024-06-01 13:46:17] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-06-01 13:46:17] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:46:17] [INFO ] Invariant cache hit.
[2024-06-01 13:46:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:46:34] [INFO ] Implicit Places using invariants and state equation in 16666 ms returned []
Implicit Place search using SMT with State Equation took 17136 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 13:46:34] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:46:34] [INFO ] Invariant cache hit.
[2024-06-01 13:46:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 13:47:00] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:47:00] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:47:00] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 4 ms to minimize.
[2024-06-01 13:47:00] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:47:00] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:47:00] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:47:01] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:47:01] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:47:01] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:47:01] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:47:03] [INFO ] Deduced a trap composed of 457 places in 321 ms of which 4 ms to minimize.
[2024-06-01 13:47:03] [INFO ] Deduced a trap composed of 412 places in 320 ms of which 4 ms to minimize.
[2024-06-01 13:47:04] [INFO ] Deduced a trap composed of 471 places in 330 ms of which 4 ms to minimize.
[2024-06-01 13:47:04] [INFO ] Deduced a trap composed of 426 places in 337 ms of which 4 ms to minimize.
[2024-06-01 13:47:05] [INFO ] Deduced a trap composed of 465 places in 513 ms of which 6 ms to minimize.
[2024-06-01 13:47:05] [INFO ] Deduced a trap composed of 434 places in 337 ms of which 4 ms to minimize.
[2024-06-01 13:47:06] [INFO ] Deduced a trap composed of 444 places in 361 ms of which 5 ms to minimize.
[2024-06-01 13:47:06] [INFO ] Deduced a trap composed of 445 places in 414 ms of which 6 ms to minimize.
SMT process timed out in 32432ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 32450ms
Finished structural reductions in LTL mode , in 1 iterations and 92191 ms. Remains : 812/812 places, 1632/1632 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 344 steps (0 resets) in 8 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 488 ms.
Product exploration explored 100000 steps with 25000 reset in 354 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 812 transition count 1632
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 50 place count 812 transition count 1742
Deduced a syphon composed of 160 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 160 place count 812 transition count 1742
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 230 place count 812 transition count 1742
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 260 place count 782 transition count 1712
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 290 place count 782 transition count 1712
Deduced a syphon composed of 210 places in 1 ms
Applied a total of 290 rules in 197 ms. Remains 782 /812 variables (removed 30) and now considering 1712/1632 (removed -80) transitions.
Running 1710 sub problems to find dead transitions.
[2024-06-01 13:47:08] [INFO ] Flow matrix only has 1692 transitions (discarded 20 similar events)
// Phase 1: matrix 1692 rows 782 cols
[2024-06-01 13:47:08] [INFO ] Computed 46 invariants in 65 ms
[2024-06-01 13:47:08] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/780 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1710 unsolved
[2024-06-01 13:47:28] [INFO ] Deduced a trap composed of 48 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:47:28] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:47:28] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:47:28] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:47:29] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:47:29] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:47:29] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:47:29] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:47:29] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:47:29] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
[2024-06-01 13:47:30] [INFO ] Deduced a trap composed of 245 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:47:30] [INFO ] Deduced a trap composed of 214 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:47:31] [INFO ] Deduced a trap composed of 230 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:47:31] [INFO ] Deduced a trap composed of 252 places in 325 ms of which 4 ms to minimize.
SMT process timed out in 22680ms, After SMT, problems are : Problem set: 0 solved, 1710 unsolved
Search for dead transitions found 0 dead transitions in 22697ms
[2024-06-01 13:47:31] [INFO ] Redundant transitions in 58 ms returned []
Running 1710 sub problems to find dead transitions.
[2024-06-01 13:47:31] [INFO ] Flow matrix only has 1692 transitions (discarded 20 similar events)
[2024-06-01 13:47:31] [INFO ] Invariant cache hit.
[2024-06-01 13:47:31] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/780 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1710 unsolved
[2024-06-01 13:47:50] [INFO ] Deduced a trap composed of 48 places in 270 ms of which 3 ms to minimize.
[2024-06-01 13:47:50] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:47:50] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 15 ms to minimize.
[2024-06-01 13:47:50] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 2 ms to minimize.
[2024-06-01 13:47:51] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:47:51] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:47:51] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:47:51] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:47:51] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:47:51] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
[2024-06-01 13:47:52] [INFO ] Deduced a trap composed of 246 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:47:52] [INFO ] Deduced a trap composed of 232 places in 405 ms of which 6 ms to minimize.
[2024-06-01 13:47:53] [INFO ] Deduced a trap composed of 236 places in 460 ms of which 6 ms to minimize.
[2024-06-01 13:47:53] [INFO ] Deduced a trap composed of 247 places in 368 ms of which 6 ms to minimize.
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
[2024-06-01 13:48:01] [INFO ] Deduced a trap composed of 207 places in 406 ms of which 6 ms to minimize.
[2024-06-01 13:48:01] [INFO ] Deduced a trap composed of 23 places in 391 ms of which 6 ms to minimize.
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 780/2474 variables, and 60 constraints, problems are : Problem set: 50 solved, 1660 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/782 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1710/1710 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 50 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 16/16 constraints. Problems are: Problem set: 50 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/750 variables, 26/42 constraints. Problems are: Problem set: 50 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/750 variables, 16/58 constraints. Problems are: Problem set: 50 solved, 1660 unsolved
[2024-06-01 13:48:10] [INFO ] Deduced a trap composed of 243 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:48:12] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:48:12] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:48:22] [INFO ] Deduced a trap composed of 85 places in 236 ms of which 4 ms to minimize.
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
[2024-06-01 13:48:22] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
[2024-06-01 13:48:23] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
[2024-06-01 13:48:23] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
[2024-06-01 13:48:23] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
[2024-06-01 13:48:23] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
[2024-06-01 13:48:23] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 4 ms to minimize.
[2024-06-01 13:48:24] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 3 ms to minimize.
Problem TDEAD1622 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1667 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 11/69 constraints. Problems are: Problem set: 220 solved, 1490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/2474 variables, and 69 constraints, problems are : Problem set: 220 solved, 1490 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/782 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1710 constraints, Known Traps: 27/27 constraints]
After SMT, in 62987ms problems are : Problem set: 220 solved, 1490 unsolved
Search for dead transitions found 220 dead transitions in 63002ms
Found 220 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 220 transitions
Dead transitions reduction (with SMT) removed 220 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 782/812 places, 1492/1632 transitions.
Graph (complete) has 3986 edges and 782 vertex of which 652 are kept as prefixes of interest. Removing 130 places using SCC suffix rule.5 ms
Discarding 130 places :
Also discarding 0 output transitions
Deduced a syphon composed of 80 places in 1 ms
Applied a total of 1 rules in 44 ms. Remains 652 /782 variables (removed 130) and now considering 1492/1492 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 652/812 places, 1492/1632 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86034 ms. Remains : 652/812 places, 1492/1632 transitions.
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 34 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 13:48:34] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-06-01 13:48:34] [INFO ] Computed 46 invariants in 30 ms
[2024-06-01 13:48:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 1 ms to minimize.
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:48:54] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:48:54] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:48:54] [INFO ] Deduced a trap composed of 463 places in 435 ms of which 5 ms to minimize.
[2024-06-01 13:48:55] [INFO ] Deduced a trap composed of 397 places in 365 ms of which 5 ms to minimize.
[2024-06-01 13:48:55] [INFO ] Deduced a trap composed of 208 places in 386 ms of which 5 ms to minimize.
[2024-06-01 13:48:56] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 13:48:59] [INFO ] Deduced a trap composed of 409 places in 315 ms of which 4 ms to minimize.
[2024-06-01 13:49:09] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:49:10] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:49:10] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-06-01 13:49:11] [INFO ] Deduced a trap composed of 410 places in 350 ms of which 5 ms to minimize.
[2024-06-01 13:49:14] [INFO ] Deduced a trap composed of 386 places in 330 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 63 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 19/19 constraints]
After SMT, in 42408ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42445ms
[2024-06-01 13:49:17] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:49:17] [INFO ] Invariant cache hit.
[2024-06-01 13:49:17] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-06-01 13:49:17] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:49:17] [INFO ] Invariant cache hit.
[2024-06-01 13:49:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:49:34] [INFO ] Implicit Places using invariants and state equation in 16919 ms returned []
Implicit Place search using SMT with State Equation took 17400 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 13:49:34] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 13:49:34] [INFO ] Invariant cache hit.
[2024-06-01 13:49:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 13:50:02] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:50:02] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:50:02] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:50:02] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:50:02] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:50:02] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:50:02] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:50:02] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:50:03] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:50:03] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:50:05] [INFO ] Deduced a trap composed of 457 places in 301 ms of which 4 ms to minimize.
[2024-06-01 13:50:05] [INFO ] Deduced a trap composed of 412 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:50:05] [INFO ] Deduced a trap composed of 471 places in 363 ms of which 5 ms to minimize.
[2024-06-01 13:50:06] [INFO ] Deduced a trap composed of 426 places in 345 ms of which 5 ms to minimize.
[2024-06-01 13:50:06] [INFO ] Deduced a trap composed of 465 places in 343 ms of which 5 ms to minimize.
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 434 places in 351 ms of which 4 ms to minimize.
SMT process timed out in 32673ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 32689ms
Finished structural reductions in LTL mode , in 1 iterations and 92583 ms. Remains : 812/812 places, 1632/1632 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-06 finished in 368781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 71 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 812 transition count 1562
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 742 transition count 1562
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 140 place count 742 transition count 1532
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 200 place count 712 transition count 1532
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 360 place count 632 transition count 1452
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 370 place count 622 transition count 1442
Iterating global reduction 2 with 10 rules applied. Total rules applied 380 place count 622 transition count 1442
Applied a total of 380 rules in 154 ms. Remains 622 /812 variables (removed 190) and now considering 1442/1632 (removed 190) transitions.
Running 1440 sub problems to find dead transitions.
[2024-06-01 13:50:07] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
// Phase 1: matrix 1422 rows 622 cols
[2024-06-01 13:50:07] [INFO ] Computed 46 invariants in 39 ms
[2024-06-01 13:50:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:50:22] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:50:22] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:50:22] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:50:22] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:50:22] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:50:22] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:50:22] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:50:22] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:50:23] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:50:23] [INFO ] Deduced a trap composed of 311 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:50:23] [INFO ] Deduced a trap composed of 277 places in 285 ms of which 3 ms to minimize.
[2024-06-01 13:50:23] [INFO ] Deduced a trap composed of 330 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:50:24] [INFO ] Deduced a trap composed of 339 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:50:24] [INFO ] Deduced a trap composed of 288 places in 274 ms of which 3 ms to minimize.
[2024-06-01 13:50:24] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:50:25] [INFO ] Deduced a trap composed of 295 places in 272 ms of which 3 ms to minimize.
[2024-06-01 13:50:25] [INFO ] Deduced a trap composed of 339 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:50:25] [INFO ] Deduced a trap composed of 343 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:50:26] [INFO ] Deduced a trap composed of 324 places in 279 ms of which 3 ms to minimize.
[2024-06-01 13:50:26] [INFO ] Deduced a trap composed of 287 places in 263 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:50:27] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2044 variables, and 65 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2044 variables, and 65 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 21/21 constraints]
After SMT, in 42785ms problems are : Problem set: 0 solved, 1440 unsolved
Search for dead transitions found 0 dead transitions in 42812ms
[2024-06-01 13:50:50] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-06-01 13:50:50] [INFO ] Invariant cache hit.
[2024-06-01 13:50:50] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-06-01 13:50:50] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-06-01 13:50:50] [INFO ] Invariant cache hit.
[2024-06-01 13:50:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:50:57] [INFO ] Implicit Places using invariants and state equation in 6448 ms returned []
Implicit Place search using SMT with State Equation took 6894 ms to find 0 implicit places.
[2024-06-01 13:50:57] [INFO ] Redundant transitions in 82 ms returned []
Running 1440 sub problems to find dead transitions.
[2024-06-01 13:50:57] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-06-01 13:50:57] [INFO ] Invariant cache hit.
[2024-06-01 13:50:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 1 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 2 ms to minimize.
[2024-06-01 13:51:12] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:51:12] [INFO ] Deduced a trap composed of 320 places in 381 ms of which 4 ms to minimize.
[2024-06-01 13:51:12] [INFO ] Deduced a trap composed of 347 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:51:13] [INFO ] Deduced a trap composed of 286 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:51:13] [INFO ] Deduced a trap composed of 286 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:51:13] [INFO ] Deduced a trap composed of 342 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:51:14] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:51:28] [INFO ] Deduced a trap composed of 266 places in 267 ms of which 3 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 263 places in 251 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2044 variables, and 62 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:51:52] [INFO ] Deduced a trap composed of 249 places in 259 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2044 variables, and 63 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 19/19 constraints]
After SMT, in 62377ms problems are : Problem set: 0 solved, 1440 unsolved
Search for dead transitions found 0 dead transitions in 62392ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/812 places, 1442/1632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112367 ms. Remains : 622/812 places, 1442/1632 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-07
Product exploration explored 100000 steps with 2462 reset in 394 ms.
Product exploration explored 100000 steps with 2408 reset in 656 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 103 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 71 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1442/1442 transitions.
Applied a total of 0 rules in 37 ms. Remains 622 /622 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Running 1440 sub problems to find dead transitions.
[2024-06-01 13:52:01] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-06-01 13:52:01] [INFO ] Invariant cache hit.
[2024-06-01 13:52:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:52:15] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:52:15] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:52:15] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:52:15] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:52:15] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:52:16] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:52:16] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:52:16] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:52:16] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:52:16] [INFO ] Deduced a trap composed of 53 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:52:16] [INFO ] Deduced a trap composed of 320 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:52:16] [INFO ] Deduced a trap composed of 347 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:52:17] [INFO ] Deduced a trap composed of 286 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:52:17] [INFO ] Deduced a trap composed of 286 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:52:17] [INFO ] Deduced a trap composed of 342 places in 270 ms of which 6 ms to minimize.
[2024-06-01 13:52:17] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2044 variables, and 60 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:52:27] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:52:42] [INFO ] Deduced a trap composed of 288 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:52:42] [INFO ] Deduced a trap composed of 288 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:52:42] [INFO ] Deduced a trap composed of 266 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:52:43] [INFO ] Deduced a trap composed of 251 places in 335 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2044 variables, and 65 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 21/21 constraints]
After SMT, in 42474ms problems are : Problem set: 0 solved, 1440 unsolved
Search for dead transitions found 0 dead transitions in 42492ms
[2024-06-01 13:52:44] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-06-01 13:52:44] [INFO ] Invariant cache hit.
[2024-06-01 13:52:44] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-06-01 13:52:44] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-06-01 13:52:44] [INFO ] Invariant cache hit.
[2024-06-01 13:52:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:52:50] [INFO ] Implicit Places using invariants and state equation in 6238 ms returned []
Implicit Place search using SMT with State Equation took 6689 ms to find 0 implicit places.
[2024-06-01 13:52:50] [INFO ] Redundant transitions in 16 ms returned []
Running 1440 sub problems to find dead transitions.
[2024-06-01 13:52:50] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-06-01 13:52:50] [INFO ] Invariant cache hit.
[2024-06-01 13:52:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:53:06] [INFO ] Deduced a trap composed of 67 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 1 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:53:08] [INFO ] Deduced a trap composed of 320 places in 326 ms of which 4 ms to minimize.
[2024-06-01 13:53:08] [INFO ] Deduced a trap composed of 347 places in 311 ms of which 4 ms to minimize.
[2024-06-01 13:53:08] [INFO ] Deduced a trap composed of 286 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:53:09] [INFO ] Deduced a trap composed of 286 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:53:09] [INFO ] Deduced a trap composed of 342 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:53:09] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2044 variables, and 60 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:53:41] [INFO ] Deduced a trap composed of 288 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:53:42] [INFO ] Deduced a trap composed of 288 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:53:42] [INFO ] Deduced a trap composed of 266 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:53:43] [INFO ] Deduced a trap composed of 251 places in 333 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:53:50] [INFO ] Deduced a trap composed of 91 places in 264 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2044 variables, and 66 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 22/22 constraints]
After SMT, in 62386ms problems are : Problem set: 0 solved, 1440 unsolved
Search for dead transitions found 0 dead transitions in 62399ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111652 ms. Remains : 622/622 places, 1442/1442 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 99 steps (0 resets) in 7 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2426 reset in 424 ms.
Product exploration explored 100000 steps with 2426 reset in 444 ms.
Support contains 71 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1442/1442 transitions.
Applied a total of 0 rules in 23 ms. Remains 622 /622 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Running 1440 sub problems to find dead transitions.
[2024-06-01 13:53:54] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-06-01 13:53:54] [INFO ] Invariant cache hit.
[2024-06-01 13:53:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:54:08] [INFO ] Deduced a trap composed of 67 places in 231 ms of which 2 ms to minimize.
[2024-06-01 13:54:08] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:54:08] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:54:08] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 1 ms to minimize.
[2024-06-01 13:54:08] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:54:09] [INFO ] Deduced a trap composed of 53 places in 377 ms of which 1 ms to minimize.
[2024-06-01 13:54:09] [INFO ] Deduced a trap composed of 53 places in 275 ms of which 1 ms to minimize.
[2024-06-01 13:54:09] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:54:09] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:54:09] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:54:10] [INFO ] Deduced a trap composed of 320 places in 280 ms of which 3 ms to minimize.
[2024-06-01 13:54:10] [INFO ] Deduced a trap composed of 347 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:54:10] [INFO ] Deduced a trap composed of 286 places in 363 ms of which 4 ms to minimize.
[2024-06-01 13:54:10] [INFO ] Deduced a trap composed of 286 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:54:11] [INFO ] Deduced a trap composed of 342 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:54:11] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2044 variables, and 60 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:54:20] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:54:35] [INFO ] Deduced a trap composed of 288 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:54:35] [INFO ] Deduced a trap composed of 288 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:54:35] [INFO ] Deduced a trap composed of 266 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:54:36] [INFO ] Deduced a trap composed of 251 places in 240 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2044 variables, and 65 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 21/21 constraints]
After SMT, in 42415ms problems are : Problem set: 0 solved, 1440 unsolved
Search for dead transitions found 0 dead transitions in 42441ms
[2024-06-01 13:54:37] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-06-01 13:54:37] [INFO ] Invariant cache hit.
[2024-06-01 13:54:37] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 13:54:37] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-06-01 13:54:37] [INFO ] Invariant cache hit.
[2024-06-01 13:54:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:54:42] [INFO ] Implicit Places using invariants and state equation in 5610 ms returned []
Implicit Place search using SMT with State Equation took 6012 ms to find 0 implicit places.
[2024-06-01 13:54:43] [INFO ] Redundant transitions in 23 ms returned []
Running 1440 sub problems to find dead transitions.
[2024-06-01 13:54:43] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-06-01 13:54:43] [INFO ] Invariant cache hit.
[2024-06-01 13:54:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:54:57] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:54:57] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:54:57] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2024-06-01 13:54:57] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:54:57] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:54:57] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:54:57] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:54:57] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:54:57] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:54:57] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:54:58] [INFO ] Deduced a trap composed of 320 places in 257 ms of which 3 ms to minimize.
[2024-06-01 13:54:58] [INFO ] Deduced a trap composed of 347 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:54:58] [INFO ] Deduced a trap composed of 286 places in 289 ms of which 3 ms to minimize.
[2024-06-01 13:54:59] [INFO ] Deduced a trap composed of 286 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:54:59] [INFO ] Deduced a trap composed of 342 places in 283 ms of which 3 ms to minimize.
[2024-06-01 13:54:59] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 266 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:55:15] [INFO ] Deduced a trap composed of 263 places in 267 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 10.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2044 variables, and 62 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 249 places in 266 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2044 variables, and 63 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 19/19 constraints]
After SMT, in 62302ms problems are : Problem set: 0 solved, 1440 unsolved
Search for dead transitions found 0 dead transitions in 62321ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110848 ms. Remains : 622/622 places, 1442/1442 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-07 finished in 337988 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(p0) U p1))'
Support contains 15 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 812 transition count 1562
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 742 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 742 transition count 1462
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 642 transition count 1462
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 440 place count 592 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 450 place count 582 transition count 1402
Iterating global reduction 2 with 10 rules applied. Total rules applied 460 place count 582 transition count 1402
Applied a total of 460 rules in 98 ms. Remains 582 /812 variables (removed 230) and now considering 1402/1632 (removed 230) transitions.
Running 1400 sub problems to find dead transitions.
[2024-06-01 13:55:45] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 582 cols
[2024-06-01 13:55:45] [INFO ] Computed 46 invariants in 16 ms
[2024-06-01 13:55:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:55:58] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:55:58] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:55:58] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:55:58] [INFO ] Deduced a trap composed of 247 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:55:59] [INFO ] Deduced a trap composed of 216 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:55:59] [INFO ] Deduced a trap composed of 254 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:56:01] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 58 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:56:09] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:56:19] [INFO ] Deduced a trap composed of 216 places in 276 ms of which 3 ms to minimize.
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 74 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:56:21] [INFO ] Deduced a trap composed of 113 places in 237 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 63 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 19/19 constraints]
After SMT, in 42146ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 42158ms
[2024-06-01 13:56:27] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:56:27] [INFO ] Invariant cache hit.
[2024-06-01 13:56:28] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-06-01 13:56:28] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:56:28] [INFO ] Invariant cache hit.
[2024-06-01 13:56:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:56:36] [INFO ] Implicit Places using invariants and state equation in 7695 ms returned []
Implicit Place search using SMT with State Equation took 8384 ms to find 0 implicit places.
[2024-06-01 13:56:36] [INFO ] Redundant transitions in 10 ms returned []
Running 1400 sub problems to find dead transitions.
[2024-06-01 13:56:36] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:56:36] [INFO ] Invariant cache hit.
[2024-06-01 13:56:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:56:49] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:56:49] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:56:49] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:56:49] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 11 ms to minimize.
[2024-06-01 13:56:49] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:56:49] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 49 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 207 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:56:51] [INFO ] Deduced a trap composed of 216 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:56:51] [INFO ] Deduced a trap composed of 250 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:56:51] [INFO ] Deduced a trap composed of 237 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:56:52] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:57:00] [INFO ] Deduced a trap composed of 216 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:57:01] [INFO ] Deduced a trap composed of 200 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:57:01] [INFO ] Deduced a trap composed of 92 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:57:01] [INFO ] Deduced a trap composed of 111 places in 221 ms of which 2 ms to minimize.
[2024-06-01 13:57:07] [INFO ] Deduced a trap composed of 245 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 63 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:57:15] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:57:15] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:57:30] [INFO ] Deduced a trap composed of 382 places in 252 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 66 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 22/22 constraints]
After SMT, in 62577ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 62589ms
Starting structural reductions in SI_LTL mode, iteration 1 : 582/812 places, 1402/1632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113264 ms. Remains : 582/812 places, 1402/1632 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-08 finished in 113372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 30 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 812 transition count 1602
Reduce places removed 30 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 40 rules applied. Total rules applied 70 place count 782 transition count 1592
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 80 place count 772 transition count 1592
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 80 place count 772 transition count 1482
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 300 place count 662 transition count 1482
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 440 place count 592 transition count 1412
Applied a total of 440 rules in 137 ms. Remains 592 /812 variables (removed 220) and now considering 1412/1632 (removed 220) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 13:57:39] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 592 cols
[2024-06-01 13:57:39] [INFO ] Computed 46 invariants in 18 ms
[2024-06-01 13:57:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 13:57:52] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:57:52] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:57:52] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:57:53] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:57:53] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:57:53] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:57:53] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:57:53] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:57:53] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:57:53] [INFO ] Deduced a trap composed of 271 places in 253 ms of which 3 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 243 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 266 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 244 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 13:58:10] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 216 places in 262 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 60 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 16/16 constraints]
After SMT, in 42327ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42340ms
[2024-06-01 13:58:21] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 13:58:21] [INFO ] Invariant cache hit.
[2024-06-01 13:58:21] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-06-01 13:58:21] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 13:58:21] [INFO ] Invariant cache hit.
[2024-06-01 13:58:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:58:30] [INFO ] Implicit Places using invariants and state equation in 9001 ms returned []
Implicit Place search using SMT with State Equation took 9463 ms to find 0 implicit places.
[2024-06-01 13:58:30] [INFO ] Redundant transitions in 24 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-06-01 13:58:30] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 13:58:30] [INFO ] Invariant cache hit.
[2024-06-01 13:58:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 225 places in 278 ms of which 3 ms to minimize.
[2024-06-01 13:58:47] [INFO ] Deduced a trap composed of 239 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:58:47] [INFO ] Deduced a trap composed of 235 places in 257 ms of which 3 ms to minimize.
[2024-06-01 13:58:47] [INFO ] Deduced a trap composed of 256 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:58:48] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:59:03] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:59:04] [INFO ] Deduced a trap composed of 216 places in 264 ms of which 3 ms to minimize.
SMT process timed out in 33245ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 33265ms
Starting structural reductions in SI_LTL mode, iteration 1 : 592/812 places, 1412/1632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85242 ms. Remains : 592/812 places, 1412/1632 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-10
Product exploration explored 100000 steps with 5298 reset in 335 ms.
Product exploration explored 100000 steps with 5295 reset in 359 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 131 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 271 steps (0 resets) in 8 ms. (30 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 185 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 13:59:05] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 13:59:05] [INFO ] Invariant cache hit.
[2024-06-01 13:59:06] [INFO ] [Real]Absence check using 14 positive place invariants in 45 ms returned sat
[2024-06-01 13:59:06] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 162 ms returned sat
[2024-06-01 13:59:08] [INFO ] [Real]Absence check using state equation in 2247 ms returned sat
[2024-06-01 13:59:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:59:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-06-01 13:59:09] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 105 ms returned sat
[2024-06-01 13:59:11] [INFO ] [Nat]Absence check using state equation in 2133 ms returned sat
[2024-06-01 13:59:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:59:12] [INFO ] [Nat]Added 120 Read/Feed constraints in 890 ms returned sat
[2024-06-01 13:59:13] [INFO ] Deduced a trap composed of 37 places in 524 ms of which 12 ms to minimize.
[2024-06-01 13:59:13] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:59:13] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:59:13] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:59:14] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:59:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1999 ms
[2024-06-01 13:59:14] [INFO ] Computed and/alt/rep : 450/978/440 causal constraints (skipped 950 transitions) in 198 ms.
[2024-06-01 13:59:17] [INFO ] Added : 124 causal constraints over 25 iterations in 2497 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 30 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 1412/1412 transitions.
Applied a total of 0 rules in 23 ms. Remains 592 /592 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 13:59:17] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 13:59:17] [INFO ] Invariant cache hit.
[2024-06-01 13:59:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:59:33] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:59:33] [INFO ] Deduced a trap composed of 225 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:59:34] [INFO ] Deduced a trap composed of 239 places in 443 ms of which 3 ms to minimize.
[2024-06-01 13:59:34] [INFO ] Deduced a trap composed of 235 places in 325 ms of which 3 ms to minimize.
[2024-06-01 13:59:34] [INFO ] Deduced a trap composed of 256 places in 275 ms of which 3 ms to minimize.
[2024-06-01 13:59:35] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 13:59:50] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:59:50] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:59:50] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:59:55] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 18/18 constraints]
After SMT, in 43205ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 43219ms
[2024-06-01 14:00:00] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:00:00] [INFO ] Invariant cache hit.
[2024-06-01 14:00:00] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-06-01 14:00:00] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:00:00] [INFO ] Invariant cache hit.
[2024-06-01 14:00:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:00:09] [INFO ] Implicit Places using invariants and state equation in 8355 ms returned []
Implicit Place search using SMT with State Equation took 8878 ms to find 0 implicit places.
[2024-06-01 14:00:09] [INFO ] Redundant transitions in 10 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:00:09] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:00:09] [INFO ] Invariant cache hit.
[2024-06-01 14:00:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:00:23] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:00:23] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:00:23] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 225 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 235 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 256 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:00:40] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:00:41] [INFO ] Deduced a trap composed of 216 places in 237 ms of which 7 ms to minimize.
[2024-06-01 14:00:42] [INFO ] Deduced a trap composed of 279 places in 445 ms of which 19 ms to minimize.
SMT process timed out in 33193ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 33206ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 85362 ms. Remains : 592/592 places, 1412/1412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 115 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 548 steps (0 resets) in 10 ms. (49 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 14:00:42] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:00:43] [INFO ] Invariant cache hit.
[2024-06-01 14:00:43] [INFO ] [Real]Absence check using 14 positive place invariants in 45 ms returned sat
[2024-06-01 14:00:43] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 160 ms returned sat
[2024-06-01 14:00:46] [INFO ] [Real]Absence check using state equation in 2317 ms returned sat
[2024-06-01 14:00:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:00:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 14:00:47] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 110 ms returned sat
[2024-06-01 14:00:49] [INFO ] [Nat]Absence check using state equation in 2117 ms returned sat
[2024-06-01 14:00:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:00:50] [INFO ] [Nat]Added 120 Read/Feed constraints in 1022 ms returned sat
[2024-06-01 14:00:50] [INFO ] Deduced a trap composed of 37 places in 286 ms of which 4 ms to minimize.
[2024-06-01 14:00:50] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:00:51] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 0 ms to minimize.
[2024-06-01 14:00:51] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2024-06-01 14:00:51] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:00:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1638 ms
[2024-06-01 14:00:51] [INFO ] Computed and/alt/rep : 450/978/440 causal constraints (skipped 950 transitions) in 128 ms.
[2024-06-01 14:00:55] [INFO ] Added : 124 causal constraints over 25 iterations in 3275 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5334 reset in 586 ms.
Product exploration explored 100000 steps with 5299 reset in 468 ms.
Support contains 30 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 1412/1412 transitions.
Applied a total of 0 rules in 16 ms. Remains 592 /592 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:00:56] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:00:56] [INFO ] Invariant cache hit.
[2024-06-01 14:00:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:01:10] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 3 ms to minimize.
[2024-06-01 14:01:10] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:01:11] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 1 ms to minimize.
[2024-06-01 14:01:11] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:01:11] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:01:11] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 0 ms to minimize.
[2024-06-01 14:01:11] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:01:11] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:01:11] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:01:11] [INFO ] Deduced a trap composed of 225 places in 301 ms of which 3 ms to minimize.
[2024-06-01 14:01:12] [INFO ] Deduced a trap composed of 239 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:01:12] [INFO ] Deduced a trap composed of 235 places in 356 ms of which 3 ms to minimize.
[2024-06-01 14:01:13] [INFO ] Deduced a trap composed of 256 places in 273 ms of which 3 ms to minimize.
[2024-06-01 14:01:13] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:01:33] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:01:39] [INFO ] Deduced a trap composed of 225 places in 249 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 63 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 19/19 constraints]
After SMT, in 43498ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 43510ms
[2024-06-01 14:01:39] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:01:39] [INFO ] Invariant cache hit.
[2024-06-01 14:01:40] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-06-01 14:01:40] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:01:40] [INFO ] Invariant cache hit.
[2024-06-01 14:01:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:01:49] [INFO ] Implicit Places using invariants and state equation in 8791 ms returned []
Implicit Place search using SMT with State Equation took 9302 ms to find 0 implicit places.
[2024-06-01 14:01:49] [INFO ] Redundant transitions in 10 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:01:49] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:01:49] [INFO ] Invariant cache hit.
[2024-06-01 14:01:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:02:03] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:02:03] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:02:03] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:02:03] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:02:04] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 1 ms to minimize.
[2024-06-01 14:02:04] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:02:04] [INFO ] Deduced a trap composed of 50 places in 277 ms of which 0 ms to minimize.
[2024-06-01 14:02:04] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:02:04] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:02:05] [INFO ] Deduced a trap composed of 225 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:02:05] [INFO ] Deduced a trap composed of 239 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:02:05] [INFO ] Deduced a trap composed of 235 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:02:05] [INFO ] Deduced a trap composed of 256 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:02:20] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:02:20] [INFO ] Deduced a trap composed of 216 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:02:21] [INFO ] Deduced a trap composed of 279 places in 283 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 61 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:02:39] [INFO ] Deduced a trap composed of 382 places in 237 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 18/18 constraints]
After SMT, in 63440ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 63458ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116314 ms. Remains : 592/592 places, 1412/1412 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-10 finished in 313765 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 112 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 812 transition count 1562
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 742 transition count 1562
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 140 place count 742 transition count 1552
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 732 transition count 1552
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 320 place count 652 transition count 1472
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 330 place count 642 transition count 1462
Iterating global reduction 2 with 10 rules applied. Total rules applied 340 place count 642 transition count 1462
Applied a total of 340 rules in 80 ms. Remains 642 /812 variables (removed 170) and now considering 1462/1632 (removed 170) transitions.
Running 1460 sub problems to find dead transitions.
[2024-06-01 14:02:52] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
// Phase 1: matrix 1442 rows 642 cols
[2024-06-01 14:02:52] [INFO ] Computed 46 invariants in 25 ms
[2024-06-01 14:02:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 0 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:03:08] [INFO ] Deduced a trap composed of 311 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:03:08] [INFO ] Deduced a trap composed of 316 places in 273 ms of which 4 ms to minimize.
[2024-06-01 14:03:09] [INFO ] Deduced a trap composed of 297 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:03:09] [INFO ] Deduced a trap composed of 358 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:03:09] [INFO ] Deduced a trap composed of 308 places in 258 ms of which 3 ms to minimize.
[2024-06-01 14:03:09] [INFO ] Deduced a trap composed of 321 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:03:11] [INFO ] Deduced a trap composed of 367 places in 288 ms of which 3 ms to minimize.
[2024-06-01 14:03:11] [INFO ] Deduced a trap composed of 367 places in 311 ms of which 3 ms to minimize.
[2024-06-01 14:03:11] [INFO ] Deduced a trap composed of 302 places in 293 ms of which 4 ms to minimize.
[2024-06-01 14:03:12] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:03:12] [INFO ] Deduced a trap composed of 55 places in 29 ms of which 0 ms to minimize.
[2024-06-01 14:03:13] [INFO ] Deduced a trap composed of 345 places in 296 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 9.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2084 variables, and 66 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 22/66 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2084 variables, and 66 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 22/22 constraints]
After SMT, in 42729ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 42746ms
[2024-06-01 14:03:35] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:03:35] [INFO ] Invariant cache hit.
[2024-06-01 14:03:35] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-06-01 14:03:35] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:03:35] [INFO ] Invariant cache hit.
[2024-06-01 14:03:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:03:45] [INFO ] Implicit Places using invariants and state equation in 9271 ms returned []
Implicit Place search using SMT with State Equation took 9683 ms to find 0 implicit places.
[2024-06-01 14:03:45] [INFO ] Redundant transitions in 21 ms returned []
Running 1460 sub problems to find dead transitions.
[2024-06-01 14:03:45] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:03:45] [INFO ] Invariant cache hit.
[2024-06-01 14:03:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:03:59] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:04:00] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:04:00] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:04:00] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:04:00] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:04:00] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:04:00] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:04:00] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:04:00] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:04:01] [INFO ] Deduced a trap composed of 318 places in 262 ms of which 18 ms to minimize.
[2024-06-01 14:04:01] [INFO ] Deduced a trap composed of 344 places in 337 ms of which 4 ms to minimize.
[2024-06-01 14:04:01] [INFO ] Deduced a trap composed of 324 places in 309 ms of which 4 ms to minimize.
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 366 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 391 places in 268 ms of which 4 ms to minimize.
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 362 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 329 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:04:03] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:04:03] [INFO ] Deduced a trap composed of 311 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:04:03] [INFO ] Deduced a trap composed of 326 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:04:04] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:04:05] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:04:06] [INFO ] Deduced a trap composed of 301 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:04:06] [INFO ] Deduced a trap composed of 316 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:04:06] [INFO ] Deduced a trap composed of 307 places in 246 ms of which 4 ms to minimize.
[2024-06-01 14:04:06] [INFO ] Deduced a trap composed of 322 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:04:07] [INFO ] Deduced a trap composed of 310 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:04:07] [INFO ] Deduced a trap composed of 362 places in 246 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2084 variables, and 71 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:04:27] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:04:39] [INFO ] Deduced a trap composed of 287 places in 328 ms of which 4 ms to minimize.
[2024-06-01 14:04:40] [INFO ] Deduced a trap composed of 267 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:04:42] [INFO ] Deduced a trap composed of 71 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:04:42] [INFO ] Deduced a trap composed of 107 places in 259 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2084 variables, and 76 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 32/32 constraints]
After SMT, in 62693ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 62711ms
Starting structural reductions in SI_LTL mode, iteration 1 : 642/812 places, 1462/1632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115255 ms. Remains : 642/812 places, 1462/1632 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-11
Product exploration explored 100000 steps with 4128 reset in 475 ms.
Product exploration explored 100000 steps with 4131 reset in 474 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 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 39 ms :[(NOT p0)]
RANDOM walk for 101 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-06-01 14:04:49] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:04:49] [INFO ] Invariant cache hit.
[2024-06-01 14:04:50] [INFO ] [Real]Absence check using 15 positive place invariants in 46 ms returned sat
[2024-06-01 14:04:50] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 68 ms returned sat
[2024-06-01 14:04:51] [INFO ] [Real]Absence check using state equation in 871 ms returned sat
[2024-06-01 14:04:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:04:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-06-01 14:04:52] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 240 ms returned sat
[2024-06-01 14:04:54] [INFO ] [Nat]Absence check using state equation in 2155 ms returned sat
[2024-06-01 14:04:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:04:54] [INFO ] [Nat]Added 120 Read/Feed constraints in 450 ms returned sat
[2024-06-01 14:04:55] [INFO ] Deduced a trap composed of 308 places in 299 ms of which 4 ms to minimize.
[2024-06-01 14:04:55] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 34 ms to minimize.
[2024-06-01 14:04:55] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:04:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1118 ms
[2024-06-01 14:04:56] [INFO ] Computed and/alt/rep : 500/1148/490 causal constraints (skipped 950 transitions) in 83 ms.
[2024-06-01 14:04:58] [INFO ] Added : 96 causal constraints over 20 iterations in 2392 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 112 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 places, 1462/1462 transitions.
Applied a total of 0 rules in 53 ms. Remains 642 /642 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1460 sub problems to find dead transitions.
[2024-06-01 14:04:58] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:04:58] [INFO ] Invariant cache hit.
[2024-06-01 14:04:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 55 places in 30 ms of which 1 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 55 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 55 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 55 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:05:14] [INFO ] Deduced a trap composed of 318 places in 307 ms of which 4 ms to minimize.
[2024-06-01 14:05:14] [INFO ] Deduced a trap composed of 344 places in 312 ms of which 3 ms to minimize.
[2024-06-01 14:05:15] [INFO ] Deduced a trap composed of 324 places in 280 ms of which 4 ms to minimize.
[2024-06-01 14:05:15] [INFO ] Deduced a trap composed of 366 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:05:15] [INFO ] Deduced a trap composed of 391 places in 273 ms of which 3 ms to minimize.
[2024-06-01 14:05:16] [INFO ] Deduced a trap composed of 362 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:05:16] [INFO ] Deduced a trap composed of 329 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:05:16] [INFO ] Deduced a trap composed of 302 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:05:16] [INFO ] Deduced a trap composed of 311 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:05:17] [INFO ] Deduced a trap composed of 326 places in 261 ms of which 4 ms to minimize.
[2024-06-01 14:05:18] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:05:18] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:05:19] [INFO ] Deduced a trap composed of 301 places in 307 ms of which 3 ms to minimize.
[2024-06-01 14:05:19] [INFO ] Deduced a trap composed of 316 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:05:19] [INFO ] Deduced a trap composed of 307 places in 312 ms of which 3 ms to minimize.
[2024-06-01 14:05:20] [INFO ] Deduced a trap composed of 322 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:05:20] [INFO ] Deduced a trap composed of 310 places in 256 ms of which 4 ms to minimize.
[2024-06-01 14:05:20] [INFO ] Deduced a trap composed of 362 places in 263 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2084 variables, and 71 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:05:31] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2084 variables, and 72 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 28/28 constraints]
After SMT, in 42882ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 42913ms
[2024-06-01 14:05:41] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:05:41] [INFO ] Invariant cache hit.
[2024-06-01 14:05:41] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-06-01 14:05:41] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:05:41] [INFO ] Invariant cache hit.
[2024-06-01 14:05:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:05:51] [INFO ] Implicit Places using invariants and state equation in 9993 ms returned []
Implicit Place search using SMT with State Equation took 10471 ms to find 0 implicit places.
[2024-06-01 14:05:51] [INFO ] Redundant transitions in 18 ms returned []
Running 1460 sub problems to find dead transitions.
[2024-06-01 14:05:51] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:05:51] [INFO ] Invariant cache hit.
[2024-06-01 14:05:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:06:07] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:06:08] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:06:08] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:06:08] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:06:08] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:06:08] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:06:08] [INFO ] Deduced a trap composed of 55 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:06:08] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:06:08] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:06:09] [INFO ] Deduced a trap composed of 318 places in 355 ms of which 4 ms to minimize.
[2024-06-01 14:06:09] [INFO ] Deduced a trap composed of 344 places in 366 ms of which 4 ms to minimize.
[2024-06-01 14:06:10] [INFO ] Deduced a trap composed of 324 places in 322 ms of which 3 ms to minimize.
[2024-06-01 14:06:10] [INFO ] Deduced a trap composed of 366 places in 266 ms of which 3 ms to minimize.
[2024-06-01 14:06:10] [INFO ] Deduced a trap composed of 391 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:06:10] [INFO ] Deduced a trap composed of 362 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:06:11] [INFO ] Deduced a trap composed of 329 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:06:11] [INFO ] Deduced a trap composed of 302 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:06:11] [INFO ] Deduced a trap composed of 311 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:06:12] [INFO ] Deduced a trap composed of 326 places in 304 ms of which 4 ms to minimize.
[2024-06-01 14:06:13] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:06:13] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:06:14] [INFO ] Deduced a trap composed of 301 places in 250 ms of which 4 ms to minimize.
[2024-06-01 14:06:14] [INFO ] Deduced a trap composed of 316 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:06:14] [INFO ] Deduced a trap composed of 307 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:06:15] [INFO ] Deduced a trap composed of 322 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:06:15] [INFO ] Deduced a trap composed of 310 places in 290 ms of which 4 ms to minimize.
[2024-06-01 14:06:15] [INFO ] Deduced a trap composed of 362 places in 307 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2084 variables, and 71 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:06:34] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:06:45] [INFO ] Deduced a trap composed of 287 places in 233 ms of which 4 ms to minimize.
[2024-06-01 14:06:47] [INFO ] Deduced a trap composed of 267 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:06:48] [INFO ] Deduced a trap composed of 71 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:06:48] [INFO ] Deduced a trap composed of 107 places in 281 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2084 variables, and 76 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 32/32 constraints]
After SMT, in 62929ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 62947ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116422 ms. Remains : 642/642 places, 1462/1462 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 26 ms :[(NOT p0)]
RANDOM walk for 89 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 74 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 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-06-01 14:06:55] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:06:55] [INFO ] Invariant cache hit.
[2024-06-01 14:06:55] [INFO ] [Real]Absence check using 15 positive place invariants in 44 ms returned sat
[2024-06-01 14:06:56] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 70 ms returned sat
[2024-06-01 14:06:56] [INFO ] [Real]Absence check using state equation in 871 ms returned sat
[2024-06-01 14:06:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:06:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 18 ms returned sat
[2024-06-01 14:06:58] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 253 ms returned sat
[2024-06-01 14:07:00] [INFO ] [Nat]Absence check using state equation in 2109 ms returned sat
[2024-06-01 14:07:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:07:00] [INFO ] [Nat]Added 120 Read/Feed constraints in 521 ms returned sat
[2024-06-01 14:07:01] [INFO ] Deduced a trap composed of 308 places in 416 ms of which 4 ms to minimize.
[2024-06-01 14:07:01] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 1 ms to minimize.
[2024-06-01 14:07:01] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:07:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1291 ms
[2024-06-01 14:07:02] [INFO ] Computed and/alt/rep : 500/1148/490 causal constraints (skipped 950 transitions) in 103 ms.
[2024-06-01 14:07:04] [INFO ] Added : 96 causal constraints over 20 iterations in 2898 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4139 reset in 649 ms.
Product exploration explored 100000 steps with 4133 reset in 547 ms.
Support contains 112 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 places, 1462/1462 transitions.
Applied a total of 0 rules in 17 ms. Remains 642 /642 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1460 sub problems to find dead transitions.
[2024-06-01 14:07:06] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:07:06] [INFO ] Invariant cache hit.
[2024-06-01 14:07:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:07:21] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:07:21] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:07:21] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:07:21] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 0 ms to minimize.
[2024-06-01 14:07:21] [INFO ] Deduced a trap composed of 55 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:07:21] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:07:21] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:07:21] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:07:21] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 318 places in 283 ms of which 3 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 344 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 324 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 366 places in 291 ms of which 3 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 391 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 362 places in 347 ms of which 3 ms to minimize.
[2024-06-01 14:07:24] [INFO ] Deduced a trap composed of 329 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:07:24] [INFO ] Deduced a trap composed of 302 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:07:24] [INFO ] Deduced a trap composed of 311 places in 252 ms of which 4 ms to minimize.
[2024-06-01 14:07:25] [INFO ] Deduced a trap composed of 326 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:07:25] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:07:26] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:07:27] [INFO ] Deduced a trap composed of 301 places in 306 ms of which 3 ms to minimize.
[2024-06-01 14:07:27] [INFO ] Deduced a trap composed of 316 places in 279 ms of which 4 ms to minimize.
[2024-06-01 14:07:27] [INFO ] Deduced a trap composed of 307 places in 300 ms of which 3 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 322 places in 299 ms of which 3 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 310 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 362 places in 284 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2084 variables, and 71 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:07:38] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2084 variables, and 72 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 28/28 constraints]
After SMT, in 42851ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 42864ms
[2024-06-01 14:07:49] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:07:49] [INFO ] Invariant cache hit.
[2024-06-01 14:07:49] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-06-01 14:07:49] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:07:49] [INFO ] Invariant cache hit.
[2024-06-01 14:07:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:07:59] [INFO ] Implicit Places using invariants and state equation in 9744 ms returned []
Implicit Place search using SMT with State Equation took 10249 ms to find 0 implicit places.
[2024-06-01 14:07:59] [INFO ] Redundant transitions in 16 ms returned []
Running 1460 sub problems to find dead transitions.
[2024-06-01 14:07:59] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-06-01 14:07:59] [INFO ] Invariant cache hit.
[2024-06-01 14:07:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:08:14] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 3 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:08:16] [INFO ] Deduced a trap composed of 318 places in 267 ms of which 4 ms to minimize.
[2024-06-01 14:08:16] [INFO ] Deduced a trap composed of 344 places in 328 ms of which 4 ms to minimize.
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 324 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 366 places in 300 ms of which 3 ms to minimize.
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 391 places in 313 ms of which 3 ms to minimize.
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 362 places in 289 ms of which 3 ms to minimize.
[2024-06-01 14:08:18] [INFO ] Deduced a trap composed of 329 places in 291 ms of which 4 ms to minimize.
[2024-06-01 14:08:18] [INFO ] Deduced a trap composed of 302 places in 288 ms of which 4 ms to minimize.
[2024-06-01 14:08:18] [INFO ] Deduced a trap composed of 311 places in 277 ms of which 3 ms to minimize.
[2024-06-01 14:08:19] [INFO ] Deduced a trap composed of 326 places in 273 ms of which 3 ms to minimize.
[2024-06-01 14:08:20] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:08:20] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:08:21] [INFO ] Deduced a trap composed of 301 places in 303 ms of which 3 ms to minimize.
[2024-06-01 14:08:22] [INFO ] Deduced a trap composed of 316 places in 302 ms of which 4 ms to minimize.
[2024-06-01 14:08:22] [INFO ] Deduced a trap composed of 307 places in 349 ms of which 4 ms to minimize.
[2024-06-01 14:08:22] [INFO ] Deduced a trap composed of 322 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:08:22] [INFO ] Deduced a trap composed of 310 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:08:23] [INFO ] Deduced a trap composed of 362 places in 245 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2084 variables, and 71 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 14:08:42] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:08:53] [INFO ] Deduced a trap composed of 287 places in 245 ms of which 4 ms to minimize.
[2024-06-01 14:08:55] [INFO ] Deduced a trap composed of 267 places in 294 ms of which 3 ms to minimize.
[2024-06-01 14:08:56] [INFO ] Deduced a trap composed of 71 places in 283 ms of which 3 ms to minimize.
[2024-06-01 14:08:56] [INFO ] Deduced a trap composed of 107 places in 255 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2084 variables, and 76 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 32/32 constraints]
After SMT, in 62956ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 62973ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116135 ms. Remains : 642/642 places, 1462/1462 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-11 finished in 369706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (p1||G(p0))))))'
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 8 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:09:02] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-06-01 14:09:02] [INFO ] Computed 46 invariants in 24 ms
[2024-06-01 14:09:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:09:21] [INFO ] Deduced a trap composed of 463 places in 516 ms of which 4 ms to minimize.
[2024-06-01 14:09:22] [INFO ] Deduced a trap composed of 397 places in 339 ms of which 4 ms to minimize.
[2024-06-01 14:09:22] [INFO ] Deduced a trap composed of 208 places in 284 ms of which 4 ms to minimize.
[2024-06-01 14:09:22] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:09:24] [INFO ] Deduced a trap composed of 474 places in 378 ms of which 4 ms to minimize.
[2024-06-01 14:09:24] [INFO ] Deduced a trap composed of 479 places in 299 ms of which 4 ms to minimize.
[2024-06-01 14:09:24] [INFO ] Deduced a trap composed of 423 places in 322 ms of which 4 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 424 places in 344 ms of which 4 ms to minimize.
SMT process timed out in 22944ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22958ms
[2024-06-01 14:09:25] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:09:25] [INFO ] Invariant cache hit.
[2024-06-01 14:09:25] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-06-01 14:09:25] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:09:25] [INFO ] Invariant cache hit.
[2024-06-01 14:09:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:09:41] [INFO ] Implicit Places using invariants and state equation in 15849 ms returned []
Implicit Place search using SMT with State Equation took 16372 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:09:41] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:09:41] [INFO ] Invariant cache hit.
[2024-06-01 14:09:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 0 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 1 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 0 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 54 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:10:19] [INFO ] Deduced a trap composed of 208 places in 328 ms of which 4 ms to minimize.
[2024-06-01 14:10:28] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:10:38] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:10:38] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:10:44] [INFO ] Deduced a trap composed of 430 places in 288 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 59 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 15/15 constraints]
After SMT, in 63159ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 63173ms
Finished structural reductions in LTL mode , in 1 iterations and 102532 ms. Remains : 812/812 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 418 ms.
Product exploration explored 100000 steps with 50000 reset in 529 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 26 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-14 finished in 103588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(p1)&&F(p2)))))'
Support contains 51 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 17 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:10:45] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:10:45] [INFO ] Invariant cache hit.
[2024-06-01 14:10:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:11:10] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:11:10] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:11:10] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:11:10] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:11:10] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:11:11] [INFO ] Deduced a trap composed of 73 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:11:11] [INFO ] Deduced a trap composed of 207 places in 290 ms of which 4 ms to minimize.
[2024-06-01 14:11:13] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:11:19] [INFO ] Deduced a trap composed of 117 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:11:19] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:11:24] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:11:26] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 14 ms to minimize.
[2024-06-01 14:11:28] [INFO ] Deduced a trap composed of 424 places in 318 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints]
After SMT, in 42910ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42941ms
[2024-06-01 14:11:28] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:11:28] [INFO ] Invariant cache hit.
[2024-06-01 14:11:29] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-06-01 14:11:29] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:11:29] [INFO ] Invariant cache hit.
[2024-06-01 14:11:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:11:43] [INFO ] Implicit Places using invariants and state equation in 14226 ms returned []
Implicit Place search using SMT with State Equation took 14701 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:11:43] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:11:43] [INFO ] Invariant cache hit.
[2024-06-01 14:11:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:12:11] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:12:11] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:12:11] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:12:11] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:12:11] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:12:11] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:12:12] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:12:12] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:12:12] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 ms to minimize.
[2024-06-01 14:12:12] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:12:14] [INFO ] Deduced a trap composed of 457 places in 350 ms of which 5 ms to minimize.
[2024-06-01 14:12:15] [INFO ] Deduced a trap composed of 412 places in 371 ms of which 5 ms to minimize.
[2024-06-01 14:12:15] [INFO ] Deduced a trap composed of 471 places in 325 ms of which 4 ms to minimize.
[2024-06-01 14:12:15] [INFO ] Deduced a trap composed of 426 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:12:16] [INFO ] Deduced a trap composed of 465 places in 303 ms of which 4 ms to minimize.
[2024-06-01 14:12:16] [INFO ] Deduced a trap composed of 434 places in 322 ms of which 4 ms to minimize.
SMT process timed out in 32873ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 32890ms
Finished structural reductions in LTL mode , in 1 iterations and 90558 ms. Remains : 812/812 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 426 ms.
Product exploration explored 100000 steps with 50000 reset in 453 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 25 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-15 finished in 91617 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(F(p0)))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T10-LTLCardinality-06
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 812 transition count 1592
Reduce places removed 40 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 90 place count 772 transition count 1582
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 762 transition count 1582
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 100 place count 762 transition count 1472
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 320 place count 652 transition count 1472
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 460 place count 582 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 470 place count 572 transition count 1392
Iterating global reduction 3 with 10 rules applied. Total rules applied 480 place count 572 transition count 1392
Applied a total of 480 rules in 68 ms. Remains 572 /812 variables (removed 240) and now considering 1392/1632 (removed 240) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:12:17] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 572 cols
[2024-06-01 14:12:17] [INFO ] Computed 46 invariants in 14 ms
[2024-06-01 14:12:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:12:30] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:12:30] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:12:30] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:12:30] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 6 ms to minimize.
[2024-06-01 14:12:31] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-06-01 14:12:31] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:12:31] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:12:31] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:12:31] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:12:31] [INFO ] Deduced a trap composed of 227 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:12:33] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:12:34] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 56 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:12:43] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 1 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 15/15 constraints]
After SMT, in 42847ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42861ms
[2024-06-01 14:13:00] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:13:00] [INFO ] Invariant cache hit.
[2024-06-01 14:13:01] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-06-01 14:13:01] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:13:01] [INFO ] Invariant cache hit.
[2024-06-01 14:13:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:13:11] [INFO ] Implicit Places using invariants and state equation in 10327 ms returned []
Implicit Place search using SMT with State Equation took 10855 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:13:11] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:13:11] [INFO ] Invariant cache hit.
[2024-06-01 14:13:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:13:26] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:13:26] [INFO ] Deduced a trap composed of 253 places in 238 ms of which 2 ms to minimize.
[2024-06-01 14:13:26] [INFO ] Deduced a trap composed of 227 places in 243 ms of which 2 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:13:40] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:13:40] [INFO ] Deduced a trap composed of 238 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:13:40] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:13:41] [INFO ] Deduced a trap composed of 216 places in 271 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:14:02] [INFO ] Deduced a trap composed of 172 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:14:03] [INFO ] Deduced a trap composed of 3 places in 388 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:14:10] [INFO ] Deduced a trap composed of 372 places in 254 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 63 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 19/19 constraints]
After SMT, in 63057ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 63070ms
Starting structural reductions in LI_LTL mode, iteration 1 : 572/812 places, 1392/1632 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 116859 ms. Remains : 572/812 places, 1392/1632 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-06
Product exploration explored 100000 steps with 25000 reset in 403 ms.
Product exploration explored 100000 steps with 25000 reset in 412 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 223 steps (0 resets) in 6 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 572 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 572/572 places, 1392/1392 transitions.
Applied a total of 0 rules in 8 ms. Remains 572 /572 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:14:16] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:14:16] [INFO ] Invariant cache hit.
[2024-06-01 14:14:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 1 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:14:31] [INFO ] Deduced a trap composed of 253 places in 290 ms of which 3 ms to minimize.
[2024-06-01 14:14:31] [INFO ] Deduced a trap composed of 227 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:14:33] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 56 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:14:40] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 3 ms to minimize.
[2024-06-01 14:14:40] [INFO ] Deduced a trap composed of 237 places in 293 ms of which 4 ms to minimize.
[2024-06-01 14:14:45] [INFO ] Deduced a trap composed of 372 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:14:57] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:14:58] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 61 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints]
After SMT, in 42626ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42645ms
[2024-06-01 14:14:58] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:14:58] [INFO ] Invariant cache hit.
[2024-06-01 14:14:59] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-06-01 14:14:59] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:14:59] [INFO ] Invariant cache hit.
[2024-06-01 14:14:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:15:09] [INFO ] Implicit Places using invariants and state equation in 10347 ms returned []
Implicit Place search using SMT with State Equation took 10779 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:15:09] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:15:09] [INFO ] Invariant cache hit.
[2024-06-01 14:15:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:15:22] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 1 ms to minimize.
[2024-06-01 14:15:22] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:15:22] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 253 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:15:24] [INFO ] Deduced a trap composed of 227 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:15:25] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:15:38] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:15:38] [INFO ] Deduced a trap composed of 238 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:15:38] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 2 ms to minimize.
[2024-06-01 14:15:39] [INFO ] Deduced a trap composed of 216 places in 226 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:16:01] [INFO ] Deduced a trap composed of 172 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:16:02] [INFO ] Deduced a trap composed of 3 places in 312 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:16:09] [INFO ] Deduced a trap composed of 372 places in 337 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 63 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 19/19 constraints]
After SMT, in 62832ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 62844ms
Finished structural reductions in LTL mode , in 1 iterations and 116284 ms. Remains : 572/572 places, 1392/1392 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 50 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 272 steps (0 resets) in 6 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 315 ms.
Product exploration explored 100000 steps with 25000 reset in 345 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 572 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 572/572 places, 1392/1392 transitions.
Applied a total of 0 rules in 16 ms. Remains 572 /572 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:16:13] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:16:13] [INFO ] Invariant cache hit.
[2024-06-01 14:16:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:16:27] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:16:27] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 1 ms to minimize.
[2024-06-01 14:16:27] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:16:27] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 1 ms to minimize.
[2024-06-01 14:16:27] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:16:27] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:16:27] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:16:28] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:16:28] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:16:28] [INFO ] Deduced a trap composed of 253 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:16:28] [INFO ] Deduced a trap composed of 227 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:16:30] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
(s381 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 56 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:16:38] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:16:38] [INFO ] Deduced a trap composed of 237 places in 240 ms of which 2 ms to minimize.
[2024-06-01 14:16:43] [INFO ] Deduced a trap composed of 372 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:16:54] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 2 ms to minimize.
[2024-06-01 14:16:55] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 61 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints]
After SMT, in 42944ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42958ms
[2024-06-01 14:16:56] [INFO ] Redundant transitions in 9 ms returned []
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:16:56] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:16:56] [INFO ] Invariant cache hit.
[2024-06-01 14:16:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:17:10] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:17:10] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:17:11] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 1 ms to minimize.
[2024-06-01 14:17:11] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:17:11] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:17:11] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:17:11] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:17:11] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:17:11] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:17:12] [INFO ] Deduced a trap composed of 253 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:17:12] [INFO ] Deduced a trap composed of 227 places in 294 ms of which 4 ms to minimize.
[2024-06-01 14:17:14] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:17:27] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:17:28] [INFO ] Deduced a trap composed of 238 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:17:28] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 4 ms to minimize.
[2024-06-01 14:17:28] [INFO ] Deduced a trap composed of 216 places in 266 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:17:47] [INFO ] Deduced a trap composed of 172 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:17:48] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:17:54] [INFO ] Deduced a trap composed of 372 places in 206 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 63 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 19/19 constraints]
After SMT, in 63141ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 63155ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106168 ms. Remains : 572/572 places, 1392/1392 transitions.
Support contains 11 out of 572 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 572/572 places, 1392/1392 transitions.
Applied a total of 0 rules in 4 ms. Remains 572 /572 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:18:00] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:18:00] [INFO ] Invariant cache hit.
[2024-06-01 14:18:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:18:13] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:18:13] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:18:13] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:18:13] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:18:13] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:18:13] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:18:13] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:18:13] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:18:13] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:18:14] [INFO ] Deduced a trap composed of 253 places in 336 ms of which 4 ms to minimize.
[2024-06-01 14:18:14] [INFO ] Deduced a trap composed of 227 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:18:16] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 56 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:18:24] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:18:24] [INFO ] Deduced a trap composed of 237 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:18:29] [INFO ] Deduced a trap composed of 372 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:18:41] [INFO ] Deduced a trap composed of 198 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:18:42] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 61 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints]
After SMT, in 42783ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42808ms
[2024-06-01 14:18:42] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:18:42] [INFO ] Invariant cache hit.
[2024-06-01 14:18:43] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-06-01 14:18:43] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:18:43] [INFO ] Invariant cache hit.
[2024-06-01 14:18:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:18:53] [INFO ] Implicit Places using invariants and state equation in 10664 ms returned []
Implicit Place search using SMT with State Equation took 11062 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:18:53] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:18:53] [INFO ] Invariant cache hit.
[2024-06-01 14:18:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:19:07] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:19:07] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:19:07] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:19:07] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:19:08] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:19:08] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:19:08] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:19:08] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:19:08] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:19:08] [INFO ] Deduced a trap composed of 253 places in 216 ms of which 3 ms to minimize.
[2024-06-01 14:19:08] [INFO ] Deduced a trap composed of 227 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:19:10] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:19:24] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:19:24] [INFO ] Deduced a trap composed of 238 places in 264 ms of which 4 ms to minimize.
[2024-06-01 14:19:24] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 4 ms to minimize.
[2024-06-01 14:19:25] [INFO ] Deduced a trap composed of 216 places in 264 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:19:44] [INFO ] Deduced a trap composed of 172 places in 289 ms of which 3 ms to minimize.
[2024-06-01 14:19:45] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:19:51] [INFO ] Deduced a trap composed of 372 places in 200 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 63 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 19/19 constraints]
After SMT, in 62633ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 62645ms
Finished structural reductions in LTL mode , in 1 iterations and 116525 ms. Remains : 572/572 places, 1392/1392 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-06 finished in 459089 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
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-06-01 14:19:57] [INFO ] Flatten gal took : 196 ms
[2024-06-01 14:19:57] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 14:19:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 812 places, 1632 transitions and 7100 arcs took 27 ms.
Total runtime 2281142 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717251958799

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-COL-S02J06T10-LTLCardinality-06
ltl formula formula --ltl=/tmp/4449/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 812 places, 1632 transitions and 7100 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.280 real 0.070 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4449/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4449/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4449/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4449/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 827 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 813, there are 1636 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: 9
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 10
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: 17
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17 states 29 transitions, fanout: 1.706
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, 168.9 B/state, compr.: 5.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1662 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)
ltl formula name PolyORBLF-COL-S02J06T10-LTLCardinality-07
ltl formula formula --ltl=/tmp/4449/ltl_1_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 812 places, 1632 transitions and 7100 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4449/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.070 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4449/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4449/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4449/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 827 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 813, there are 1635 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( 2/ 4): ~136 levels ~10000 states ~14196 transitions
pnml2lts-mc( 2/ 4): ~136 levels ~20000 states ~28892 transitions
pnml2lts-mc( 2/ 4): ~136 levels ~40000 states ~58752 transitions
pnml2lts-mc( 2/ 4): ~136 levels ~80000 states ~123404 transitions
pnml2lts-mc( 2/ 4): ~136 levels ~160000 states ~259112 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~962!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 154827
pnml2lts-mc( 0/ 4): unique states count: 190973
pnml2lts-mc( 0/ 4): unique transitions count: 303711
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 72348
pnml2lts-mc( 0/ 4): - claim found count: 4441
pnml2lts-mc( 0/ 4): - claim success count: 190989
pnml2lts-mc( 0/ 4): - cum. max stack depth: 33857
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 190989 states 303764 transitions, fanout: 1.590
pnml2lts-mc( 0/ 4): Total exploration time 8.610 sec (8.600 sec minimum, 8.608 sec on average)
pnml2lts-mc( 0/ 4): States per second: 22182, Transitions per second: 35280
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.5MB, 16.2 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 1662 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.5MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S02J06T10-LTLCardinality-10
ltl formula formula --ltl=/tmp/4449/ltl_2_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 812 places, 1632 transitions and 7100 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.230 real 0.060 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4449/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4449/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4449/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4449/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 826 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 813, there are 1638 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( 1/ 4): ~27 levels ~10000 states ~15052 transitions
pnml2lts-mc( 3/ 4): ~27 levels ~20000 states ~31264 transitions
pnml2lts-mc( 3/ 4): ~27 levels ~40000 states ~64240 transitions
pnml2lts-mc( 1/ 4): ~47 levels ~80000 states ~129824 transitions
pnml2lts-mc( 1/ 4): ~105 levels ~160000 states ~264232 transitions
pnml2lts-mc( 2/ 4): ~111 levels ~320000 states ~540728 transitions
pnml2lts-mc( 0/ 4): ~164 levels ~640000 states ~1072768 transitions
pnml2lts-mc( 0/ 4): ~317 levels ~1280000 states ~2146084 transitions
pnml2lts-mc( 3/ 4): ~899 levels ~2560000 states ~5438412 transitions
pnml2lts-mc( 3/ 4): ~1583 levels ~5120000 states ~10975624 transitions
pnml2lts-mc( 3/ 4): ~2955 levels ~10240000 states ~21739236 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~14621!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9979073
pnml2lts-mc( 0/ 4): unique states count: 10011339
pnml2lts-mc( 0/ 4): unique transitions count: 20062974
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 10023671
pnml2lts-mc( 0/ 4): - claim found count: 1674
pnml2lts-mc( 0/ 4): - claim success count: 10012221
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28924
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10012221 states 20065806 transitions, fanout: 2.004
pnml2lts-mc( 0/ 4): Total exploration time 343.360 sec (343.360 sec minimum, 343.360 sec on average)
pnml2lts-mc( 0/ 4): States per second: 29160, Transitions per second: 58440
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 91.1MB, 9.5 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/22.0%
pnml2lts-mc( 0/ 4): Stored 1662 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 91.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S02J06T10-LTLCardinality-11
ltl formula formula --ltl=/tmp/4449/ltl_3_
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 812 places, 1632 transitions and 7100 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.250 real 0.050 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4449/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4449/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4449/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4449/ltl_3_
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 827 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 813, there are 1633 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( 3/ 4): ~34 levels ~10000 states ~13984 transitions
pnml2lts-mc( 3/ 4): ~34 levels ~20000 states ~27816 transitions
pnml2lts-mc( 3/ 4): ~34 levels ~40000 states ~55848 transitions
pnml2lts-mc( 3/ 4): ~34 levels ~80000 states ~117040 transitions
pnml2lts-mc( 1/ 4): ~45 levels ~160000 states ~199664 transitions
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: 131165
pnml2lts-mc( 0/ 4): unique states count: 131165
pnml2lts-mc( 0/ 4): unique transitions count: 186942
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 56139
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 131636
pnml2lts-mc( 0/ 4): - cum. max stack depth: 158
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 131636 states 188305 transitions, fanout: 1.430
pnml2lts-mc( 0/ 4): Total exploration time 6.630 sec (6.630 sec minimum, 6.630 sec on average)
pnml2lts-mc( 0/ 4): States per second: 19855, Transitions per second: 28402
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.2MB, 9.4 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1662 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.2MB (~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="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S02J06T10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446400115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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