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.r289-tajo-171654445200116.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 greatspnxred
Input is PolyORBLF-COL-S02J06T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445200116
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716848487766

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:21:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 22:21:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:21:29] [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-05-27 22:21:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:21:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 854 ms
[2024-05-27 22:21:30] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 22:21:30] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 8 ms.
[2024-05-27 22:21:30] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (18 resets) in 1567 ms. (25 steps per ms) remains 3/23 properties
BEST_FIRST walk for 40003 steps (13 resets) in 460 ms. (86 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (34 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (12 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
[2024-05-27 22:21:31] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:21:31] [INFO ] Computed 26 invariants in 14 ms
[2024-05-27 22:21:31] [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, 3 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/49 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/53 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 5 (OVERLAPS) 22/75 variables, 12/22 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/80 variables, 3/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 2 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: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 2 solved, 1 unsolved in 280 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: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/23 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/46 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/49 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-27 22:21:31] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 117 constraints, problems are : Problem set: 2 solved, 1 unsolved in 209 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/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 549ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 19 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 1 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 59 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
Running 43 sub problems to find dead transitions.
[2024-05-27 22:21:31] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2024-05-27 22:21:31] [INFO ] Computed 25 invariants in 3 ms
[2024-05-27 22:21:31] [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-05-27 22:21:32] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 2 ms to minimize.
[2024-05-27 22:21:32] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-27 22:21:32] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-27 22:21:32] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-27 22:21:32] [INFO ] Deduced a trap composed of 15 places in 23 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-05-27 22:21:32] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-27 22:21:32] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-27 22:21:32] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-27 22:21:32] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-27 22:21:32] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-27 22:21:32] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 6/36 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-27 22:21:32] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-27 22:21:33] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-27 22:21:33] [INFO ] Deduced a trap composed of 10 places in 28 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-05-27 22:21:33] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:21:33] [INFO ] Deduced a trap composed of 14 places in 35 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 2084 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 1138 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 3263ms problems are : Problem set: 2 solved, 41 unsolved
Search for dead transitions found 2 dead transitions in 3265ms
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 11 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 3366 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 3 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:21:35] [INFO ] Flatten gal took : 33 ms
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:21:35] [INFO ] Flatten gal took : 9 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-05-27 22:21:35] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 41 ms.
[2024-05-27 22:21:35] [INFO ] Unfolded 11 HLPN properties in 0 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
Applied a total of 2 rules in 47 ms. Remains 842 /844 variables (removed 2) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2024-05-27 22:21:35] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 842 cols
[2024-05-27 22:21:35] [INFO ] Computed 56 invariants in 87 ms
[2024-05-27 22:21:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/2474 variables, and 54 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/842 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-27 22:21:59] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 2 ms to minimize.
[2024-05-27 22:21:59] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 3 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 5 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 1 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:22:00] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:22:02] [INFO ] Deduced a trap composed of 229 places in 431 ms of which 6 ms to minimize.
[2024-05-27 22:22:02] [INFO ] Deduced a trap composed of 252 places in 458 ms of which 6 ms to minimize.
[2024-05-27 22:22:03] [INFO ] Deduced a trap composed of 250 places in 361 ms of which 4 ms to minimize.
[2024-05-27 22:22:04] [INFO ] Deduced a trap composed of 503 places in 482 ms of which 6 ms to minimize.
[2024-05-27 22:22:04] [INFO ] Deduced a trap composed of 293 places in 207 ms of which 3 ms to minimize.
[2024-05-27 22:22:05] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:22:18] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2474 variables, and 70 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/842 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 16/16 constraints]
After SMT, in 43123ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 43158ms
[2024-05-27 22:22:18] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-27 22:22:18] [INFO ] Invariant cache hit.
[2024-05-27 22:22:19] [INFO ] Implicit Places using invariants in 528 ms returned [646, 647, 648, 649, 650, 651, 652, 653, 654, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 537 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 832/844 places, 1652/1652 transitions.
Applied a total of 0 rules in 16 ms. Remains 832 /832 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43774 ms. Remains : 832/844 places, 1652/1652 transitions.
Support contains 414 out of 832 places after structural reductions.
[2024-05-27 22:22:19] [INFO ] Flatten gal took : 138 ms
[2024-05-27 22:22:19] [INFO ] Flatten gal took : 121 ms
[2024-05-27 22:22:19] [INFO ] Input system was already deterministic with 1652 transitions.
RANDOM walk for 1622 steps (0 resets) in 127 ms. (12 steps per ms) remains 0/18 properties
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' '!((X(X((X((G(p0) U p1))||F(p2))))&&F(p0)))'
Support contains 94 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 80 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:22:20] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-05-27 22:22:20] [INFO ] Computed 46 invariants in 49 ms
[2024-05-27 22:22:20] [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-05-27 22:22:41] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 3 ms to minimize.
[2024-05-27 22:22:41] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 10 ms to minimize.
[2024-05-27 22:22:41] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-27 22:22:41] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 1 ms to minimize.
[2024-05-27 22:22:41] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2024-05-27 22:22:41] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:22:41] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:22:41] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:22:41] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:22:42] [INFO ] Deduced a trap composed of 463 places in 310 ms of which 5 ms to minimize.
[2024-05-27 22:22:43] [INFO ] Deduced a trap composed of 397 places in 431 ms of which 6 ms to minimize.
[2024-05-27 22:22:43] [INFO ] Deduced a trap composed of 208 places in 349 ms of which 4 ms to minimize.
SMT process timed out in 23078ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23095ms
[2024-05-27 22:22:43] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:22:43] [INFO ] Invariant cache hit.
[2024-05-27 22:22:44] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-27 22:22:44] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:22:44] [INFO ] Invariant cache hit.
[2024-05-27 22:22:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:22:57] [INFO ] Implicit Places using invariants and state equation in 13682 ms returned []
Implicit Place search using SMT with State Equation took 14142 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:22:57] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:22:57] [INFO ] Invariant cache hit.
[2024-05-27 22:22:57] [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-05-27 22:23:27] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:23:27] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:23:27] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2024-05-27 22:23:28] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:23:28] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:23:28] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 2 ms to minimize.
[2024-05-27 22:23:28] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:23:28] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:23:28] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:23:28] [INFO ] Deduced a trap composed of 72 places in 61 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 30033 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-05-27 22:23:34] [INFO ] Deduced a trap composed of 208 places in 312 ms of which 4 ms to minimize.
[2024-05-27 22:23:42] [INFO ] Deduced a trap composed of 79 places in 205 ms of which 4 ms to minimize.
[2024-05-27 22:23:51] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 3 ms to minimize.
[2024-05-27 22:23:52] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 4 ms to minimize.
[2024-05-27 22:23:58] [INFO ] Deduced a trap composed of 430 places in 436 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(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)
(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 timeout
0 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 30027 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 62403ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62418ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99743 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-01
Product exploration explored 100000 steps with 2959 reset in 613 ms.
Stuttering criterion allowed to conclude after 461 steps with 11 reset in 4 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-01 finished in 100925 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((F(p0)&&X(X(X(X(G(p1))))))))'
Support contains 92 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 87 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:24:01] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:24:01] [INFO ] Invariant cache hit.
[2024-05-27 22:24:01] [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 20029 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-05-27 22:24:25] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 3 ms to minimize.
[2024-05-27 22:24:25] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-05-27 22:24:25] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-05-27 22:24:25] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-05-27 22:24:25] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 1 ms to minimize.
[2024-05-27 22:24:26] [INFO ] Deduced a trap composed of 73 places in 306 ms of which 5 ms to minimize.
[2024-05-27 22:24:26] [INFO ] Deduced a trap composed of 207 places in 306 ms of which 5 ms to minimize.
[2024-05-27 22:24:29] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:24:34] [INFO ] Deduced a trap composed of 117 places in 255 ms of which 4 ms to minimize.
[2024-05-27 22:24:34] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:24:38] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:24:39] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:24:42] [INFO ] Deduced a trap composed of 424 places in 327 ms of which 5 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 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20046 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 42521ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42539ms
[2024-05-27 22:24:43] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:24:43] [INFO ] Invariant cache hit.
[2024-05-27 22:24:44] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-05-27 22:24:44] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:24:44] [INFO ] Invariant cache hit.
[2024-05-27 22:24:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:25:02] [INFO ] Implicit Places using invariants and state equation in 17489 ms returned []
Implicit Place search using SMT with State Equation took 18092 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:25:02] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:25:02] [INFO ] Invariant cache hit.
[2024-05-27 22:25: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-05-27 22:25:31] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 2 ms to minimize.
[2024-05-27 22:25:31] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 2 ms to minimize.
[2024-05-27 22:25:31] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:25:31] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:25:32] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:25:32] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:25:32] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:25:32] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:25:32] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:25:32] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 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 30029 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-05-27 22:25:39] [INFO ] Deduced a trap composed of 208 places in 368 ms of which 5 ms to minimize.
[2024-05-27 22:25:47] [INFO ] Deduced a trap composed of 79 places in 225 ms of which 2 ms to minimize.
[2024-05-27 22:25:56] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 3 ms to minimize.
[2024-05-27 22:25:56] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-27 22:26:02] [INFO ] Deduced a trap composed of 430 places in 400 ms of which 5 ms to minimize.
[2024-05-27 22:26:04] [INFO ] Deduced a trap composed of 440 places in 446 ms of which 6 ms to minimize.
[2024-05-27 22:26:04] [INFO ] Deduced a trap composed of 66 places in 342 ms of which 5 ms to minimize.
SMT process timed out in 62895ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62912ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123639 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-04
Stuttering criterion allowed to conclude after 82211 steps with 353 reset in 601 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-04 finished in 124602 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 20 out of 832 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 832/832 places, 1652/1652 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 832 transition count 1582
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 762 transition count 1582
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 762 transition count 1482
Deduced a syphon composed of 100 places in 16 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 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 2 with 140 rules applied. Total rules applied 480 place count 592 transition count 1412
Applied a total of 480 rules in 310 ms. Remains 592 /832 variables (removed 240) and now considering 1412/1652 (removed 240) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-27 22:26:06] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 592 cols
[2024-05-27 22:26:06] [INFO ] Computed 46 invariants in 66 ms
[2024-05-27 22:26:06] [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-05-27 22:26:19] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-27 22:26:19] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 2 ms to minimize.
[2024-05-27 22:26:20] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:26:20] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-05-27 22:26:20] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:26:20] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:26:20] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2024-05-27 22:26:20] [INFO ] Deduced a trap composed of 51 places in 28 ms of which 0 ms to minimize.
[2024-05-27 22:26:20] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:26:20] [INFO ] Deduced a trap composed of 237 places in 329 ms of which 5 ms to minimize.
[2024-05-27 22:26:22] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:26:23] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 3 ms to minimize.
[2024-05-27 22:26:26] [INFO ] Deduced a trap composed of 398 places in 253 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 57 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 13/13 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, 13/57 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:26:32] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-27 22:26:44] [INFO ] Deduced a trap composed of 233 places in 331 ms of which 4 ms to minimize.
[2024-05-27 22:26:45] [INFO ] Deduced a trap composed of 271 places in 326 ms of which 4 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 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 16/16 constraints]
After SMT, in 42949ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42976ms
[2024-05-27 22:26:49] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:26:49] [INFO ] Invariant cache hit.
[2024-05-27 22:26:49] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-27 22:26:49] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:26:49] [INFO ] Invariant cache hit.
[2024-05-27 22:26:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:26:57] [INFO ] Implicit Places using invariants and state equation in 8307 ms returned []
Implicit Place search using SMT with State Equation took 8729 ms to find 0 implicit places.
[2024-05-27 22:26:57] [INFO ] Redundant transitions in 83 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-05-27 22:26:58] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:26:58] [INFO ] Invariant cache hit.
[2024-05-27 22:26:58] [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-05-27 22:27:13] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 4 ms to minimize.
[2024-05-27 22:27:13] [INFO ] Deduced a trap composed of 50 places in 244 ms of which 4 ms to minimize.
[2024-05-27 22:27:13] [INFO ] Deduced a trap composed of 50 places in 247 ms of which 3 ms to minimize.
[2024-05-27 22:27:14] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 4 ms to minimize.
[2024-05-27 22:27:14] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
[2024-05-27 22:27:14] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-05-27 22:27:14] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 8 ms to minimize.
[2024-05-27 22:27:14] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 2 ms to minimize.
[2024-05-27 22:27:14] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:27:14] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:27:15] [INFO ] Deduced a trap composed of 264 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:27:15] [INFO ] Deduced a trap composed of 254 places in 278 ms of which 3 ms to minimize.
[2024-05-27 22:27:15] [INFO ] Deduced a trap composed of 255 places in 282 ms of which 3 ms to minimize.
[2024-05-27 22:27:16] [INFO ] Deduced a trap composed of 216 places in 279 ms of which 3 ms to minimize.
[2024-05-27 22:27:16] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 4 ms to minimize.
[2024-05-27 22:27:18] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:27:24] [INFO ] Deduced a trap composed of 262 places in 255 ms of which 4 ms to minimize.
[2024-05-27 22:27:24] [INFO ] Deduced a trap composed of 255 places in 239 ms of which 4 ms to minimize.
[2024-05-27 22:27:30] [INFO ] Deduced a trap composed of 332 places in 245 ms of which 4 ms to minimize.
SMT process timed out in 32951ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 32975ms
Starting structural reductions in SI_LTL mode, iteration 1 : 592/832 places, 1412/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85089 ms. Remains : 592/832 places, 1412/1652 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-05
Product exploration explored 100000 steps with 2154 reset in 386 ms.
Product exploration explored 100000 steps with 2119 reset in 618 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 148 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 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 73 steps (0 resets) in 6 ms. (10 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 107 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 20 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 53 ms. Remains 592 /592 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-27 22:27:32] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:27:32] [INFO ] Invariant cache hit.
[2024-05-27 22:27:32] [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-05-27 22:27:47] [INFO ] Deduced a trap composed of 50 places in 218 ms of which 3 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 50 places in 279 ms of which 3 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 3 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 50 places in 161 ms of which 3 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 3 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-05-27 22:27:49] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:27:49] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:27:49] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:27:49] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:27:49] [INFO ] Deduced a trap composed of 264 places in 284 ms of which 4 ms to minimize.
[2024-05-27 22:27:49] [INFO ] Deduced a trap composed of 254 places in 291 ms of which 4 ms to minimize.
[2024-05-27 22:27:50] [INFO ] Deduced a trap composed of 255 places in 283 ms of which 4 ms to minimize.
[2024-05-27 22:27:50] [INFO ] Deduced a trap composed of 216 places in 263 ms of which 3 ms to minimize.
[2024-05-27 22:27:50] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 4 ms to minimize.
[2024-05-27 22:27:52] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 60 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 16/16 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, 16/60 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:28:10] [INFO ] Deduced a trap composed of 216 places in 247 ms of which 4 ms to minimize.
[2024-05-27 22:28:11] [INFO ] Deduced a trap composed of 80 places in 230 ms of which 4 ms to minimize.
[2024-05-27 22:28:14] [INFO ] Deduced a trap composed of 109 places in 228 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 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 19/19 constraints]
After SMT, in 43399ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 43421ms
[2024-05-27 22:28:16] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:28:16] [INFO ] Invariant cache hit.
[2024-05-27 22:28:16] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-27 22:28:16] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:28:16] [INFO ] Invariant cache hit.
[2024-05-27 22:28:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:28:24] [INFO ] Implicit Places using invariants and state equation in 8005 ms returned []
Implicit Place search using SMT with State Equation took 8476 ms to find 0 implicit places.
[2024-05-27 22:28:24] [INFO ] Redundant transitions in 57 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-05-27 22:28:24] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:28:24] [INFO ] Invariant cache hit.
[2024-05-27 22:28:24] [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-05-27 22:28:39] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 3 ms to minimize.
[2024-05-27 22:28:39] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 3 ms to minimize.
[2024-05-27 22:28:39] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 3 ms to minimize.
[2024-05-27 22:28:40] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 2 ms to minimize.
[2024-05-27 22:28:40] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 2 ms to minimize.
[2024-05-27 22:28:40] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2024-05-27 22:28:40] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:28:40] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:28:40] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 0 ms to minimize.
[2024-05-27 22:28:40] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:28:41] [INFO ] Deduced a trap composed of 264 places in 250 ms of which 3 ms to minimize.
[2024-05-27 22:28:41] [INFO ] Deduced a trap composed of 254 places in 269 ms of which 3 ms to minimize.
[2024-05-27 22:28:41] [INFO ] Deduced a trap composed of 255 places in 267 ms of which 4 ms to minimize.
[2024-05-27 22:28:41] [INFO ] Deduced a trap composed of 216 places in 286 ms of which 3 ms to minimize.
[2024-05-27 22:28:42] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
[2024-05-27 22:28:44] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 0 ms to minimize.
[2024-05-27 22:28:50] [INFO ] Deduced a trap composed of 262 places in 246 ms of which 4 ms to minimize.
[2024-05-27 22:28:50] [INFO ] Deduced a trap composed of 255 places in 259 ms of which 3 ms to minimize.
[2024-05-27 22:28:57] [INFO ] Deduced a trap composed of 332 places in 233 ms of which 4 ms to minimize.
[2024-05-27 22:28:57] [INFO ] Deduced a trap composed of 269 places in 244 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 64 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 20/20 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, 20/64 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:29:06] [INFO ] Deduced a trap composed of 382 places in 242 ms of which 3 ms to minimize.
[2024-05-27 22:29:11] [INFO ] Deduced a trap composed of 216 places in 246 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 2/66 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 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 22/22 constraints]
After SMT, in 63008ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 63025ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 115067 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 62 steps (0 resets) in 5 ms. (10 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 125 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2134 reset in 484 ms.
Product exploration explored 100000 steps with 2118 reset in 643 ms.
Support contains 20 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 47 ms. Remains 592 /592 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-27 22:29:29] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:29:29] [INFO ] Invariant cache hit.
[2024-05-27 22:29:29] [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-05-27 22:29:45] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 2 ms to minimize.
[2024-05-27 22:29:45] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 2 ms to minimize.
[2024-05-27 22:29:45] [INFO ] Deduced a trap composed of 50 places in 225 ms of which 3 ms to minimize.
[2024-05-27 22:29:45] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 2 ms to minimize.
[2024-05-27 22:29:46] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 3 ms to minimize.
[2024-05-27 22:29:46] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2024-05-27 22:29:46] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:29:46] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 0 ms to minimize.
[2024-05-27 22:29:46] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 0 ms to minimize.
[2024-05-27 22:29:46] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:29:46] [INFO ] Deduced a trap composed of 264 places in 264 ms of which 3 ms to minimize.
[2024-05-27 22:29:47] [INFO ] Deduced a trap composed of 254 places in 279 ms of which 3 ms to minimize.
[2024-05-27 22:29:47] [INFO ] Deduced a trap composed of 255 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:29:47] [INFO ] Deduced a trap composed of 216 places in 273 ms of which 3 ms to minimize.
[2024-05-27 22:29:48] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 4 ms to minimize.
[2024-05-27 22:29:49] [INFO ] Deduced a trap composed of 51 places in 30 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.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 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 4.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 9.0)
(s213 1.0)
(s214 0.0)
(s215 1.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 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.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 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 4.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 60 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 16/16 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, 16/60 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:30:07] [INFO ] Deduced a trap composed of 216 places in 248 ms of which 3 ms to minimize.
[2024-05-27 22:30:08] [INFO ] Deduced a trap composed of 80 places in 243 ms of which 3 ms to minimize.
[2024-05-27 22:30:11] [INFO ] Deduced a trap composed of 109 places in 248 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 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 19/19 constraints]
After SMT, in 43677ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 43739ms
[2024-05-27 22:30:13] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:30:13] [INFO ] Invariant cache hit.
[2024-05-27 22:30:13] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-27 22:30:13] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:30:13] [INFO ] Invariant cache hit.
[2024-05-27 22:30:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:30:22] [INFO ] Implicit Places using invariants and state equation in 8709 ms returned []
Implicit Place search using SMT with State Equation took 9199 ms to find 0 implicit places.
[2024-05-27 22:30:22] [INFO ] Redundant transitions in 20 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-05-27 22:30:22] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:30:22] [INFO ] Invariant cache hit.
[2024-05-27 22:30:22] [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-05-27 22:30:36] [INFO ] Deduced a trap composed of 50 places in 212 ms of which 3 ms to minimize.
[2024-05-27 22:30:36] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 3 ms to minimize.
[2024-05-27 22:30:37] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 2 ms to minimize.
[2024-05-27 22:30:37] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 3 ms to minimize.
[2024-05-27 22:30:37] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 2 ms to minimize.
[2024-05-27 22:30:37] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-05-27 22:30:37] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 1 ms to minimize.
[2024-05-27 22:30:37] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:30:37] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:30:37] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:30:38] [INFO ] Deduced a trap composed of 264 places in 266 ms of which 3 ms to minimize.
[2024-05-27 22:30:38] [INFO ] Deduced a trap composed of 254 places in 281 ms of which 3 ms to minimize.
[2024-05-27 22:30:38] [INFO ] Deduced a trap composed of 255 places in 338 ms of which 3 ms to minimize.
[2024-05-27 22:30:39] [INFO ] Deduced a trap composed of 216 places in 283 ms of which 4 ms to minimize.
[2024-05-27 22:30:39] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 4 ms to minimize.
[2024-05-27 22:30:41] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:30:48] [INFO ] Deduced a trap composed of 262 places in 274 ms of which 4 ms to minimize.
[2024-05-27 22:30:48] [INFO ] Deduced a trap composed of 255 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:30:54] [INFO ] Deduced a trap composed of 332 places in 273 ms of which 4 ms to minimize.
[2024-05-27 22:30:54] [INFO ] Deduced a trap composed of 269 places in 257 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 64 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 20/20 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, 20/64 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:31:04] [INFO ] Deduced a trap composed of 382 places in 337 ms of which 3 ms to minimize.
[2024-05-27 22:31:09] [INFO ] Deduced a trap composed of 216 places in 277 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
((s0 5timeout
^^^^^^^^
(error "Invalid token: 5timeout")
Error getting values : (error "ParserException while parsing response: ((s0 5timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 22/22 constraints]
After SMT, in 62960ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62978ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116034 ms. Remains : 592/592 places, 1412/1412 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-05 finished in 319842 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)))'
Support contains 10 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 55 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:31:25] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-05-27 22:31:25] [INFO ] Computed 46 invariants in 51 ms
[2024-05-27 22:31:25] [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-05-27 22:31:44] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-05-27 22:31:45] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-05-27 22:31:45] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:31:45] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-27 22:31:45] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:31:45] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:31:45] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:31:45] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 ms to minimize.
[2024-05-27 22:31:45] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2024-05-27 22:31:46] [INFO ] Deduced a trap composed of 463 places in 320 ms of which 4 ms to minimize.
[2024-05-27 22:31:46] [INFO ] Deduced a trap composed of 397 places in 341 ms of which 5 ms to minimize.
[2024-05-27 22:31:47] [INFO ] Deduced a trap composed of 208 places in 296 ms of which 4 ms to minimize.
[2024-05-27 22:31:47] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:31:48] [INFO ] Deduced a trap composed of 474 places in 348 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 58 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20028 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: 14/14 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, 14/58 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:31:51] [INFO ] Deduced a trap composed of 393 places in 318 ms of which 4 ms to minimize.
[2024-05-27 22:31:52] [INFO ] Deduced a trap composed of 422 places in 362 ms of which 5 ms to minimize.
[2024-05-27 22:31:52] [INFO ] Deduced a trap composed of 415 places in 328 ms of which 4 ms to minimize.
[2024-05-27 22:31:58] [INFO ] Deduced a trap composed of 97 places in 174 ms of which 3 ms to minimize.
[2024-05-27 22:32:05] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
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 20029 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 42847ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42876ms
[2024-05-27 22:32:08] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:32:08] [INFO ] Invariant cache hit.
[2024-05-27 22:32:09] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-27 22:32:09] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:32:09] [INFO ] Invariant cache hit.
[2024-05-27 22:32:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:32:25] [INFO ] Implicit Places using invariants and state equation in 16410 ms returned []
Implicit Place search using SMT with State Equation took 16967 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:32:25] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:32:25] [INFO ] Invariant cache hit.
[2024-05-27 22:32:25] [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-05-27 22:32:53] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:32:53] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-05-27 22:32:53] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2024-05-27 22:32:53] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 0 ms to minimize.
[2024-05-27 22:32:53] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:32:54] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 2 ms to minimize.
[2024-05-27 22:32:54] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
[2024-05-27 22:32:54] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:32:54] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:32:54] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
[2024-05-27 22:32:56] [INFO ] Deduced a trap composed of 457 places in 327 ms of which 4 ms to minimize.
[2024-05-27 22:32:56] [INFO ] Deduced a trap composed of 412 places in 347 ms of which 4 ms to minimize.
[2024-05-27 22:32:57] [INFO ] Deduced a trap composed of 471 places in 349 ms of which 4 ms to minimize.
[2024-05-27 22:32:57] [INFO ] Deduced a trap composed of 426 places in 330 ms of which 5 ms to minimize.
[2024-05-27 22:32:58] [INFO ] Deduced a trap composed of 465 places in 327 ms of which 4 ms to minimize.
[2024-05-27 22:32:58] [INFO ] Deduced a trap composed of 434 places in 332 ms of which 4 ms to minimize.
SMT process timed out in 32961ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 32976ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92880 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-07
Product exploration explored 100000 steps with 10817 reset in 364 ms.
Product exploration explored 100000 steps with 10830 reset in 315 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 35 steps (0 resets) in 5 ms. (5 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 93 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-05-27 22:32:59] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:32:59] [INFO ] Invariant cache hit.
[2024-05-27 22:33:00] [INFO ] [Real]Absence check using 14 positive place invariants in 58 ms returned sat
[2024-05-27 22:33:00] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 161 ms returned sat
[2024-05-27 22:33:02] [INFO ] [Real]Absence check using state equation in 1325 ms returned sat
[2024-05-27 22:33:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:33:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-05-27 22:33:03] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 162 ms returned sat
[2024-05-27 22:33:06] [INFO ] [Nat]Absence check using state equation in 3099 ms returned sat
[2024-05-27 22:33:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:33:07] [INFO ] [Nat]Added 120 Read/Feed constraints in 889 ms returned sat
[2024-05-27 22:33:07] [INFO ] Computed and/alt/rep : 760/1538/750 causal constraints (skipped 860 transitions) in 163 ms.
[2024-05-27 22:33:10] [INFO ] Added : 85 causal constraints over 17 iterations in 3145 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 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 1 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 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 2 with 140 rules applied. Total rules applied 480 place count 572 transition count 1392
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 490 place count 562 transition count 1382
Iterating global reduction 2 with 10 rules applied. Total rules applied 500 place count 562 transition count 1382
Applied a total of 500 rules in 122 ms. Remains 562 /812 variables (removed 250) and now considering 1382/1632 (removed 250) transitions.
Running 1380 sub problems to find dead transitions.
[2024-05-27 22:33:10] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
// Phase 1: matrix 1362 rows 562 cols
[2024-05-27 22:33:10] [INFO ] Computed 46 invariants in 19 ms
[2024-05-27 22:33:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:33:23] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2024-05-27 22:33:23] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:33:23] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:33:23] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:33:23] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2024-05-27 22:33:23] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-05-27 22:33:23] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:33:24] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:33:24] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:33:24] [INFO ] Deduced a trap composed of 212 places in 272 ms of which 4 ms to minimize.
[2024-05-27 22:33:24] [INFO ] Deduced a trap composed of 215 places in 290 ms of which 4 ms to minimize.
[2024-05-27 22:33:29] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 3 ms to minimize.
[2024-05-27 22:33:29] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/1924 variables, and 57 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:33:34] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 4 ms to minimize.
[2024-05-27 22:33:34] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-27 22:33:43] [INFO ] Deduced a trap composed of 210 places in 308 ms of which 5 ms to minimize.
[2024-05-27 22:33:51] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 3 ms to minimize.
[2024-05-27 22:33:52] [INFO ] Deduced a trap composed of 223 places in 234 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1924 variables, and 62 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 18/18 constraints]
After SMT, in 42544ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 42561ms
[2024-05-27 22:33:53] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:33:53] [INFO ] Invariant cache hit.
[2024-05-27 22:33:53] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-27 22:33:53] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:33:53] [INFO ] Invariant cache hit.
[2024-05-27 22:33:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:34:05] [INFO ] Implicit Places using invariants and state equation in 11353 ms returned []
Implicit Place search using SMT with State Equation took 11937 ms to find 0 implicit places.
[2024-05-27 22:34:05] [INFO ] Redundant transitions in 20 ms returned []
Running 1380 sub problems to find dead transitions.
[2024-05-27 22:34:05] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:34:05] [INFO ] Invariant cache hit.
[2024-05-27 22:34:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:34:19] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 2 ms to minimize.
[2024-05-27 22:34:19] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 4 ms to minimize.
[2024-05-27 22:34:19] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 5 ms to minimize.
[2024-05-27 22:34:19] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 2 ms to minimize.
[2024-05-27 22:34:19] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 2 ms to minimize.
[2024-05-27 22:34:19] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 1 ms to minimize.
[2024-05-27 22:34:20] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-05-27 22:34:20] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-05-27 22:34:20] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2024-05-27 22:34:20] [INFO ] Deduced a trap composed of 216 places in 255 ms of which 3 ms to minimize.
[2024-05-27 22:34:20] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 3 ms to minimize.
[2024-05-27 22:34:22] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 0 ms to minimize.
[2024-05-27 22:34:34] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 3 ms to minimize.
[2024-05-27 22:34:35] [INFO ] Deduced a trap composed of 179 places in 288 ms of which 3 ms to minimize.
[2024-05-27 22:34:36] [INFO ] Deduced a trap composed of 204 places in 254 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/1924 variables, and 59 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:35:03] [INFO ] Deduced a trap composed of 362 places in 239 ms of which 3 ms to minimize.
[2024-05-27 22:35:05] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 3 ms to minimize.
[2024-05-27 22:35:05] [INFO ] Deduced a trap composed of 110 places in 270 ms of which 3 ms to minimize.
[2024-05-27 22:35:06] [INFO ] Deduced a trap composed of 117 places in 236 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1924 variables, and 63 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 19/19 constraints]
After SMT, in 63111ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 63141ms
Starting structural reductions in SI_LTL mode, iteration 1 : 562/812 places, 1382/1632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117798 ms. Remains : 562/812 places, 1382/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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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)]
RANDOM walk for 35 steps (0 resets) in 6 ms. (5 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 72 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 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-05-27 22:35:08] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:35:08] [INFO ] Invariant cache hit.
[2024-05-27 22:35:09] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-27 22:35:09] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 216 ms returned sat
[2024-05-27 22:35:10] [INFO ] [Real]Absence check using state equation in 1298 ms returned sat
[2024-05-27 22:35:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:35:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2024-05-27 22:35:11] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 125 ms returned sat
[2024-05-27 22:35:15] [INFO ] [Nat]Absence check using state equation in 4420 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10839 reset in 287 ms.
Product exploration explored 100000 steps with 10837 reset in 297 ms.
Support contains 10 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 1382/1382 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 1382/1382 (removed 0) transitions.
Running 1380 sub problems to find dead transitions.
[2024-05-27 22:35:16] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:35:16] [INFO ] Invariant cache hit.
[2024-05-27 22:35:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:35:30] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 2 ms to minimize.
[2024-05-27 22:35:30] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 2 ms to minimize.
[2024-05-27 22:35:30] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 2 ms to minimize.
[2024-05-27 22:35:30] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-05-27 22:35:30] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 1 ms to minimize.
[2024-05-27 22:35:30] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:35:30] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:35:31] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:35:31] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2024-05-27 22:35:31] [INFO ] Deduced a trap composed of 216 places in 300 ms of which 2 ms to minimize.
[2024-05-27 22:35:31] [INFO ] Deduced a trap composed of 236 places in 234 ms of which 3 ms to minimize.
[2024-05-27 22:35:33] [INFO ] Deduced a trap composed of 47 places in 32 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 Real declared 560/1924 variables, and 56 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:35:53] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1924 variables, and 57 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 13/13 constraints]
After SMT, in 42486ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 42498ms
[2024-05-27 22:35:59] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:35:59] [INFO ] Invariant cache hit.
[2024-05-27 22:35:59] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-27 22:35:59] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:35:59] [INFO ] Invariant cache hit.
[2024-05-27 22:35:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:36:10] [INFO ] Implicit Places using invariants and state equation in 10844 ms returned []
Implicit Place search using SMT with State Equation took 11278 ms to find 0 implicit places.
[2024-05-27 22:36:10] [INFO ] Redundant transitions in 26 ms returned []
Running 1380 sub problems to find dead transitions.
[2024-05-27 22:36:10] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:36:10] [INFO ] Invariant cache hit.
[2024-05-27 22:36:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 3 ms to minimize.
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 2 ms to minimize.
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 1 ms to minimize.
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:36:25] [INFO ] Deduced a trap composed of 216 places in 321 ms of which 4 ms to minimize.
[2024-05-27 22:36:25] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 3 ms to minimize.
[2024-05-27 22:36:27] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:36:41] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 4 ms to minimize.
[2024-05-27 22:36:42] [INFO ] Deduced a trap composed of 179 places in 321 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 Real declared 560/1924 variables, and 58 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:36:57] [INFO ] Deduced a trap composed of 67 places in 203 ms of which 3 ms to minimize.
[2024-05-27 22:36:58] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1924 variables, and 60 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 16/16 constraints]
After SMT, in 62911ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 62930ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116771 ms. Remains : 562/562 places, 1382/1382 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-07 finished in 347668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 82 out of 832 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 832/832 places, 1652/1652 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 832 transition count 1582
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 150 place count 762 transition count 1572
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 160 place count 752 transition count 1572
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 160 place count 752 transition count 1462
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 380 place count 642 transition count 1462
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 390 place count 632 transition count 1452
Iterating global reduction 3 with 10 rules applied. Total rules applied 400 place count 632 transition count 1452
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 500 place count 582 transition count 1402
Applied a total of 500 rules in 69 ms. Remains 582 /832 variables (removed 250) and now considering 1402/1652 (removed 250) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-27 22:37:13] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 582 cols
[2024-05-27 22:37:13] [INFO ] Computed 46 invariants in 21 ms
[2024-05-27 22:37:13] [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-05-27 22:37:26] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:37:27] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:37:27] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:37:27] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:37:27] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 0 ms to minimize.
[2024-05-27 22:37:27] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 0 ms to minimize.
[2024-05-27 22:37:27] [INFO ] Deduced a trap composed of 49 places in 30 ms of which 1 ms to minimize.
[2024-05-27 22:37:29] [INFO ] Deduced a trap composed of 49 places in 29 ms of which 1 ms to minimize.
[2024-05-27 22:37:29] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:37:29] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 384 places in 220 ms of which 3 ms to minimize.
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 383 places in 221 ms of which 3 ms to minimize.
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 382 places in 271 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 57 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 13/13 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, 13/57 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 22:37:44] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 3 ms to minimize.
[2024-05-27 22:37:49] [INFO ] Deduced a trap composed of 216 places in 246 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 59 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 15/15 constraints]
After SMT, in 42666ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 42680ms
[2024-05-27 22:37:56] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 22:37:56] [INFO ] Invariant cache hit.
[2024-05-27 22:37:56] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-27 22:37:56] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 22:37:56] [INFO ] Invariant cache hit.
[2024-05-27 22:37:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:38:03] [INFO ] Implicit Places using invariants and state equation in 7406 ms returned []
Implicit Place search using SMT with State Equation took 7860 ms to find 0 implicit places.
[2024-05-27 22:38:04] [INFO ] Redundant transitions in 13 ms returned []
Running 1400 sub problems to find dead transitions.
[2024-05-27 22:38:04] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 22:38:04] [INFO ] Invariant cache hit.
[2024-05-27 22:38:04] [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-05-27 22:38:19] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:38:19] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 0 ms to minimize.
[2024-05-27 22:38:20] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 0 ms to minimize.
[2024-05-27 22:38:20] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:38:20] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
[2024-05-27 22:38:20] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:38:20] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2024-05-27 22:38:20] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:38:20] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 0 ms to minimize.
[2024-05-27 22:38:20] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:38:27] [INFO ] Deduced a trap composed of 233 places in 251 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.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 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 9.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 (/ 1.0 3.0))
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 (/ 1.0 3.0))
(s241 1.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 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 55 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 11/11 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, 11/55 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 22:38:43] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 3 ms to minimize.
[2024-05-27 22:38:47] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2024-05-27 22:38:47] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-27 22:38:52] [INFO ] Deduced a trap composed of 216 places in 254 ms of which 3 ms to minimize.
[2024-05-27 22:39:00] [INFO ] Deduced a trap composed of 103 places in 248 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 7)
(s1 3)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 0)
(s20 1)
(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)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 9)
(s223 0)
(s224 1)
(s225 1)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 1)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 1)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 1)
(s486 0)
(s487 0)
(s488 0)
(s489 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 60 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 16/16 constraints]
After SMT, in 63014ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 63028ms
Starting structural reductions in SI_LTL mode, iteration 1 : 582/832 places, 1402/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113664 ms. Remains : 582/832 places, 1402/1652 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-08
Stuttering criterion allowed to conclude after 1238 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-08 finished in 113832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 18 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 40 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:39:07] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-05-27 22:39:07] [INFO ] Computed 46 invariants in 18 ms
[2024-05-27 22:39:07] [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-05-27 22:39:26] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 1 ms to minimize.
[2024-05-27 22:39:26] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:39:27] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:39:27] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:39:27] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:39:27] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:39:27] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:39:27] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:39:27] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:39:28] [INFO ] Deduced a trap composed of 463 places in 336 ms of which 4 ms to minimize.
[2024-05-27 22:39:28] [INFO ] Deduced a trap composed of 397 places in 353 ms of which 4 ms to minimize.
[2024-05-27 22:39:29] [INFO ] Deduced a trap composed of 208 places in 491 ms of which 4 ms to minimize.
[2024-05-27 22:39:29] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 1 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 20033 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-05-27 22:39:32] [INFO ] Deduced a trap composed of 409 places in 310 ms of which 4 ms to minimize.
[2024-05-27 22:39:44] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 3 ms to minimize.
[2024-05-27 22:39:45] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 2 ms to minimize.
[2024-05-27 22:39:45] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-05-27 22:39:46] [INFO ] Deduced a trap composed of 410 places in 336 ms of which 5 ms to minimize.
[2024-05-27 22:39:49] [INFO ] Deduced a trap composed of 386 places in 315 ms of which 4 ms to minimize.
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 20021 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 42940ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42968ms
[2024-05-27 22:39:50] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:39:50] [INFO ] Invariant cache hit.
[2024-05-27 22:39:50] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-27 22:39:50] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:39:50] [INFO ] Invariant cache hit.
[2024-05-27 22:39:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:40:05] [INFO ] Implicit Places using invariants and state equation in 15246 ms returned []
Implicit Place search using SMT with State Equation took 15704 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:40:05] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:40:05] [INFO ] Invariant cache hit.
[2024-05-27 22:40:05] [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-05-27 22:40:35] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:40:36] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:40:36] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:40:36] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:40:36] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 0 ms to minimize.
[2024-05-27 22:40:36] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:40:36] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-05-27 22:40:36] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:40:36] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:40:36] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:40:38] [INFO ] Deduced a trap composed of 457 places in 331 ms of which 4 ms to minimize.
[2024-05-27 22:40:39] [INFO ] Deduced a trap composed of 412 places in 347 ms of which 4 ms to minimize.
SMT process timed out in 33317ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 33335ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92055 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-09 finished in 92155 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((F(p0)&&X(p1))))'
Support contains 31 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 27 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:40:39] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:40:39] [INFO ] Invariant cache hit.
[2024-05-27 22:40:39] [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 20022 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-05-27 22:41:03] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 1 ms to minimize.
[2024-05-27 22:41:03] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:41:03] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-05-27 22:41:03] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-05-27 22:41:03] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:41:04] [INFO ] Deduced a trap composed of 73 places in 353 ms of which 4 ms to minimize.
[2024-05-27 22:41:04] [INFO ] Deduced a trap composed of 207 places in 324 ms of which 5 ms to minimize.
[2024-05-27 22:41:07] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:41:13] [INFO ] Deduced a trap composed of 117 places in 252 ms of which 3 ms to minimize.
[2024-05-27 22:41:13] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:41:17] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 1 ms to minimize.
[2024-05-27 22:41:18] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:41:21] [INFO ] Deduced a trap composed of 424 places in 340 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 20021 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 42835ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42850ms
[2024-05-27 22:41:22] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:41:22] [INFO ] Invariant cache hit.
[2024-05-27 22:41:22] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-27 22:41:22] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:41:22] [INFO ] Invariant cache hit.
[2024-05-27 22:41:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:41:37] [INFO ] Implicit Places using invariants and state equation in 14353 ms returned []
Implicit Place search using SMT with State Equation took 14861 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:41:37] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:41:37] [INFO ] Invariant cache hit.
[2024-05-27 22:41:37] [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-05-27 22:42:07] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 0 ms to minimize.
[2024-05-27 22:42:07] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:42:07] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2024-05-27 22:42:07] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 0 ms to minimize.
[2024-05-27 22:42:07] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 ms to minimize.
[2024-05-27 22:42:07] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:42:07] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:42:07] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:42:07] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 0 ms to minimize.
[2024-05-27 22:42:08] [INFO ] Deduced a trap composed of 72 places in 54 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 30034 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-05-27 22:42:14] [INFO ] Deduced a trap composed of 208 places in 294 ms of which 4 ms to minimize.
[2024-05-27 22:42:23] [INFO ] Deduced a trap composed of 79 places in 202 ms of which 2 ms to minimize.
[2024-05-27 22:42:33] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 2 ms to minimize.
[2024-05-27 22:42:33] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 2 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)
(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)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 9)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 1)
(s494 1)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 1)
(s531 0)
(s532 1)
(s533 0)
(s534 1)
(s535 0)
(s536 1)
(s537 0)
(s538 1)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 6)
(s544 0)
(s545 1)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 1)
(s645 3)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 1)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)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 58 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30024 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: 14/14 constraints]
After SMT, in 62822ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62837ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120582 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-10
Product exploration explored 100000 steps with 3583 reset in 431 ms.
Product exploration explored 100000 steps with 3665 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 : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 145 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 214 steps (0 resets) in 5 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 111 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-05-27 22:42:41] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:42:41] [INFO ] Invariant cache hit.
[2024-05-27 22:42:42] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2024-05-27 22:42:42] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 73 ms returned sat
[2024-05-27 22:42:44] [INFO ] [Real]Absence check using state equation in 2216 ms returned sat
[2024-05-27 22:42:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:42:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 50 ms returned sat
[2024-05-27 22:42:45] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 146 ms returned sat
[2024-05-27 22:42:49] [INFO ] [Nat]Absence check using state equation in 4071 ms returned sat
[2024-05-27 22:42:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:42:50] [INFO ] [Nat]Added 120 Read/Feed constraints in 938 ms returned sat
[2024-05-27 22:42:51] [INFO ] Deduced a trap composed of 143 places in 370 ms of which 6 ms to minimize.
[2024-05-27 22:42:52] [INFO ] Deduced a trap composed of 229 places in 413 ms of which 4 ms to minimize.
[2024-05-27 22:42:53] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-05-27 22:42:53] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 0 ms to minimize.
[2024-05-27 22:42:53] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:42:54] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 1 ms to minimize.
[2024-05-27 22:42:55] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:42:55] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:42:56] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:42:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5647 ms
[2024-05-27 22:42:56] [INFO ] Computed and/alt/rep : 760/1538/750 causal constraints (skipped 860 transitions) in 125 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-27 22:42:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 20 out of 812 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 812 transition count 1582
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 762 transition count 1572
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 752 transition count 1572
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 120 place count 752 transition count 1472
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 320 place count 652 transition count 1472
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 440 place count 592 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 450 place count 582 transition count 1402
Iterating global reduction 3 with 10 rules applied. Total rules applied 460 place count 582 transition count 1402
Applied a total of 460 rules in 82 ms. Remains 582 /812 variables (removed 230) and now considering 1402/1632 (removed 230) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-27 22:42:59] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 582 cols
[2024-05-27 22:42:59] [INFO ] Computed 46 invariants in 22 ms
[2024-05-27 22:42:59] [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-05-27 22:43:14] [INFO ] Deduced a trap composed of 67 places in 221 ms of which 3 ms to minimize.
[2024-05-27 22:43:14] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-05-27 22:43:15] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-05-27 22:43:15] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-05-27 22:43:15] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-05-27 22:43:15] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
[2024-05-27 22:43:15] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:43:15] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:43:15] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:43:15] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 0 ms to minimize.
[2024-05-27 22:43:15] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:43:16] [INFO ] Deduced a trap composed of 258 places in 297 ms of which 3 ms to minimize.
[2024-05-27 22:43:16] [INFO ] Deduced a trap composed of 278 places in 259 ms of which 3 ms to minimize.
[2024-05-27 22:43:17] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 3 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 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 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-05-27 22:43:26] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 3 ms to minimize.
[2024-05-27 22:43:33] [INFO ] Deduced a trap composed of 382 places in 230 ms of which 3 ms to minimize.
[2024-05-27 22:43:39] [INFO ] Deduced a trap composed of 200 places in 325 ms of which 4 ms to minimize.
[2024-05-27 22:43:40] [INFO ] Deduced a trap composed of 107 places in 274 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 62 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 18/18 constraints]
After SMT, in 43453ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 43469ms
[2024-05-27 22:43:43] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 22:43:43] [INFO ] Invariant cache hit.
[2024-05-27 22:43:43] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-27 22:43:43] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 22:43:43] [INFO ] Invariant cache hit.
[2024-05-27 22:43:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:43:51] [INFO ] Implicit Places using invariants and state equation in 7367 ms returned []
Implicit Place search using SMT with State Equation took 7816 ms to find 0 implicit places.
[2024-05-27 22:43:51] [INFO ] Redundant transitions in 13 ms returned []
Running 1400 sub problems to find dead transitions.
[2024-05-27 22:43:51] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 22:43:51] [INFO ] Invariant cache hit.
[2024-05-27 22:43:51] [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-05-27 22:44:06] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-05-27 22:44:06] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:44:06] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 0 ms to minimize.
[2024-05-27 22:44:06] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 0 ms to minimize.
[2024-05-27 22:44:06] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 0 ms to minimize.
[2024-05-27 22:44:06] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:44:06] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:44:06] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:44:06] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:44:07] [INFO ] Deduced a trap composed of 247 places in 288 ms of which 3 ms to minimize.
[2024-05-27 22:44:07] [INFO ] Deduced a trap composed of 225 places in 266 ms of which 3 ms to minimize.
[2024-05-27 22:44:08] [INFO ] Deduced a trap composed of 241 places in 268 ms of which 3 ms to minimize.
[2024-05-27 22:44:08] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:44:09] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 0 ms to minimize.
[2024-05-27 22:44:23] [INFO ] Deduced a trap composed of 235 places in 260 ms of which 3 ms to minimize.
[2024-05-27 22:44:23] [INFO ] Deduced a trap composed of 119 places in 257 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 60 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 16/16 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, 16/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 22:44:26] [INFO ] Deduced a trap composed of 199 places in 269 ms of which 3 ms to minimize.
[2024-05-27 22:44:26] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 2 ms to minimize.
[2024-05-27 22:44:27] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 2 ms to minimize.
[2024-05-27 22:44:27] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2024-05-27 22:44:27] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 2 ms to minimize.
[2024-05-27 22:44:27] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2024-05-27 22:44:43] [INFO ] Deduced a trap composed of 216 places in 253 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 7/67 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 67 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 23/23 constraints]
After SMT, in 62785ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 62798ms
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 114215 ms. Remains : 582/812 places, 1402/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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 163 steps (0 resets) in 6 ms. (23 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 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2024-05-27 22:44:54] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 22:44:54] [INFO ] Invariant cache hit.
[2024-05-27 22:44:55] [INFO ] [Real]Absence check using 15 positive place invariants in 29 ms returned sat
[2024-05-27 22:44:55] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 90 ms returned sat
[2024-05-27 22:44:58] [INFO ] [Real]Absence check using state equation in 2873 ms returned sat
[2024-05-27 22:44:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:44:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2024-05-27 22:44:58] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 80 ms returned sat
[2024-05-27 22:45:01] [INFO ] [Nat]Absence check using state equation in 2068 ms returned sat
[2024-05-27 22:45:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:45:01] [INFO ] [Nat]Added 120 Read/Feed constraints in 435 ms returned sat
[2024-05-27 22:45:01] [INFO ] Deduced a trap composed of 49 places in 314 ms of which 3 ms to minimize.
[2024-05-27 22:45:02] [INFO ] Deduced a trap composed of 116 places in 298 ms of which 4 ms to minimize.
[2024-05-27 22:45:02] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 0 ms to minimize.
[2024-05-27 22:45:03] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
[2024-05-27 22:45:03] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:45:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2148 ms
[2024-05-27 22:45:03] [INFO ] Computed and/alt/rep : 440/948/430 causal constraints (skipped 950 transitions) in 123 ms.
[2024-05-27 22:45:05] [INFO ] Added : 92 causal constraints over 19 iterations in 2053 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2493 reset in 470 ms.
Product exploration explored 100000 steps with 2500 reset in 581 ms.
Support contains 20 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1402/1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 582 transition count 1392
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 572 transition count 1392
Applied a total of 20 rules in 29 ms. Remains 572 /582 variables (removed 10) and now considering 1392/1402 (removed 10) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 22:45:06] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 572 cols
[2024-05-27 22:45:06] [INFO ] Computed 46 invariants in 19 ms
[2024-05-27 22:45:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:45:21] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-27 22:45:21] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:45:21] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:45:21] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:45:21] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:45:21] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:45:21] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 0 ms to minimize.
[2024-05-27 22:45:21] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:45:21] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:45:21] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:45:22] [INFO ] Deduced a trap composed of 266 places in 302 ms of which 3 ms to minimize.
[2024-05-27 22:45:22] [INFO ] Deduced a trap composed of 265 places in 243 ms of which 3 ms to minimize.
[2024-05-27 22:45:22] [INFO ] Deduced a trap composed of 240 places in 246 ms of which 3 ms to minimize.
[2024-05-27 22:45:23] [INFO ] Deduced a trap composed of 240 places in 256 ms of which 3 ms to minimize.
[2024-05-27 22:45:23] [INFO ] Deduced a trap composed of 225 places in 265 ms of which 3 ms to minimize.
[2024-05-27 22:45:23] [INFO ] Deduced a trap composed of 283 places in 251 ms of which 3 ms to minimize.
[2024-05-27 22:45:23] [INFO ] Deduced a trap composed of 235 places in 271 ms of which 4 ms to minimize.
[2024-05-27 22:45:24] [INFO ] Deduced a trap composed of 48 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 62 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:45:31] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-27 22:45:36] [INFO ] Deduced a trap composed of 388 places in 439 ms of which 5 ms to minimize.
[2024-05-27 22:45:42] [INFO ] Deduced a trap composed of 293 places in 257 ms of which 3 ms to minimize.
[2024-05-27 22:45:42] [INFO ] Deduced a trap composed of 68 places in 260 ms of which 3 ms to minimize.
[2024-05-27 22:45:43] [INFO ] Deduced a trap composed of 109 places in 258 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 67 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 23/23 constraints]
After SMT, in 42400ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42415ms
[2024-05-27 22:45:49] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:45:49] [INFO ] Invariant cache hit.
[2024-05-27 22:45:50] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-05-27 22:45:50] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:45:50] [INFO ] Invariant cache hit.
[2024-05-27 22:45:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:45:59] [INFO ] Implicit Places using invariants and state equation in 9474 ms returned []
Implicit Place search using SMT with State Equation took 10383 ms to find 0 implicit places.
[2024-05-27 22:45:59] [INFO ] Redundant transitions in 35 ms returned []
Running 1390 sub problems to find dead transitions.
[2024-05-27 22:45:59] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:45:59] [INFO ] Invariant cache hit.
[2024-05-27 22:45:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:46:14] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 2 ms to minimize.
[2024-05-27 22:46:14] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 2 ms to minimize.
[2024-05-27 22:46:14] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 2 ms to minimize.
[2024-05-27 22:46:14] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 2 ms to minimize.
[2024-05-27 22:46:15] [INFO ] Deduced a trap composed of 48 places in 392 ms of which 1 ms to minimize.
[2024-05-27 22:46:15] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2024-05-27 22:46:15] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:46:15] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 0 ms to minimize.
[2024-05-27 22:46:15] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 0 ms to minimize.
[2024-05-27 22:46:15] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-05-27 22:46:16] [INFO ] Deduced a trap composed of 207 places in 237 ms of which 3 ms to minimize.
[2024-05-27 22:46:16] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 3 ms to minimize.
[2024-05-27 22:46:16] [INFO ] Deduced a trap composed of 286 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:46:16] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 3 ms to minimize.
[2024-05-27 22:46:29] [INFO ] Deduced a trap composed of 216 places in 285 ms of which 4 ms to minimize.
[2024-05-27 22:46:30] [INFO ] Deduced a trap composed of 226 places in 239 ms of which 4 ms to minimize.
[2024-05-27 22:46:31] [INFO ] Deduced a trap composed of 233 places in 276 ms of which 5 ms to minimize.
[2024-05-27 22:46:32] [INFO ] Deduced a trap composed of 111 places in 313 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 62 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:46:39] [INFO ] Deduced a trap composed of 388 places in 238 ms of which 3 ms to minimize.
[2024-05-27 22:46:45] [INFO ] Deduced a trap composed of 199 places in 255 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/64 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 64 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 20/20 constraints]
After SMT, in 62844ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 62860ms
Starting structural reductions in SI_LTL mode, iteration 1 : 572/582 places, 1392/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115736 ms. Remains : 572/582 places, 1392/1402 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-10 finished in 383221 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(F(p1)))))'
Support contains 41 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 48 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:47:02] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-05-27 22:47:02] [INFO ] Computed 46 invariants in 39 ms
[2024-05-27 22:47: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-05-27 22:47:23] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 2 ms to minimize.
[2024-05-27 22:47:23] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 1 ms to minimize.
[2024-05-27 22:47:24] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-05-27 22:47:24] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-05-27 22:47:24] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2024-05-27 22:47:24] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-05-27 22:47:24] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:47:24] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:47:24] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:47:25] [INFO ] Deduced a trap composed of 463 places in 395 ms of which 5 ms to minimize.
[2024-05-27 22:47:25] [INFO ] Deduced a trap composed of 397 places in 419 ms of which 5 ms to minimize.
[2024-05-27 22:47:26] [INFO ] Deduced a trap composed of 208 places in 338 ms of which 5 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 810/2424 variables, and 56 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20042 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: 12/12 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, 12/56 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:47:28] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 2 ms to minimize.
[2024-05-27 22:47:29] [INFO ] Deduced a trap composed of 445 places in 436 ms of which 5 ms to minimize.
[2024-05-27 22:47:30] [INFO ] Deduced a trap composed of 495 places in 441 ms of which 6 ms to minimize.
[2024-05-27 22:47:31] [INFO ] Deduced a trap composed of 465 places in 449 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 60 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20029 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: 16/16 constraints]
After SMT, in 43777ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 43803ms
[2024-05-27 22:47:46] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:47:46] [INFO ] Invariant cache hit.
[2024-05-27 22:47:47] [INFO ] Implicit Places using invariants in 870 ms returned []
[2024-05-27 22:47:47] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:47:47] [INFO ] Invariant cache hit.
[2024-05-27 22:47:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:48:05] [INFO ] Implicit Places using invariants and state equation in 18442 ms returned []
Implicit Place search using SMT with State Equation took 19328 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:48:05] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:48:05] [INFO ] Invariant cache hit.
[2024-05-27 22:48:05] [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-05-27 22:48:35] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 16 ms to minimize.
[2024-05-27 22:48:35] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 0 ms to minimize.
[2024-05-27 22:48:35] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2024-05-27 22:48:35] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:48:35] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:48:35] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:48:36] [INFO ] Deduced a trap composed of 72 places in 834 ms of which 1 ms to minimize.
[2024-05-27 22:48:36] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 ms to minimize.
[2024-05-27 22:48:37] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-05-27 22:48:37] [INFO ] Deduced a trap composed of 72 places in 57 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 30035 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-05-27 22:48:43] [INFO ] Deduced a trap composed of 208 places in 345 ms of which 4 ms to minimize.
[2024-05-27 22:48:52] [INFO ] Deduced a trap composed of 79 places in 216 ms of which 2 ms to minimize.
[2024-05-27 22:49:03] [INFO ] Deduced a trap composed of 52 places in 212 ms of which 2 ms to minimize.
[2024-05-27 22:49:03] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 58 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30023 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: 14/14 constraints]
After SMT, in 62965ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62990ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126192 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-12 finished in 126356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 27 out of 832 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 832 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 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 180 place count 742 transition count 1462
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 380 place count 642 transition count 1462
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 390 place count 632 transition count 1452
Iterating global reduction 2 with 10 rules applied. Total rules applied 400 place count 632 transition count 1452
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 560 place count 552 transition count 1372
Applied a total of 560 rules in 53 ms. Remains 552 /832 variables (removed 280) and now considering 1372/1652 (removed 280) transitions.
Running 1370 sub problems to find dead transitions.
[2024-05-27 22:49:09] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
// Phase 1: matrix 1352 rows 552 cols
[2024-05-27 22:49:09] [INFO ] Computed 46 invariants in 15 ms
[2024-05-27 22:49:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-27 22:49:22] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 0 ms to minimize.
[2024-05-27 22:49:22] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:49:22] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-05-27 22:49:22] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:49:23] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2024-05-27 22:49:23] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:49:23] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:49:23] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:49:23] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:49:23] [INFO ] Deduced a trap composed of 263 places in 240 ms of which 3 ms to minimize.
[2024-05-27 22:49:23] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 3 ms to minimize.
[2024-05-27 22:49:25] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:49:26] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 1 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 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1904 variables, and 57 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-27 22:49:33] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 3 ms to minimize.
[2024-05-27 22:49:33] [INFO ] Deduced a trap composed of 245 places in 258 ms of which 3 ms to minimize.
[2024-05-27 22:49:34] [INFO ] Deduced a trap composed of 215 places in 295 ms of which 3 ms to minimize.
[2024-05-27 22:49:36] [INFO ] Deduced a trap composed of 89 places in 242 ms of which 3 ms to minimize.
[2024-05-27 22:49:39] [INFO ] Deduced a trap composed of 212 places in 258 ms of which 3 ms to minimize.
[2024-05-27 22:49:50] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 3 ms to minimize.
[2024-05-27 22:49:51] [INFO ] Deduced a trap composed of 178 places in 239 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1904 variables, and 64 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 20/20 constraints]
After SMT, in 42682ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 42694ms
[2024-05-27 22:49:51] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2024-05-27 22:49:51] [INFO ] Invariant cache hit.
[2024-05-27 22:49:52] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-27 22:49:52] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2024-05-27 22:49:52] [INFO ] Invariant cache hit.
[2024-05-27 22:49:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:50:00] [INFO ] Implicit Places using invariants and state equation in 8741 ms returned []
Implicit Place search using SMT with State Equation took 9208 ms to find 0 implicit places.
[2024-05-27 22:50:00] [INFO ] Redundant transitions in 12 ms returned []
Running 1370 sub problems to find dead transitions.
[2024-05-27 22:50:00] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2024-05-27 22:50:00] [INFO ] Invariant cache hit.
[2024-05-27 22:50:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-27 22:50:14] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
[2024-05-27 22:50:14] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 2 ms to minimize.
[2024-05-27 22:50:14] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2024-05-27 22:50:15] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
[2024-05-27 22:50:15] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:50:15] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-05-27 22:50:15] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:50:15] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 0 ms to minimize.
[2024-05-27 22:50:15] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 0 ms to minimize.
[2024-05-27 22:50:15] [INFO ] Deduced a trap composed of 238 places in 279 ms of which 3 ms to minimize.
[2024-05-27 22:50:16] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 3 ms to minimize.
[2024-05-27 22:50:16] [INFO ] Deduced a trap composed of 237 places in 270 ms of which 3 ms to minimize.
[2024-05-27 22:50:16] [INFO ] Deduced a trap composed of 198 places in 258 ms of which 3 ms to minimize.
[2024-05-27 22:50:16] [INFO ] Deduced a trap composed of 256 places in 268 ms of which 3 ms to minimize.
[2024-05-27 22:50:17] [INFO ] Deduced a trap composed of 212 places in 254 ms of which 3 ms to minimize.
[2024-05-27 22:50:17] [INFO ] Deduced a trap composed of 211 places in 253 ms of which 3 ms to minimize.
[2024-05-27 22:50:17] [INFO ] Deduced a trap composed of 241 places in 260 ms of which 2 ms to minimize.
[2024-05-27 22:50:18] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 3 ms to minimize.
[2024-05-27 22:50:18] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2024-05-27 22:50:32] [INFO ] Deduced a trap composed of 197 places in 279 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1904 variables, and 64 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-27 22:50:43] [INFO ] Deduced a trap composed of 214 places in 150 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1904 variables, and 65 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 21/21 constraints]
After SMT, in 63077ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 63089ms
Starting structural reductions in SI_LTL mode, iteration 1 : 552/832 places, 1372/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115067 ms. Remains : 552/832 places, 1372/1652 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-13
Product exploration explored 100000 steps with 29 reset in 1774 ms.
Stack based approach found an accepted trace after 225 steps with 0 reset with depth 226 and stack size 226 in 4 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-13 finished in 116906 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)&&X((F(G(p1))&&F(!p1)))))'
Support contains 81 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 43 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:51:05] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-05-27 22:51:05] [INFO ] Computed 46 invariants in 24 ms
[2024-05-27 22:51:05] [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-05-27 22:51:26] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 2 ms to minimize.
[2024-05-27 22:51:26] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:51:26] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-27 22:51:26] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-05-27 22:51:26] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:51:26] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:51:26] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 0 ms to minimize.
[2024-05-27 22:51:26] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:51:26] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 0 ms to minimize.
[2024-05-27 22:51:27] [INFO ] Deduced a trap composed of 463 places in 349 ms of which 4 ms to minimize.
[2024-05-27 22:51:28] [INFO ] Deduced a trap composed of 397 places in 323 ms of which 5 ms to minimize.
[2024-05-27 22:51:28] [INFO ] Deduced a trap composed of 208 places in 299 ms of which 4 ms to minimize.
[2024-05-27 22:51:28] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 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 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.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 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 10.0)
(s243 1.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 1.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 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 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.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 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.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 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 10.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 1.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 10.0)
(s709 1.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 1.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 0.0)
(s728 0.0)
(s729 1.0)
(s730 1.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 20030 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-05-27 22:51:32] [INFO ] Deduced a trap composed of 409 places in 323 ms of which 5 ms to minimize.
[2024-05-27 22:51:43] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2024-05-27 22:51:44] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 3 ms to minimize.
[2024-05-27 22:51:44] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 2 ms to minimize.
[2024-05-27 22:51:45] [INFO ] Deduced a trap composed of 410 places in 331 ms of which 5 ms to minimize.
[2024-05-27 22:51:48] [INFO ] Deduced a trap composed of 386 places in 383 ms of which 5 ms to minimize.
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 20028 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 43223ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 43245ms
[2024-05-27 22:51:49] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:51:49] [INFO ] Invariant cache hit.
[2024-05-27 22:51:49] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-27 22:51:49] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:51:49] [INFO ] Invariant cache hit.
[2024-05-27 22:51:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:52:05] [INFO ] Implicit Places using invariants and state equation in 15695 ms returned []
Implicit Place search using SMT with State Equation took 16198 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:52:05] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:52:05] [INFO ] Invariant cache hit.
[2024-05-27 22:52:05] [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-05-27 22:52:34] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:52:34] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:52:34] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-05-27 22:52:34] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:52:34] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:52:34] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:52:34] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:52:35] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:52:35] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:52:35] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
[2024-05-27 22:52:37] [INFO ] Deduced a trap composed of 457 places in 332 ms of which 4 ms to minimize.
[2024-05-27 22:52:37] [INFO ] Deduced a trap composed of 412 places in 353 ms of which 4 ms to minimize.
[2024-05-27 22:52:38] [INFO ] Deduced a trap composed of 471 places in 365 ms of which 5 ms to minimize.
SMT process timed out in 32814ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 32829ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92326 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), true, p1, (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-14
Stuttering criterion allowed to conclude after 9550 steps with 0 reset in 34 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-14 finished in 92540 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)||(G(!p1) U p2))))'
Support contains 52 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Applied a total of 0 rules in 10 ms. Remains 832 /832 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2024-05-27 22:52:38] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 832 cols
[2024-05-27 22:52:38] [INFO ] Computed 46 invariants in 18 ms
[2024-05-27 22:52:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/830 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-27 22:52:58] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-27 22:52:58] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:52:58] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:52:59] [INFO ] Deduced a trap composed of 74 places in 337 ms of which 5 ms to minimize.
[2024-05-27 22:52:59] [INFO ] Deduced a trap composed of 246 places in 322 ms of which 4 ms to minimize.
[2024-05-27 22:53:00] [INFO ] Deduced a trap composed of 503 places in 314 ms of which 4 ms to minimize.
[2024-05-27 22:53:00] [INFO ] Deduced a trap composed of 58 places in 188 ms of which 3 ms to minimize.
[2024-05-27 22:53:01] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 830/2464 variables, and 52 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/832 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/830 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/830 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-27 22:53:03] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2024-05-27 22:53:03] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:53:03] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:53:03] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:53:03] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 0 ms to minimize.
[2024-05-27 22:53:05] [INFO ] Deduced a trap composed of 480 places in 345 ms of which 4 ms to minimize.
[2024-05-27 22:53:06] [INFO ] Deduced a trap composed of 23 places in 337 ms of which 4 ms to minimize.
[2024-05-27 22:53:06] [INFO ] Deduced a trap composed of 504 places in 366 ms of which 14 ms to minimize.
[2024-05-27 22:53:07] [INFO ] Deduced a trap composed of 422 places in 350 ms of which 4 ms to minimize.
[2024-05-27 22:53:07] [INFO ] Deduced a trap composed of 613 places in 376 ms of which 5 ms to minimize.
[2024-05-27 22:53:07] [INFO ] Deduced a trap composed of 440 places in 349 ms of which 5 ms to minimize.
[2024-05-27 22:53:08] [INFO ] Deduced a trap composed of 448 places in 340 ms of which 4 ms to minimize.
[2024-05-27 22:53:08] [INFO ] Deduced a trap composed of 448 places in 403 ms of which 5 ms to minimize.
SMT process timed out in 30102ms, After SMT, problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 30130ms
[2024-05-27 22:53:08] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-27 22:53:08] [INFO ] Invariant cache hit.
[2024-05-27 22:53:09] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-05-27 22:53:09] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-27 22:53:09] [INFO ] Invariant cache hit.
[2024-05-27 22:53:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:53:30] [INFO ] Implicit Places using invariants and state equation in 21656 ms returned []
Implicit Place search using SMT with State Equation took 22151 ms to find 0 implicit places.
Running 1650 sub problems to find dead transitions.
[2024-05-27 22:53:30] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-27 22:53:30] [INFO ] Invariant cache hit.
[2024-05-27 22:53:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/830 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-27 22:53:52] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:53:53] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 1 ms to minimize.
[2024-05-27 22:53:56] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
[2024-05-27 22:53:56] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 0 ms to minimize.
[2024-05-27 22:53:57] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:53:57] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 0 ms to minimize.
[2024-05-27 22:53:57] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:53:57] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:53:57] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:54:01] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:54:03] [INFO ] Deduced a trap composed of 432 places in 368 ms of which 5 ms to minimize.
SMT process timed out in 33018ms, After SMT, problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 33032ms
Finished structural reductions in LTL mode , in 1 iterations and 85339 ms. Remains : 832/832 places, 1652/1652 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-15
Stuttering criterion allowed to conclude after 8617 steps with 142 reset in 44 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-15 finished in 85515 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' '!(X(F(p0)))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T10-LTLFireability-07
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 10 out of 832 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 832 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 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 180 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 380 place count 642 transition count 1462
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 390 place count 632 transition count 1452
Iterating global reduction 2 with 10 rules applied. Total rules applied 400 place count 632 transition count 1452
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 2 with 140 rules applied. Total rules applied 540 place count 562 transition count 1382
Applied a total of 540 rules in 46 ms. Remains 562 /832 variables (removed 270) and now considering 1382/1652 (removed 270) transitions.
Running 1380 sub problems to find dead transitions.
[2024-05-27 22:54:04] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
// Phase 1: matrix 1362 rows 562 cols
[2024-05-27 22:54:04] [INFO ] Computed 46 invariants in 14 ms
[2024-05-27 22:54:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:54:17] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:54:17] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 0 ms to minimize.
[2024-05-27 22:54:17] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-05-27 22:54:17] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:54:18] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 17 ms to minimize.
[2024-05-27 22:54:18] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-05-27 22:54:18] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2024-05-27 22:54:18] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:54:18] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:54:18] [INFO ] Deduced a trap composed of 212 places in 240 ms of which 3 ms to minimize.
[2024-05-27 22:54:18] [INFO ] Deduced a trap composed of 215 places in 256 ms of which 3 ms to minimize.
[2024-05-27 22:54:22] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 2 ms to minimize.
[2024-05-27 22:54:23] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/1924 variables, and 57 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:54:28] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2024-05-27 22:54:28] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-05-27 22:54:35] [INFO ] Deduced a trap composed of 210 places in 253 ms of which 3 ms to minimize.
[2024-05-27 22:54:44] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 3 ms to minimize.
[2024-05-27 22:54:45] [INFO ] Deduced a trap composed of 223 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1924 variables, and 62 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 18/18 constraints]
After SMT, in 42820ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 42833ms
[2024-05-27 22:54:47] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:54:47] [INFO ] Invariant cache hit.
[2024-05-27 22:54:47] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-05-27 22:54:47] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:54:47] [INFO ] Invariant cache hit.
[2024-05-27 22:54:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:54:58] [INFO ] Implicit Places using invariants and state equation in 10843 ms returned []
Implicit Place search using SMT with State Equation took 11351 ms to find 0 implicit places.
Running 1380 sub problems to find dead transitions.
[2024-05-27 22:54:58] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:54:58] [INFO ] Invariant cache hit.
[2024-05-27 22:54:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:55:12] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-27 22:55:12] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 1 ms to minimize.
[2024-05-27 22:55:12] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 2 ms to minimize.
[2024-05-27 22:55:12] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 1 ms to minimize.
[2024-05-27 22:55:12] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-05-27 22:55:12] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:55:12] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:55:12] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:55:12] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:55:13] [INFO ] Deduced a trap composed of 216 places in 259 ms of which 3 ms to minimize.
[2024-05-27 22:55:13] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 2 ms to minimize.
[2024-05-27 22:55:15] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:55:27] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 3 ms to minimize.
[2024-05-27 22:55:27] [INFO ] Deduced a trap composed of 179 places in 218 ms of which 3 ms to minimize.
[2024-05-27 22:55:28] [INFO ] Deduced a trap composed of 204 places in 230 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.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 2.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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/1924 variables, and 59 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:55:56] [INFO ] Deduced a trap composed of 362 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:55:59] [INFO ] Deduced a trap composed of 66 places in 222 ms of which 3 ms to minimize.
[2024-05-27 22:55:59] [INFO ] Deduced a trap composed of 110 places in 275 ms of which 4 ms to minimize.
[2024-05-27 22:55:59] [INFO ] Deduced a trap composed of 117 places in 263 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1924 variables, and 63 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 19/19 constraints]
After SMT, in 62818ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 62831ms
Starting structural reductions in LI_LTL mode, iteration 1 : 562/832 places, 1382/1652 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 117072 ms. Remains : 562/832 places, 1382/1652 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-07
Product exploration explored 100000 steps with 10823 reset in 422 ms.
Product exploration explored 100000 steps with 10844 reset in 463 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) 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 35 steps (0 resets) in 4 ms. (7 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 113 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 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
[2024-05-27 22:56:02] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:56:02] [INFO ] Invariant cache hit.
[2024-05-27 22:56:03] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2024-05-27 22:56:03] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 216 ms returned sat
[2024-05-27 22:56:04] [INFO ] [Real]Absence check using state equation in 1301 ms returned sat
[2024-05-27 22:56:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:56:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2024-05-27 22:56:05] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 120 ms returned sat
[2024-05-27 22:56:10] [INFO ] [Nat]Absence check using state equation in 4676 ms returned unknown
Could not prove EG (NOT p0)
Support contains 10 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 1382/1382 transitions.
Applied a total of 0 rules in 34 ms. Remains 562 /562 variables (removed 0) and now considering 1382/1382 (removed 0) transitions.
Running 1380 sub problems to find dead transitions.
[2024-05-27 22:56:10] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:56:10] [INFO ] Invariant cache hit.
[2024-05-27 22:56:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:56:23] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 2 ms to minimize.
[2024-05-27 22:56:23] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 1 ms to minimize.
[2024-05-27 22:56:23] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2024-05-27 22:56:23] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 1 ms to minimize.
[2024-05-27 22:56:23] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2024-05-27 22:56:23] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-27 22:56:24] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:56:24] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:56:24] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:56:24] [INFO ] Deduced a trap composed of 216 places in 253 ms of which 3 ms to minimize.
[2024-05-27 22:56:24] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:56:26] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/1924 variables, and 56 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:56:47] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1924 variables, and 57 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 13/13 constraints]
After SMT, in 42990ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 43010ms
[2024-05-27 22:56:53] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:56:53] [INFO ] Invariant cache hit.
[2024-05-27 22:56:53] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-27 22:56:53] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:56:53] [INFO ] Invariant cache hit.
[2024-05-27 22:56:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:57:03] [INFO ] Implicit Places using invariants and state equation in 10406 ms returned []
Implicit Place search using SMT with State Equation took 10803 ms to find 0 implicit places.
[2024-05-27 22:57:04] [INFO ] Redundant transitions in 12 ms returned []
Running 1380 sub problems to find dead transitions.
[2024-05-27 22:57:04] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:57:04] [INFO ] Invariant cache hit.
[2024-05-27 22:57:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:57:17] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 2 ms to minimize.
[2024-05-27 22:57:17] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2024-05-27 22:57:17] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:57:17] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 1 ms to minimize.
[2024-05-27 22:57:17] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-05-27 22:57:17] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
[2024-05-27 22:57:17] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:57:18] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:57:18] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-05-27 22:57:18] [INFO ] Deduced a trap composed of 216 places in 336 ms of which 5 ms to minimize.
[2024-05-27 22:57:18] [INFO ] Deduced a trap composed of 236 places in 380 ms of which 6 ms to minimize.
[2024-05-27 22:57:20] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2024-05-27 22:57:32] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 3 ms to minimize.
[2024-05-27 22:57:33] [INFO ] Deduced a trap composed of 179 places in 243 ms of which 3 ms to minimize.
[2024-05-27 22:57:34] [INFO ] Deduced a trap composed of 204 places in 282 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/1924 variables, and 59 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:58:01] [INFO ] Deduced a trap composed of 362 places in 239 ms of which 3 ms to minimize.
[2024-05-27 22:58:03] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 3 ms to minimize.
[2024-05-27 22:58:03] [INFO ] Deduced a trap composed of 110 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:58:04] [INFO ] Deduced a trap composed of 117 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1924 variables, and 63 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 19/19 constraints]
After SMT, in 62923ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 62935ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116820 ms. Remains : 562/562 places, 1382/1382 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 70 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 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33 steps (0 resets) in 5 ms. (5 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 89 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)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
[2024-05-27 22:58:07] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:58:07] [INFO ] Invariant cache hit.
[2024-05-27 22:58:07] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-05-27 22:58:08] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 212 ms returned sat
[2024-05-27 22:58:09] [INFO ] [Real]Absence check using state equation in 1231 ms returned sat
[2024-05-27 22:58:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:58:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 21 ms returned sat
[2024-05-27 22:58:10] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 119 ms returned sat
[2024-05-27 22:58:14] [INFO ] [Nat]Absence check using state equation in 4369 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10847 reset in 398 ms.
Product exploration explored 100000 steps with 10841 reset in 377 ms.
Support contains 10 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 1382/1382 transitions.
Applied a total of 0 rules in 19 ms. Remains 562 /562 variables (removed 0) and now considering 1382/1382 (removed 0) transitions.
Running 1380 sub problems to find dead transitions.
[2024-05-27 22:58:15] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:58:15] [INFO ] Invariant cache hit.
[2024-05-27 22:58:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:58:29] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 2 ms to minimize.
[2024-05-27 22:58:29] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 2 ms to minimize.
[2024-05-27 22:58:30] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 2 ms to minimize.
[2024-05-27 22:58:30] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 1 ms to minimize.
[2024-05-27 22:58:30] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2024-05-27 22:58:30] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:58:30] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:58:30] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:58:30] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:58:30] [INFO ] Deduced a trap composed of 216 places in 252 ms of which 3 ms to minimize.
[2024-05-27 22:58:31] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 3 ms to minimize.
[2024-05-27 22:58:33] [INFO ] Deduced a trap composed of 47 places in 27 ms of which 0 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 560/1924 variables, and 56 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:58:53] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1924 variables, and 57 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 13/13 constraints]
After SMT, in 42756ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 42770ms
[2024-05-27 22:58:58] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:58:58] [INFO ] Invariant cache hit.
[2024-05-27 22:58:58] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-27 22:58:58] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:58:58] [INFO ] Invariant cache hit.
[2024-05-27 22:58:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:59:09] [INFO ] Implicit Places using invariants and state equation in 10851 ms returned []
Implicit Place search using SMT with State Equation took 11288 ms to find 0 implicit places.
[2024-05-27 22:59:09] [INFO ] Redundant transitions in 17 ms returned []
Running 1380 sub problems to find dead transitions.
[2024-05-27 22:59:09] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2024-05-27 22:59:09] [INFO ] Invariant cache hit.
[2024-05-27 22:59:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:59:23] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 3 ms to minimize.
[2024-05-27 22:59:24] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 2 ms to minimize.
[2024-05-27 22:59:24] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 1 ms to minimize.
[2024-05-27 22:59:24] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2024-05-27 22:59:24] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:59:24] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:59:24] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:59:24] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:59:24] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
[2024-05-27 22:59:25] [INFO ] Deduced a trap composed of 216 places in 232 ms of which 3 ms to minimize.
[2024-05-27 22:59:25] [INFO ] Deduced a trap composed of 236 places in 287 ms of which 4 ms to minimize.
[2024-05-27 22:59:26] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:59:38] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 3 ms to minimize.
[2024-05-27 22:59:39] [INFO ] Deduced a trap composed of 179 places in 264 ms of which 3 ms to minimize.
[2024-05-27 22:59:40] [INFO ] Deduced a trap composed of 204 places in 236 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/1924 variables, and 59 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 23:00:06] [INFO ] Deduced a trap composed of 362 places in 290 ms of which 3 ms to minimize.
[2024-05-27 23:00:09] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 3 ms to minimize.
[2024-05-27 23:00:09] [INFO ] Deduced a trap composed of 110 places in 245 ms of which 3 ms to minimize.
[2024-05-27 23:00:09] [INFO ] Deduced a trap composed of 117 places in 250 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1924 variables, and 63 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/562 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 19/19 constraints]
After SMT, in 62794ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 62809ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116916 ms. Remains : 562/562 places, 1382/1382 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-07 finished in 368212 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((F(p0)&&X(p1))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T10-LTLFireability-10
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 31 out of 832 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 832/832 places, 1652/1652 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 832 transition count 1582
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 150 place count 762 transition count 1572
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 160 place count 752 transition count 1572
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 160 place count 752 transition count 1472
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 360 place count 652 transition count 1472
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 370 place count 642 transition count 1462
Iterating global reduction 3 with 10 rules applied. Total rules applied 380 place count 642 transition count 1462
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 500 place count 582 transition count 1402
Applied a total of 500 rules in 70 ms. Remains 582 /832 variables (removed 250) and now considering 1402/1652 (removed 250) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-27 23:00:12] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 582 cols
[2024-05-27 23:00:12] [INFO ] Computed 46 invariants in 18 ms
[2024-05-27 23:00:12] [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-05-27 23:00:27] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 3 ms to minimize.
[2024-05-27 23:00:27] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2024-05-27 23:00:27] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 2 ms to minimize.
[2024-05-27 23:00:27] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-05-27 23:00:27] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2024-05-27 23:00:27] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-05-27 23:00:27] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-27 23:00:27] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:00:28] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-27 23:00:28] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-27 23:00:28] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 0 ms to minimize.
[2024-05-27 23:00:29] [INFO ] Deduced a trap composed of 258 places in 337 ms of which 3 ms to minimize.
[2024-05-27 23:00:29] [INFO ] Deduced a trap composed of 278 places in 278 ms of which 4 ms to minimize.
[2024-05-27 23:00:29] [INFO ] Deduced a trap composed of 248 places in 335 ms of which 5 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 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 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-05-27 23:00:38] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2024-05-27 23:00:44] [INFO ] Deduced a trap composed of 382 places in 309 ms of which 3 ms to minimize.
[2024-05-27 23:00:51] [INFO ] Deduced a trap composed of 200 places in 259 ms of which 3 ms to minimize.
[2024-05-27 23:00:51] [INFO ] Deduced a trap composed of 107 places in 222 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 580/1964 variables, and 62 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 18/18 constraints]
After SMT, in 43003ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 43018ms
[2024-05-27 23:00:55] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 23:00:55] [INFO ] Invariant cache hit.
[2024-05-27 23:00:56] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-27 23:00:56] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 23:00:56] [INFO ] Invariant cache hit.
[2024-05-27 23:00:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:01:03] [INFO ] Implicit Places using invariants and state equation in 7314 ms returned []
Implicit Place search using SMT with State Equation took 7755 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2024-05-27 23:01:03] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 23:01:03] [INFO ] Invariant cache hit.
[2024-05-27 23:01:03] [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-05-27 23:01:17] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 4 ms to minimize.
[2024-05-27 23:01:17] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:01:17] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-27 23:01:17] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-05-27 23:01:17] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2024-05-27 23:01:17] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 0 ms to minimize.
[2024-05-27 23:01:17] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 1 ms to minimize.
[2024-05-27 23:01:17] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-05-27 23:01:17] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-27 23:01:18] [INFO ] Deduced a trap composed of 247 places in 268 ms of which 3 ms to minimize.
[2024-05-27 23:01:18] [INFO ] Deduced a trap composed of 225 places in 273 ms of which 3 ms to minimize.
[2024-05-27 23:01:18] [INFO ] Deduced a trap composed of 241 places in 277 ms of which 3 ms to minimize.
[2024-05-27 23:01:19] [INFO ] Deduced a trap composed of 236 places in 309 ms of which 3 ms to minimize.
[2024-05-27 23:01:20] [INFO ] Deduced a trap composed of 49 places in 29 ms of which 0 ms to minimize.
[2024-05-27 23:01:34] [INFO ] Deduced a trap composed of 235 places in 229 ms of which 3 ms to minimize.
[2024-05-27 23:01:34] [INFO ] Deduced a trap composed of 119 places in 328 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 23:01:35] [INFO ] Deduced a trap composed of 199 places in 356 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 61 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 17/17 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, 17/61 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 23:01:39] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 3 ms to minimize.
[2024-05-27 23:01:45] [INFO ] Deduced a trap composed of 382 places in 343 ms of which 3 ms to minimize.
[2024-05-27 23:01:57] [INFO ] Deduced a trap composed of 216 places in 259 ms of which 3 ms to minimize.
[2024-05-27 23:01:58] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 4/65 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 65 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 21/21 constraints]
After SMT, in 63006ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 63027ms
Starting structural reductions in LI_LTL mode, iteration 1 : 582/832 places, 1402/1652 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 113878 ms. Remains : 582/832 places, 1402/1652 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-10
Product exploration explored 100000 steps with 4677 reset in 375 ms.
Product exploration explored 100000 steps with 4760 reset in 386 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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 93 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 161 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 110 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
[2024-05-27 23:02:07] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 23:02:07] [INFO ] Invariant cache hit.
[2024-05-27 23:02:08] [INFO ] [Real]Absence check using 15 positive place invariants in 28 ms returned sat
[2024-05-27 23:02:08] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 86 ms returned sat
[2024-05-27 23:02:11] [INFO ] [Real]Absence check using state equation in 2793 ms returned sat
[2024-05-27 23:02:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:02:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-05-27 23:02:11] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 75 ms returned sat
[2024-05-27 23:02:13] [INFO ] [Nat]Absence check using state equation in 2100 ms returned sat
[2024-05-27 23:02:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:02:14] [INFO ] [Nat]Added 120 Read/Feed constraints in 397 ms returned sat
[2024-05-27 23:02:14] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 4 ms to minimize.
[2024-05-27 23:02:15] [INFO ] Deduced a trap composed of 116 places in 265 ms of which 3 ms to minimize.
[2024-05-27 23:02:15] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2024-05-27 23:02:15] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2216 ms
[2024-05-27 23:02:16] [INFO ] Computed and/alt/rep : 440/948/430 causal constraints (skipped 950 transitions) in 119 ms.
[2024-05-27 23:02:18] [INFO ] Added : 92 causal constraints over 19 iterations in 1962 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 20 out of 582 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1402/1402 transitions.
Applied a total of 0 rules in 20 ms. Remains 582 /582 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-27 23:02:18] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 23:02:18] [INFO ] Invariant cache hit.
[2024-05-27 23:02:18] [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-05-27 23:02:32] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-27 23:02:32] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:02:32] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-27 23:02:32] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-27 23:02:32] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2024-05-27 23:02:32] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2024-05-27 23:02:32] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-27 23:02:32] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-27 23:02:33] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 0 ms to minimize.
[2024-05-27 23:02:33] [INFO ] Deduced a trap composed of 247 places in 258 ms of which 3 ms to minimize.
[2024-05-27 23:02:33] [INFO ] Deduced a trap composed of 225 places in 262 ms of which 3 ms to minimize.
[2024-05-27 23:02:34] [INFO ] Deduced a trap composed of 241 places in 281 ms of which 3 ms to minimize.
[2024-05-27 23:02:34] [INFO ] Deduced a trap composed of 236 places in 299 ms of which 3 ms to minimize.
[2024-05-27 23:02:35] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 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 580/1964 variables, and 58 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 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-05-27 23:02:43] [INFO ] Deduced a trap composed of 199 places in 244 ms of which 3 ms to minimize.
[2024-05-27 23:02:43] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-05-27 23:02:49] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
[2024-05-27 23:02:54] [INFO ] Deduced a trap composed of 76 places in 228 ms of which 3 ms to minimize.
[2024-05-27 23:02:55] [INFO ] Deduced a trap composed of 113 places in 232 ms of which 3 ms to minimize.
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/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 19/19 constraints]
After SMT, in 42221ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 42236ms
[2024-05-27 23:03:00] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 23:03:00] [INFO ] Invariant cache hit.
[2024-05-27 23:03:01] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-27 23:03:01] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 23:03:01] [INFO ] Invariant cache hit.
[2024-05-27 23:03:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:03:08] [INFO ] Implicit Places using invariants and state equation in 7301 ms returned []
Implicit Place search using SMT with State Equation took 7733 ms to find 0 implicit places.
[2024-05-27 23:03:08] [INFO ] Redundant transitions in 13 ms returned []
Running 1400 sub problems to find dead transitions.
[2024-05-27 23:03:08] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 23:03:08] [INFO ] Invariant cache hit.
[2024-05-27 23:03:08] [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-05-27 23:03:22] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-05-27 23:03:22] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-27 23:03:22] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 0 ms to minimize.
[2024-05-27 23:03:22] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-27 23:03:22] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:03:23] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 0 ms to minimize.
[2024-05-27 23:03:23] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-27 23:03:23] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 0 ms to minimize.
[2024-05-27 23:03:23] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 0 ms to minimize.
[2024-05-27 23:03:23] [INFO ] Deduced a trap composed of 247 places in 263 ms of which 3 ms to minimize.
[2024-05-27 23:03:24] [INFO ] Deduced a trap composed of 225 places in 321 ms of which 3 ms to minimize.
[2024-05-27 23:03:24] [INFO ] Deduced a trap composed of 241 places in 292 ms of which 4 ms to minimize.
[2024-05-27 23:03:24] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 3 ms to minimize.
[2024-05-27 23:03:25] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-27 23:03:39] [INFO ] Deduced a trap composed of 235 places in 223 ms of which 3 ms to minimize.
[2024-05-27 23:03:40] [INFO ] Deduced a trap composed of 119 places in 263 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 23:03:41] [INFO ] Deduced a trap composed of 199 places in 239 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 61 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 17/17 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, 17/61 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 23:03:44] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2024-05-27 23:03:49] [INFO ] Deduced a trap composed of 382 places in 355 ms of which 3 ms to minimize.
[2024-05-27 23:04:02] [INFO ] Deduced a trap composed of 216 places in 244 ms of which 3 ms to minimize.
[2024-05-27 23:04:03] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
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 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 65 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 21/21 constraints]
After SMT, in 62698ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 62710ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112738 ms. Remains : 582/582 places, 1402/1402 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 58 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 53 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 168 steps (0 resets) in 4 ms. (33 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 77 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 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
[2024-05-27 23:04:11] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 23:04:11] [INFO ] Invariant cache hit.
[2024-05-27 23:04:12] [INFO ] [Real]Absence check using 15 positive place invariants in 29 ms returned sat
[2024-05-27 23:04:12] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 98 ms returned sat
[2024-05-27 23:04:15] [INFO ] [Real]Absence check using state equation in 3069 ms returned sat
[2024-05-27 23:04:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:04:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2024-05-27 23:04:16] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 78 ms returned sat
[2024-05-27 23:04:18] [INFO ] [Nat]Absence check using state equation in 2245 ms returned sat
[2024-05-27 23:04:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:04:18] [INFO ] [Nat]Added 120 Read/Feed constraints in 481 ms returned sat
[2024-05-27 23:04:19] [INFO ] Deduced a trap composed of 49 places in 286 ms of which 3 ms to minimize.
[2024-05-27 23:04:19] [INFO ] Deduced a trap composed of 116 places in 297 ms of which 3 ms to minimize.
[2024-05-27 23:04:20] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-27 23:04:20] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-27 23:04:20] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 0 ms to minimize.
[2024-05-27 23:04:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2164 ms
[2024-05-27 23:04:21] [INFO ] Computed and/alt/rep : 440/948/430 causal constraints (skipped 950 transitions) in 105 ms.
[2024-05-27 23:04:23] [INFO ] Added : 92 causal constraints over 19 iterations in 2464 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2496 reset in 520 ms.
Product exploration explored 100000 steps with 2499 reset in 490 ms.
Support contains 20 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1402/1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 582 transition count 1392
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 572 transition count 1392
Applied a total of 20 rules in 43 ms. Remains 572 /582 variables (removed 10) and now considering 1392/1402 (removed 10) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 23:04:24] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 572 cols
[2024-05-27 23:04:24] [INFO ] Computed 46 invariants in 21 ms
[2024-05-27 23:04:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 23:04:38] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-05-27 23:04:38] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:04:38] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:04:39] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 0 ms to minimize.
[2024-05-27 23:04:39] [INFO ] Deduced a trap composed of 48 places in 28 ms of which 1 ms to minimize.
[2024-05-27 23:04:39] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 4 ms to minimize.
[2024-05-27 23:04:39] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:04:39] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 0 ms to minimize.
[2024-05-27 23:04:39] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2024-05-27 23:04:39] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-27 23:04:40] [INFO ] Deduced a trap composed of 266 places in 273 ms of which 3 ms to minimize.
[2024-05-27 23:04:40] [INFO ] Deduced a trap composed of 265 places in 252 ms of which 3 ms to minimize.
[2024-05-27 23:04:40] [INFO ] Deduced a trap composed of 240 places in 267 ms of which 3 ms to minimize.
[2024-05-27 23:04:40] [INFO ] Deduced a trap composed of 240 places in 248 ms of which 3 ms to minimize.
[2024-05-27 23:04:41] [INFO ] Deduced a trap composed of 225 places in 258 ms of which 3 ms to minimize.
[2024-05-27 23:04:41] [INFO ] Deduced a trap composed of 283 places in 247 ms of which 3 ms to minimize.
[2024-05-27 23:04:41] [INFO ] Deduced a trap composed of 235 places in 257 ms of which 3 ms to minimize.
[2024-05-27 23:04:41] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 62 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 23:04:49] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-27 23:04:55] [INFO ] Deduced a trap composed of 388 places in 266 ms of which 3 ms to minimize.
[2024-05-27 23:05:00] [INFO ] Deduced a trap composed of 293 places in 236 ms of which 3 ms to minimize.
[2024-05-27 23:05:01] [INFO ] Deduced a trap composed of 68 places in 242 ms of which 3 ms to minimize.
[2024-05-27 23:05:01] [INFO ] Deduced a trap composed of 109 places in 234 ms of which 3 ms to minimize.
[2024-05-27 23:05:07] [INFO ] Deduced a trap composed of 216 places in 245 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 7)
(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 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)
(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)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 9)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 1)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 68 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 24/24 constraints]
After SMT, in 43168ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 43188ms
[2024-05-27 23:05:07] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 23:05:07] [INFO ] Invariant cache hit.
[2024-05-27 23:05:08] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-27 23:05:08] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 23:05:08] [INFO ] Invariant cache hit.
[2024-05-27 23:05:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:05:17] [INFO ] Implicit Places using invariants and state equation in 9187 ms returned []
Implicit Place search using SMT with State Equation took 9663 ms to find 0 implicit places.
[2024-05-27 23:05:17] [INFO ] Redundant transitions in 13 ms returned []
Running 1390 sub problems to find dead transitions.
[2024-05-27 23:05:17] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 23:05:17] [INFO ] Invariant cache hit.
[2024-05-27 23:05:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 23:05:32] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 3 ms to minimize.
[2024-05-27 23:05:32] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 2 ms to minimize.
[2024-05-27 23:05:32] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
[2024-05-27 23:05:32] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-05-27 23:05:32] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 1 ms to minimize.
[2024-05-27 23:05:32] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2024-05-27 23:05:32] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-27 23:05:32] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-27 23:05:32] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 0 ms to minimize.
[2024-05-27 23:05:33] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 0 ms to minimize.
[2024-05-27 23:05:33] [INFO ] Deduced a trap composed of 207 places in 260 ms of which 3 ms to minimize.
[2024-05-27 23:05:33] [INFO ] Deduced a trap composed of 67 places in 273 ms of which 3 ms to minimize.
[2024-05-27 23:05:34] [INFO ] Deduced a trap composed of 286 places in 276 ms of which 3 ms to minimize.
[2024-05-27 23:05:34] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 4 ms to minimize.
[2024-05-27 23:05:47] [INFO ] Deduced a trap composed of 216 places in 266 ms of which 4 ms to minimize.
[2024-05-27 23:05:48] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 3 ms to minimize.
[2024-05-27 23:05:48] [INFO ] Deduced a trap composed of 233 places in 272 ms of which 3 ms to minimize.
[2024-05-27 23:05:49] [INFO ] Deduced a trap composed of 111 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 29.0 3.0))
(s1 (/ 1.0 3.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 1.0)
(s14 (/ 1.0 3.0))
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 1.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 1.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 1.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 (/ 2.0 3.0))
(s214 (/ 1.0 3.0))
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 62 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 23:05:57] [INFO ] Deduced a trap composed of 388 places in 254 ms of which 3 ms to minimize.
[2024-05-27 23:06:03] [INFO ] Deduced a trap composed of 199 places in 249 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/64 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 64 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 20/20 constraints]
After SMT, in 63150ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 63163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 572/582 places, 1392/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116090 ms. Remains : 572/582 places, 1392/1402 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-10 finished in 368410 ms.
[2024-05-27 23:06:20] [INFO ] Flatten gal took : 119 ms
[2024-05-27 23:06:20] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-27 23:06:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 832 places, 1652 transitions and 7140 arcs took 31 ms.
Total runtime 2691632 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J06T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 832
TRANSITIONS: 1652
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.037s, Sys 0.000s]


SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.004s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 4517
MODEL NAME: /home/mcc/execution/417/model
832 places, 1652 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

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="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-COL-S02J06T10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445200116"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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