Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 12K Apr 12 11:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 11:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 762K Apr 12 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.1M Apr 12 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J30-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717261257889

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:00:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:00:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:01:01] [INFO ] Load time of PNML (sax parser for PT used): 1116 ms
[2024-06-01 17:01:01] [INFO ] Transformed 664 places.
[2024-06-01 17:01:01] [INFO ] Transformed 12050 transitions.
[2024-06-01 17:01:01] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 1590 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 60 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-06-01 17:01:01] [INFO ] Reduced 780 identical enabling conditions.
[2024-06-01 17:01:01] [INFO ] Reduced 45 identical enabling conditions.
[2024-06-01 17:01:01] [INFO ] Reduced 45 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 114 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 125 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-06-01 17:01:02] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-06-01 17:01:02] [INFO ] Computed 92 invariants in 172 ms
[2024-06-01 17:01:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20085 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 57345ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 57409ms
[2024-06-01 17:01:59] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:01:59] [INFO ] Invariant cache hit.
[2024-06-01 17:02:00] [INFO ] Implicit Places using invariants in 859 ms returned []
[2024-06-01 17:02:00] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:02:00] [INFO ] Invariant cache hit.
[2024-06-01 17:02:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:02:06] [INFO ] Implicit Places using invariants and state equation in 6270 ms returned []
Implicit Place search using SMT with State Equation took 7141 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-06-01 17:02:06] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:02:06] [INFO ] Invariant cache hit.
[2024-06-01 17:02:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
[2024-06-01 17:03:02] [INFO ] Deduced a trap composed of 19 places in 448 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2595 variables, and 72 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 1/1 constraints]
After SMT, in 78466ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 78485ms
Finished structural reductions in LTL mode , in 1 iterations and 143247 ms. Remains : 664/664 places, 1940/1940 transitions.
Support contains 114 out of 664 places after structural reductions.
[2024-06-01 17:03:26] [INFO ] Flatten gal took : 536 ms
[2024-06-01 17:03:26] [INFO ] Flatten gal took : 199 ms
[2024-06-01 17:03:26] [INFO ] Input system was already deterministic with 1940 transitions.
RANDOM walk for 40000 steps (2241 resets) in 3498 ms. (11 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 316 ms. (12 steps per ms) remains 10/15 properties
BEST_FIRST walk for 4002 steps (40 resets) in 397 ms. (10 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (41 resets) in 96 ms. (41 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 5/10 properties
BEST_FIRST walk for 4003 steps (41 resets) in 22 ms. (174 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 4/4 properties
[2024-06-01 17:03:28] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:03:28] [INFO ] Invariant cache hit.
[2024-06-01 17:03:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 248/292 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 280/572 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 5 (OVERLAPS) 89/661 variables, 29/89 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 0/89 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/664 variables, 3/92 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1931/2595 variables, 664/756 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2595 variables, 1/757 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2595/2595 variables, and 757 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 91/112 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 168/280 variables, 28/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 280/560 variables, 28/59 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 99/659 variables, 29/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 17:03:30] [INFO ] Deduced a trap composed of 26 places in 520 ms of which 4 ms to minimize.
[2024-06-01 17:03:31] [INFO ] Deduced a trap composed of 24 places in 458 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/659 variables, 2/90 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/659 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/663 variables, 4/94 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/663 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1931/2594 variables, 663/757 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2594 variables, 1/758 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2594 variables, 2/760 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2594 variables, 0/760 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/2595 variables, 1/761 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2595 variables, 0/761 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2595 variables, 0/761 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2595/2595 variables, and 761 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4119 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 5794ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 228 ms.
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 81 place count 619 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 618 transition count 1904
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 82 place count 618 transition count 1870
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 150 place count 584 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 583 transition count 1869
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 583 transition count 1869
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 581 transition count 1867
Applied a total of 156 rules in 370 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
Running 1856 sub problems to find dead transitions.
[2024-06-01 17:03:34] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2024-06-01 17:03:34] [INFO ] Computed 82 invariants in 83 ms
[2024-06-01 17:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 2.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 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.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 1.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 9.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 4.0)
(s97 0.0)
(s98 4.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 1.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 1.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)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 4.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 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 4.0)
(s183 0.0)
(s184 1.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 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 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.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 8.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 1.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 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.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 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.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 4.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 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 1.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 4.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s397 4.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-06-01 17:04:13] [INFO ] Deduced a trap composed of 18 places in 431 ms of which 2 ms to minimize.
[2024-06-01 17:04:27] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 74 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 2/2 constraints]
After SMT, in 56905ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 56929ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57304 ms. Remains : 581/664 places, 1867/1940 transitions.
RANDOM walk for 536 steps (36 resets) in 26 ms. (19 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 13 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 72 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-06-01 17:04:32] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-06-01 17:04:32] [INFO ] Computed 82 invariants in 23 ms
[2024-06-01 17:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 3)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(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 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(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 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 9)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 2)
(s112 0)
(s113 3)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(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)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 2)
(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 1)
(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 3)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(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 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 10)
(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 1)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(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 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s325 1)
(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 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 3)
(s375 1)
(s376 1)
(s377 0)
(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 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 0)
(s417 0)
(s418 0)
(s419 0)
(s420 1)
(s421 1)
(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 3)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 1)
(s443 0)
(s445 3)
(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 1)
(s460 0)
(s461 0)
(s462 2)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 1)
(s468 0)
(s469 1)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 1)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 1)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 3)
(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 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 1)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(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 1)
(s567 0)
(s568 0)
(s569 0)
(s570 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 56669ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 56687ms
[2024-06-01 17:05:28] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-06-01 17:05:28] [INFO ] Invariant cache hit.
[2024-06-01 17:05:29] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-06-01 17:05:29] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-06-01 17:05:29] [INFO ] Invariant cache hit.
[2024-06-01 17:05:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:05:37] [INFO ] Implicit Places using invariants and state equation in 7731 ms returned []
Implicit Place search using SMT with State Equation took 8304 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-06-01 17:05:37] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-06-01 17:05:37] [INFO ] Invariant cache hit.
[2024-06-01 17:05:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
SMT process timed out in 82038ms, After SMT, problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 82075ms
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1939/1940 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147151 ms. Remains : 653/664 places, 1939/1940 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-00 finished in 147510 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 33 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1904
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1904
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1869
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1868
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1868
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 580 transition count 1866
Applied a total of 148 rules in 165 ms. Remains 580 /664 variables (removed 84) and now considering 1866/1940 (removed 74) transitions.
Running 1855 sub problems to find dead transitions.
[2024-06-01 17:06:59] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-06-01 17:06:59] [INFO ] Computed 82 invariants in 36 ms
[2024-06-01 17:06:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-06-01 17:07:38] [INFO ] Deduced a trap composed of 87 places in 290 ms of which 1 ms to minimize.
[2024-06-01 17:07:44] [INFO ] Deduced a trap composed of 283 places in 534 ms of which 3 ms to minimize.
[2024-06-01 17:07:44] [INFO ] Deduced a trap composed of 265 places in 451 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 75 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 3/3 constraints]
After SMT, in 57024ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 57045ms
[2024-06-01 17:07:56] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:07:56] [INFO ] Invariant cache hit.
[2024-06-01 17:07:57] [INFO ] Implicit Places using invariants in 698 ms returned []
[2024-06-01 17:07:57] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:07:57] [INFO ] Invariant cache hit.
[2024-06-01 17:07:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:08:05] [INFO ] Implicit Places using invariants and state equation in 8120 ms returned []
Implicit Place search using SMT with State Equation took 8858 ms to find 0 implicit places.
[2024-06-01 17:08:05] [INFO ] Redundant transitions in 98 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-06-01 17:08:05] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:08:05] [INFO ] Invariant cache hit.
[2024-06-01 17:08:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1541 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 10/580 variables, 10/82 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/2437 variables, and 82 constraints, problems are : Problem set: 615 solved, 1240 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 615 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
[2024-06-01 17:08:54] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 1 ms to minimize.
[2024-06-01 17:08:59] [INFO ] Deduced a trap composed of 283 places in 426 ms of which 4 ms to minimize.
[2024-06-01 17:09:00] [INFO ] Deduced a trap composed of 104 places in 427 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 3/75 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 75 constraints, problems are : Problem set: 615 solved, 1240 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/855 constraints, Known Traps: 3/3 constraints]
After SMT, in 76994ms problems are : Problem set: 615 solved, 1240 unsolved
Search for dead transitions found 615 dead transitions in 77023ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 580/664 places, 1251/1940 transitions.
Applied a total of 0 rules in 30 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-06-01 17:09:22] [INFO ] Redundant transitions in 73 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 143344 ms. Remains : 580/664 places, 1251/1940 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-02
Product exploration explored 100000 steps with 8160 reset in 1001 ms.
Product exploration explored 100000 steps with 8209 reset in 845 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 97 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 397 steps (31 resets) in 8 ms. (44 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 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 33 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 27 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Running 1240 sub problems to find dead transitions.
[2024-06-01 17:09:25] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-06-01 17:09:25] [INFO ] Computed 82 invariants in 14 ms
[2024-06-01 17:09:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:09:38] [INFO ] Deduced a trap composed of 151 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:09:39] [INFO ] Deduced a trap composed of 141 places in 220 ms of which 7 ms to minimize.
[2024-06-01 17:09:39] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 3 ms to minimize.
[2024-06-01 17:09:39] [INFO ] Deduced a trap composed of 141 places in 225 ms of which 2 ms to minimize.
[2024-06-01 17:09:39] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:09:40] [INFO ] Deduced a trap composed of 147 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:09:40] [INFO ] Deduced a trap composed of 181 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:09:40] [INFO ] Deduced a trap composed of 161 places in 190 ms of which 3 ms to minimize.
[2024-06-01 17:09:40] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:09:41] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:09:41] [INFO ] Deduced a trap composed of 141 places in 199 ms of which 4 ms to minimize.
[2024-06-01 17:09:41] [INFO ] Deduced a trap composed of 141 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:09:41] [INFO ] Deduced a trap composed of 141 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:09:42] [INFO ] Deduced a trap composed of 151 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:09:42] [INFO ] Deduced a trap composed of 151 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:09:42] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 3 ms to minimize.
[2024-06-01 17:09:42] [INFO ] Deduced a trap composed of 161 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:09:43] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:09:43] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:09:44] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:09:45] [INFO ] Deduced a trap composed of 152 places in 200 ms of which 4 ms to minimize.
[2024-06-01 17:09:45] [INFO ] Deduced a trap composed of 156 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:09:46] [INFO ] Deduced a trap composed of 161 places in 249 ms of which 4 ms to minimize.
[2024-06-01 17:09:46] [INFO ] Deduced a trap composed of 167 places in 204 ms of which 7 ms to minimize.
[2024-06-01 17:09:46] [INFO ] Deduced a trap composed of 157 places in 261 ms of which 3 ms to minimize.
[2024-06-01 17:09:46] [INFO ] Deduced a trap composed of 161 places in 216 ms of which 3 ms to minimize.
[2024-06-01 17:09:47] [INFO ] Deduced a trap composed of 235 places in 270 ms of which 4 ms to minimize.
[2024-06-01 17:09:47] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 3 ms to minimize.
[2024-06-01 17:09:47] [INFO ] Deduced a trap composed of 157 places in 183 ms of which 3 ms to minimize.
[2024-06-01 17:09:48] [INFO ] Deduced a trap composed of 146 places in 249 ms of which 3 ms to minimize.
[2024-06-01 17:09:48] [INFO ] Deduced a trap composed of 182 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:09:48] [INFO ] Deduced a trap composed of 152 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:09:48] [INFO ] Deduced a trap composed of 177 places in 237 ms of which 3 ms to minimize.
[2024-06-01 17:09:49] [INFO ] Deduced a trap composed of 146 places in 202 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 106 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 34/106 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:09:50] [INFO ] Deduced a trap composed of 111 places in 180 ms of which 3 ms to minimize.
[2024-06-01 17:09:51] [INFO ] Deduced a trap composed of 147 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:09:51] [INFO ] Deduced a trap composed of 79 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:09:51] [INFO ] Deduced a trap composed of 79 places in 183 ms of which 3 ms to minimize.
[2024-06-01 17:09:51] [INFO ] Deduced a trap composed of 78 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:09:51] [INFO ] Deduced a trap composed of 147 places in 249 ms of which 4 ms to minimize.
[2024-06-01 17:09:52] [INFO ] Deduced a trap composed of 79 places in 245 ms of which 4 ms to minimize.
[2024-06-01 17:09:52] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:09:52] [INFO ] Deduced a trap composed of 171 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:09:52] [INFO ] Deduced a trap composed of 78 places in 217 ms of which 3 ms to minimize.
[2024-06-01 17:09:53] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 17 ms to minimize.
[2024-06-01 17:09:53] [INFO ] Deduced a trap composed of 228 places in 192 ms of which 2 ms to minimize.
[2024-06-01 17:09:53] [INFO ] Deduced a trap composed of 146 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:09:53] [INFO ] Deduced a trap composed of 151 places in 197 ms of which 2 ms to minimize.
[2024-06-01 17:09:53] [INFO ] Deduced a trap composed of 161 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:09:54] [INFO ] Deduced a trap composed of 161 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:09:54] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:09:54] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:09:54] [INFO ] Deduced a trap composed of 132 places in 198 ms of which 15 ms to minimize.
[2024-06-01 17:09:55] [INFO ] Deduced a trap composed of 228 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:09:56] [INFO ] Deduced a trap composed of 142 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:09:56] [INFO ] Deduced a trap composed of 79 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:09:56] [INFO ] Deduced a trap composed of 152 places in 187 ms of which 10 ms to minimize.
[2024-06-01 17:09:56] [INFO ] Deduced a trap composed of 142 places in 213 ms of which 3 ms to minimize.
[2024-06-01 17:09:56] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:09:57] [INFO ] Deduced a trap composed of 127 places in 204 ms of which 4 ms to minimize.
[2024-06-01 17:09:57] [INFO ] Deduced a trap composed of 78 places in 233 ms of which 3 ms to minimize.
[2024-06-01 17:09:57] [INFO ] Deduced a trap composed of 79 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:09:57] [INFO ] Deduced a trap composed of 107 places in 230 ms of which 4 ms to minimize.
[2024-06-01 17:09:58] [INFO ] Deduced a trap composed of 79 places in 243 ms of which 4 ms to minimize.
[2024-06-01 17:09:58] [INFO ] Deduced a trap composed of 79 places in 223 ms of which 3 ms to minimize.
[2024-06-01 17:09:58] [INFO ] Deduced a trap composed of 79 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:09:58] [INFO ] Deduced a trap composed of 79 places in 219 ms of which 4 ms to minimize.
[2024-06-01 17:09:59] [INFO ] Deduced a trap composed of 79 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:09:59] [INFO ] Deduced a trap composed of 79 places in 238 ms of which 3 ms to minimize.
[2024-06-01 17:09:59] [INFO ] Deduced a trap composed of 79 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:09:59] [INFO ] Deduced a trap composed of 131 places in 224 ms of which 3 ms to minimize.
[2024-06-01 17:10:00] [INFO ] Deduced a trap composed of 79 places in 253 ms of which 4 ms to minimize.
[2024-06-01 17:10:00] [INFO ] Deduced a trap composed of 79 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:10:00] [INFO ] Deduced a trap composed of 79 places in 247 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:10:01] [INFO ] Deduced a trap composed of 20 places in 277 ms of which 2 ms to minimize.
[2024-06-01 17:10:02] [INFO ] Deduced a trap composed of 135 places in 403 ms of which 4 ms to minimize.
[2024-06-01 17:10:02] [INFO ] Deduced a trap composed of 131 places in 365 ms of which 4 ms to minimize.
[2024-06-01 17:10:03] [INFO ] Deduced a trap composed of 131 places in 379 ms of which 4 ms to minimize.
[2024-06-01 17:10:03] [INFO ] Deduced a trap composed of 131 places in 381 ms of which 4 ms to minimize.
[2024-06-01 17:10:03] [INFO ] Deduced a trap composed of 136 places in 301 ms of which 3 ms to minimize.
[2024-06-01 17:10:04] [INFO ] Deduced a trap composed of 126 places in 263 ms of which 3 ms to minimize.
[2024-06-01 17:10:04] [INFO ] Deduced a trap composed of 126 places in 276 ms of which 3 ms to minimize.
[2024-06-01 17:10:04] [INFO ] Deduced a trap composed of 140 places in 321 ms of which 3 ms to minimize.
[2024-06-01 17:10:05] [INFO ] Deduced a trap composed of 111 places in 287 ms of which 3 ms to minimize.
[2024-06-01 17:10:05] [INFO ] Deduced a trap composed of 131 places in 287 ms of which 4 ms to minimize.
[2024-06-01 17:10:05] [INFO ] Deduced a trap composed of 116 places in 388 ms of which 4 ms to minimize.
[2024-06-01 17:10:06] [INFO ] Deduced a trap composed of 116 places in 312 ms of which 3 ms to minimize.
[2024-06-01 17:10:06] [INFO ] Deduced a trap composed of 135 places in 285 ms of which 3 ms to minimize.
[2024-06-01 17:10:06] [INFO ] Deduced a trap composed of 121 places in 282 ms of which 3 ms to minimize.
[2024-06-01 17:10:07] [INFO ] Deduced a trap composed of 111 places in 280 ms of which 3 ms to minimize.
[2024-06-01 17:10:07] [INFO ] Deduced a trap composed of 161 places in 278 ms of which 3 ms to minimize.
[2024-06-01 17:10:07] [INFO ] Deduced a trap composed of 145 places in 370 ms of which 3 ms to minimize.
[2024-06-01 17:10:08] [INFO ] Deduced a trap composed of 121 places in 348 ms of which 3 ms to minimize.
[2024-06-01 17:10:08] [INFO ] Deduced a trap composed of 136 places in 333 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1822 variables, and 166 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1240 constraints, Known Traps: 94/94 constraints]
After SMT, in 43863ms problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 43875ms
[2024-06-01 17:10:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:10:09] [INFO ] Invariant cache hit.
[2024-06-01 17:10:09] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-06-01 17:10:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:10:09] [INFO ] Invariant cache hit.
[2024-06-01 17:10:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:10:16] [INFO ] Implicit Places using invariants and state equation in 6889 ms returned []
Implicit Place search using SMT with State Equation took 7689 ms to find 0 implicit places.
[2024-06-01 17:10:16] [INFO ] Redundant transitions in 57 ms returned []
Running 1240 sub problems to find dead transitions.
[2024-06-01 17:10:16] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:10:16] [INFO ] Invariant cache hit.
[2024-06-01 17:10:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 167 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 3 ms to minimize.
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 161 places in 266 ms of which 4 ms to minimize.
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 2 ms to minimize.
[2024-06-01 17:10:32] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 4 ms to minimize.
[2024-06-01 17:10:33] [INFO ] Deduced a trap composed of 240 places in 274 ms of which 3 ms to minimize.
[2024-06-01 17:10:33] [INFO ] Deduced a trap composed of 236 places in 216 ms of which 3 ms to minimize.
[2024-06-01 17:10:33] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 4 ms to minimize.
[2024-06-01 17:10:33] [INFO ] Deduced a trap composed of 234 places in 246 ms of which 4 ms to minimize.
[2024-06-01 17:10:34] [INFO ] Deduced a trap composed of 171 places in 240 ms of which 3 ms to minimize.
[2024-06-01 17:10:34] [INFO ] Deduced a trap composed of 224 places in 223 ms of which 4 ms to minimize.
[2024-06-01 17:10:34] [INFO ] Deduced a trap composed of 224 places in 214 ms of which 3 ms to minimize.
[2024-06-01 17:10:34] [INFO ] Deduced a trap composed of 151 places in 257 ms of which 5 ms to minimize.
[2024-06-01 17:10:35] [INFO ] Deduced a trap composed of 146 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:10:35] [INFO ] Deduced a trap composed of 236 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:10:35] [INFO ] Deduced a trap composed of 228 places in 196 ms of which 3 ms to minimize.
[2024-06-01 17:10:35] [INFO ] Deduced a trap composed of 226 places in 201 ms of which 3 ms to minimize.
[2024-06-01 17:10:35] [INFO ] Deduced a trap composed of 230 places in 179 ms of which 3 ms to minimize.
[2024-06-01 17:10:36] [INFO ] Deduced a trap composed of 226 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:10:36] [INFO ] Deduced a trap composed of 232 places in 174 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:10:37] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 2 ms to minimize.
[2024-06-01 17:10:37] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 3 ms to minimize.
[2024-06-01 17:10:37] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 3 ms to minimize.
[2024-06-01 17:10:38] [INFO ] Deduced a trap composed of 152 places in 176 ms of which 3 ms to minimize.
[2024-06-01 17:10:38] [INFO ] Deduced a trap composed of 229 places in 184 ms of which 3 ms to minimize.
[2024-06-01 17:10:38] [INFO ] Deduced a trap composed of 146 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:10:38] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 2 ms to minimize.
[2024-06-01 17:10:38] [INFO ] Deduced a trap composed of 141 places in 189 ms of which 3 ms to minimize.
[2024-06-01 17:10:39] [INFO ] Deduced a trap composed of 142 places in 194 ms of which 2 ms to minimize.
[2024-06-01 17:10:39] [INFO ] Deduced a trap composed of 181 places in 237 ms of which 3 ms to minimize.
[2024-06-01 17:10:39] [INFO ] Deduced a trap composed of 157 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:10:39] [INFO ] Deduced a trap composed of 131 places in 189 ms of which 3 ms to minimize.
[2024-06-01 17:10:40] [INFO ] Deduced a trap composed of 171 places in 198 ms of which 2 ms to minimize.
[2024-06-01 17:10:40] [INFO ] Deduced a trap composed of 151 places in 178 ms of which 2 ms to minimize.
[2024-06-01 17:10:40] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:10:40] [INFO ] Deduced a trap composed of 161 places in 189 ms of which 3 ms to minimize.
[2024-06-01 17:10:40] [INFO ] Deduced a trap composed of 177 places in 230 ms of which 4 ms to minimize.
[2024-06-01 17:10:41] [INFO ] Deduced a trap composed of 132 places in 225 ms of which 4 ms to minimize.
[2024-06-01 17:10:41] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 3 ms to minimize.
[2024-06-01 17:10:41] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 3.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 1.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 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.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 1.0)
(s72 0.0)
(s73 1.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 9.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.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 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.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)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.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 1.0)
(s183 0.0)
(s184 1.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 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.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 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.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 7.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 1.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 1.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.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 1.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 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:10:53] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 3 ms to minimize.
[2024-06-01 17:10:53] [INFO ] Deduced a trap composed of 121 places in 241 ms of which 3 ms to minimize.
[2024-06-01 17:10:54] [INFO ] Deduced a trap composed of 121 places in 224 ms of which 3 ms to minimize.
[2024-06-01 17:10:54] [INFO ] Deduced a trap composed of 121 places in 227 ms of which 3 ms to minimize.
[2024-06-01 17:10:54] [INFO ] Deduced a trap composed of 106 places in 217 ms of which 3 ms to minimize.
[2024-06-01 17:10:54] [INFO ] Deduced a trap composed of 131 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:10:55] [INFO ] Deduced a trap composed of 79 places in 220 ms of which 3 ms to minimize.
[2024-06-01 17:10:55] [INFO ] Deduced a trap composed of 78 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:10:55] [INFO ] Deduced a trap composed of 121 places in 214 ms of which 3 ms to minimize.
[2024-06-01 17:10:55] [INFO ] Deduced a trap composed of 131 places in 215 ms of which 2 ms to minimize.
[2024-06-01 17:10:56] [INFO ] Deduced a trap composed of 121 places in 232 ms of which 3 ms to minimize.
[2024-06-01 17:10:56] [INFO ] Deduced a trap composed of 126 places in 217 ms of which 3 ms to minimize.
[2024-06-01 17:10:56] [INFO ] Deduced a trap composed of 111 places in 246 ms of which 3 ms to minimize.
[2024-06-01 17:10:56] [INFO ] Deduced a trap composed of 117 places in 217 ms of which 3 ms to minimize.
[2024-06-01 17:10:57] [INFO ] Deduced a trap composed of 116 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:10:57] [INFO ] Deduced a trap composed of 112 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:10:57] [INFO ] Deduced a trap composed of 142 places in 225 ms of which 3 ms to minimize.
[2024-06-01 17:10:57] [INFO ] Deduced a trap composed of 131 places in 228 ms of which 2 ms to minimize.
[2024-06-01 17:10:57] [INFO ] Deduced a trap composed of 126 places in 199 ms of which 2 ms to minimize.
[2024-06-01 17:10:58] [INFO ] Deduced a trap composed of 116 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:11:00] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 2 ms to minimize.
[2024-06-01 17:11:00] [INFO ] Deduced a trap composed of 175 places in 291 ms of which 3 ms to minimize.
[2024-06-01 17:11:01] [INFO ] Deduced a trap composed of 151 places in 324 ms of which 3 ms to minimize.
[2024-06-01 17:11:01] [INFO ] Deduced a trap composed of 111 places in 282 ms of which 3 ms to minimize.
[2024-06-01 17:11:01] [INFO ] Deduced a trap composed of 166 places in 304 ms of which 3 ms to minimize.
[2024-06-01 17:11:02] [INFO ] Deduced a trap composed of 161 places in 287 ms of which 3 ms to minimize.
[2024-06-01 17:11:02] [INFO ] Deduced a trap composed of 140 places in 307 ms of which 3 ms to minimize.
[2024-06-01 17:11:02] [INFO ] Deduced a trap composed of 152 places in 277 ms of which 27 ms to minimize.
[2024-06-01 17:11:03] [INFO ] Deduced a trap composed of 121 places in 299 ms of which 2 ms to minimize.
[2024-06-01 17:11:03] [INFO ] Deduced a trap composed of 156 places in 291 ms of which 3 ms to minimize.
[2024-06-01 17:11:03] [INFO ] Deduced a trap composed of 136 places in 277 ms of which 3 ms to minimize.
[2024-06-01 17:11:04] [INFO ] Deduced a trap composed of 160 places in 288 ms of which 3 ms to minimize.
[2024-06-01 17:11:04] [INFO ] Deduced a trap composed of 156 places in 269 ms of which 3 ms to minimize.
[2024-06-01 17:11:04] [INFO ] Deduced a trap composed of 160 places in 336 ms of which 3 ms to minimize.
[2024-06-01 17:11:04] [INFO ] Deduced a trap composed of 151 places in 271 ms of which 3 ms to minimize.
[2024-06-01 17:11:05] [INFO ] Deduced a trap composed of 155 places in 266 ms of which 3 ms to minimize.
[2024-06-01 17:11:05] [INFO ] Deduced a trap composed of 151 places in 256 ms of which 2 ms to minimize.
[2024-06-01 17:11:05] [INFO ] Deduced a trap composed of 146 places in 305 ms of which 4 ms to minimize.
[2024-06-01 17:11:06] [INFO ] Deduced a trap composed of 150 places in 320 ms of which 3 ms to minimize.
[2024-06-01 17:11:06] [INFO ] Deduced a trap composed of 146 places in 275 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:11:08] [INFO ] Deduced a trap composed of 116 places in 328 ms of which 4 ms to minimize.
[2024-06-01 17:11:08] [INFO ] Deduced a trap composed of 131 places in 277 ms of which 3 ms to minimize.
[2024-06-01 17:11:09] [INFO ] Deduced a trap composed of 156 places in 369 ms of which 4 ms to minimize.
[2024-06-01 17:11:09] [INFO ] Deduced a trap composed of 116 places in 256 ms of which 3 ms to minimize.
[2024-06-01 17:11:09] [INFO ] Deduced a trap composed of 121 places in 274 ms of which 3 ms to minimize.
[2024-06-01 17:11:10] [INFO ] Deduced a trap composed of 130 places in 271 ms of which 3 ms to minimize.
[2024-06-01 17:11:10] [INFO ] Deduced a trap composed of 116 places in 258 ms of which 3 ms to minimize.
[2024-06-01 17:11:10] [INFO ] Deduced a trap composed of 146 places in 270 ms of which 3 ms to minimize.
[2024-06-01 17:11:11] [INFO ] Deduced a trap composed of 130 places in 358 ms of which 4 ms to minimize.
[2024-06-01 17:11:11] [INFO ] Deduced a trap composed of 126 places in 283 ms of which 3 ms to minimize.
[2024-06-01 17:11:11] [INFO ] Deduced a trap composed of 120 places in 371 ms of which 4 ms to minimize.
[2024-06-01 17:11:12] [INFO ] Deduced a trap composed of 131 places in 275 ms of which 3 ms to minimize.
[2024-06-01 17:11:12] [INFO ] Deduced a trap composed of 132 places in 369 ms of which 5 ms to minimize.
[2024-06-01 17:11:12] [INFO ] Deduced a trap composed of 106 places in 269 ms of which 3 ms to minimize.
[2024-06-01 17:11:13] [INFO ] Deduced a trap composed of 111 places in 346 ms of which 4 ms to minimize.
[2024-06-01 17:11:13] [INFO ] Deduced a trap composed of 161 places in 264 ms of which 3 ms to minimize.
[2024-06-01 17:11:13] [INFO ] Deduced a trap composed of 132 places in 255 ms of which 3 ms to minimize.
[2024-06-01 17:11:13] [INFO ] Deduced a trap composed of 135 places in 263 ms of which 3 ms to minimize.
[2024-06-01 17:11:14] [INFO ] Deduced a trap composed of 121 places in 365 ms of which 4 ms to minimize.
[2024-06-01 17:11:14] [INFO ] Deduced a trap composed of 131 places in 274 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:11:17] [INFO ] Deduced a trap composed of 222 places in 332 ms of which 3 ms to minimize.
[2024-06-01 17:11:18] [INFO ] Deduced a trap composed of 236 places in 296 ms of which 4 ms to minimize.
[2024-06-01 17:11:18] [INFO ] Deduced a trap composed of 182 places in 260 ms of which 4 ms to minimize.
[2024-06-01 17:11:18] [INFO ] Deduced a trap composed of 161 places in 239 ms of which 4 ms to minimize.
[2024-06-01 17:11:19] [INFO ] Deduced a trap composed of 171 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:11:19] [INFO ] Deduced a trap composed of 228 places in 190 ms of which 2 ms to minimize.
[2024-06-01 17:11:19] [INFO ] Deduced a trap composed of 171 places in 171 ms of which 3 ms to minimize.
[2024-06-01 17:11:19] [INFO ] Deduced a trap composed of 156 places in 268 ms of which 3 ms to minimize.
[2024-06-01 17:11:19] [INFO ] Deduced a trap composed of 176 places in 243 ms of which 4 ms to minimize.
[2024-06-01 17:11:20] [INFO ] Deduced a trap composed of 166 places in 278 ms of which 4 ms to minimize.
[2024-06-01 17:11:20] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:11:20] [INFO ] Deduced a trap composed of 171 places in 241 ms of which 4 ms to minimize.
[2024-06-01 17:11:21] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 2 ms to minimize.
[2024-06-01 17:11:21] [INFO ] Deduced a trap composed of 171 places in 230 ms of which 4 ms to minimize.
[2024-06-01 17:11:21] [INFO ] Deduced a trap composed of 161 places in 249 ms of which 4 ms to minimize.
SMT process timed out in 64759ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 64781ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116443 ms. Remains : 580/580 places, 1251/1251 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 112 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 323 steps (25 resets) in 6 ms. (46 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 117 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 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8247 reset in 818 ms.
Product exploration explored 100000 steps with 8214 reset in 808 ms.
Support contains 33 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 25 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Running 1240 sub problems to find dead transitions.
[2024-06-01 17:11:23] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:11:23] [INFO ] Invariant cache hit.
[2024-06-01 17:11:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:11:37] [INFO ] Deduced a trap composed of 167 places in 193 ms of which 3 ms to minimize.
[2024-06-01 17:11:38] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 3 ms to minimize.
[2024-06-01 17:11:38] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:11:38] [INFO ] Deduced a trap composed of 156 places in 262 ms of which 3 ms to minimize.
[2024-06-01 17:11:39] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:11:39] [INFO ] Deduced a trap composed of 240 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:11:39] [INFO ] Deduced a trap composed of 236 places in 209 ms of which 2 ms to minimize.
[2024-06-01 17:11:39] [INFO ] Deduced a trap composed of 228 places in 209 ms of which 3 ms to minimize.
[2024-06-01 17:11:40] [INFO ] Deduced a trap composed of 234 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:11:40] [INFO ] Deduced a trap composed of 171 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:11:40] [INFO ] Deduced a trap composed of 224 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:11:40] [INFO ] Deduced a trap composed of 224 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:11:40] [INFO ] Deduced a trap composed of 151 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:11:41] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 3 ms to minimize.
[2024-06-01 17:11:41] [INFO ] Deduced a trap composed of 236 places in 210 ms of which 16 ms to minimize.
[2024-06-01 17:11:41] [INFO ] Deduced a trap composed of 228 places in 213 ms of which 3 ms to minimize.
[2024-06-01 17:11:41] [INFO ] Deduced a trap composed of 226 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:11:42] [INFO ] Deduced a trap composed of 230 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:11:42] [INFO ] Deduced a trap composed of 226 places in 198 ms of which 3 ms to minimize.
[2024-06-01 17:11:42] [INFO ] Deduced a trap composed of 232 places in 205 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:11:43] [INFO ] Deduced a trap composed of 146 places in 247 ms of which 3 ms to minimize.
[2024-06-01 17:11:43] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 3 ms to minimize.
[2024-06-01 17:11:44] [INFO ] Deduced a trap composed of 156 places in 239 ms of which 3 ms to minimize.
[2024-06-01 17:11:44] [INFO ] Deduced a trap composed of 152 places in 242 ms of which 3 ms to minimize.
[2024-06-01 17:11:44] [INFO ] Deduced a trap composed of 229 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:11:44] [INFO ] Deduced a trap composed of 146 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:11:44] [INFO ] Deduced a trap composed of 146 places in 188 ms of which 2 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 141 places in 193 ms of which 2 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 142 places in 200 ms of which 17 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 181 places in 188 ms of which 3 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 157 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 131 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 171 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 151 places in 231 ms of which 3 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 7 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 161 places in 194 ms of which 5 ms to minimize.
[2024-06-01 17:11:47] [INFO ] Deduced a trap composed of 177 places in 196 ms of which 2 ms to minimize.
[2024-06-01 17:11:47] [INFO ] Deduced a trap composed of 132 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:11:47] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 3 ms to minimize.
[2024-06-01 17:11:47] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 136 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 121 places in 216 ms of which 2 ms to minimize.
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 121 places in 217 ms of which 3 ms to minimize.
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 121 places in 222 ms of which 3 ms to minimize.
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 106 places in 232 ms of which 3 ms to minimize.
[2024-06-01 17:11:52] [INFO ] Deduced a trap composed of 131 places in 213 ms of which 3 ms to minimize.
[2024-06-01 17:11:52] [INFO ] Deduced a trap composed of 79 places in 213 ms of which 3 ms to minimize.
[2024-06-01 17:11:52] [INFO ] Deduced a trap composed of 78 places in 211 ms of which 3 ms to minimize.
[2024-06-01 17:11:52] [INFO ] Deduced a trap composed of 121 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:11:53] [INFO ] Deduced a trap composed of 131 places in 239 ms of which 3 ms to minimize.
[2024-06-01 17:11:53] [INFO ] Deduced a trap composed of 121 places in 208 ms of which 2 ms to minimize.
[2024-06-01 17:11:53] [INFO ] Deduced a trap composed of 126 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:11:53] [INFO ] Deduced a trap composed of 111 places in 216 ms of which 3 ms to minimize.
[2024-06-01 17:11:54] [INFO ] Deduced a trap composed of 117 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:11:54] [INFO ] Deduced a trap composed of 116 places in 231 ms of which 2 ms to minimize.
[2024-06-01 17:11:54] [INFO ] Deduced a trap composed of 112 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:11:54] [INFO ] Deduced a trap composed of 142 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:11:55] [INFO ] Deduced a trap composed of 131 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:11:55] [INFO ] Deduced a trap composed of 126 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:11:55] [INFO ] Deduced a trap composed of 116 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:11:57] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 2 ms to minimize.
[2024-06-01 17:11:58] [INFO ] Deduced a trap composed of 175 places in 261 ms of which 3 ms to minimize.
[2024-06-01 17:11:58] [INFO ] Deduced a trap composed of 151 places in 268 ms of which 3 ms to minimize.
[2024-06-01 17:11:59] [INFO ] Deduced a trap composed of 111 places in 266 ms of which 3 ms to minimize.
[2024-06-01 17:11:59] [INFO ] Deduced a trap composed of 166 places in 279 ms of which 3 ms to minimize.
[2024-06-01 17:11:59] [INFO ] Deduced a trap composed of 161 places in 284 ms of which 2 ms to minimize.
[2024-06-01 17:11:59] [INFO ] Deduced a trap composed of 140 places in 295 ms of which 2 ms to minimize.
[2024-06-01 17:12:00] [INFO ] Deduced a trap composed of 152 places in 276 ms of which 2 ms to minimize.
[2024-06-01 17:12:00] [INFO ] Deduced a trap composed of 121 places in 278 ms of which 3 ms to minimize.
[2024-06-01 17:12:00] [INFO ] Deduced a trap composed of 156 places in 268 ms of which 3 ms to minimize.
[2024-06-01 17:12:01] [INFO ] Deduced a trap composed of 136 places in 349 ms of which 3 ms to minimize.
[2024-06-01 17:12:01] [INFO ] Deduced a trap composed of 160 places in 337 ms of which 3 ms to minimize.
[2024-06-01 17:12:01] [INFO ] Deduced a trap composed of 156 places in 272 ms of which 3 ms to minimize.
[2024-06-01 17:12:02] [INFO ] Deduced a trap composed of 160 places in 265 ms of which 3 ms to minimize.
[2024-06-01 17:12:02] [INFO ] Deduced a trap composed of 151 places in 258 ms of which 3 ms to minimize.
[2024-06-01 17:12:02] [INFO ] Deduced a trap composed of 155 places in 381 ms of which 4 ms to minimize.
[2024-06-01 17:12:03] [INFO ] Deduced a trap composed of 151 places in 277 ms of which 3 ms to minimize.
[2024-06-01 17:12:03] [INFO ] Deduced a trap composed of 146 places in 247 ms of which 3 ms to minimize.
[2024-06-01 17:12:03] [INFO ] Deduced a trap composed of 150 places in 251 ms of which 3 ms to minimize.
[2024-06-01 17:12:03] [INFO ] Deduced a trap composed of 146 places in 243 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:12:05] [INFO ] Deduced a trap composed of 116 places in 291 ms of which 3 ms to minimize.
[2024-06-01 17:12:06] [INFO ] Deduced a trap composed of 131 places in 281 ms of which 3 ms to minimize.
[2024-06-01 17:12:06] [INFO ] Deduced a trap composed of 156 places in 280 ms of which 3 ms to minimize.
[2024-06-01 17:12:06] [INFO ] Deduced a trap composed of 116 places in 261 ms of which 3 ms to minimize.
[2024-06-01 17:12:06] [INFO ] Deduced a trap composed of 121 places in 272 ms of which 3 ms to minimize.
[2024-06-01 17:12:07] [INFO ] Deduced a trap composed of 130 places in 275 ms of which 3 ms to minimize.
[2024-06-01 17:12:07] [INFO ] Deduced a trap composed of 116 places in 366 ms of which 3 ms to minimize.
[2024-06-01 17:12:08] [INFO ] Deduced a trap composed of 146 places in 340 ms of which 4 ms to minimize.
[2024-06-01 17:12:08] [INFO ] Deduced a trap composed of 130 places in 339 ms of which 4 ms to minimize.
[2024-06-01 17:12:08] [INFO ] Deduced a trap composed of 126 places in 339 ms of which 4 ms to minimize.
[2024-06-01 17:12:09] [INFO ] Deduced a trap composed of 120 places in 340 ms of which 3 ms to minimize.
[2024-06-01 17:12:09] [INFO ] Deduced a trap composed of 131 places in 348 ms of which 4 ms to minimize.
SMT process timed out in 45629ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 45640ms
[2024-06-01 17:12:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:12:09] [INFO ] Invariant cache hit.
[2024-06-01 17:12:10] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-06-01 17:12:10] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:12:10] [INFO ] Invariant cache hit.
[2024-06-01 17:12:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:12:17] [INFO ] Implicit Places using invariants and state equation in 7045 ms returned []
Implicit Place search using SMT with State Equation took 7691 ms to find 0 implicit places.
[2024-06-01 17:12:17] [INFO ] Redundant transitions in 16 ms returned []
Running 1240 sub problems to find dead transitions.
[2024-06-01 17:12:17] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:12:17] [INFO ] Invariant cache hit.
[2024-06-01 17:12:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:12:30] [INFO ] Deduced a trap composed of 167 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:12:31] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 2 ms to minimize.
[2024-06-01 17:12:31] [INFO ] Deduced a trap composed of 161 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:12:31] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:12:32] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:12:32] [INFO ] Deduced a trap composed of 240 places in 184 ms of which 3 ms to minimize.
[2024-06-01 17:12:32] [INFO ] Deduced a trap composed of 236 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:12:32] [INFO ] Deduced a trap composed of 228 places in 191 ms of which 2 ms to minimize.
[2024-06-01 17:12:33] [INFO ] Deduced a trap composed of 234 places in 189 ms of which 3 ms to minimize.
[2024-06-01 17:12:33] [INFO ] Deduced a trap composed of 171 places in 197 ms of which 2 ms to minimize.
[2024-06-01 17:12:33] [INFO ] Deduced a trap composed of 224 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:12:33] [INFO ] Deduced a trap composed of 224 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:12:33] [INFO ] Deduced a trap composed of 151 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:12:34] [INFO ] Deduced a trap composed of 146 places in 221 ms of which 2 ms to minimize.
[2024-06-01 17:12:34] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:12:34] [INFO ] Deduced a trap composed of 228 places in 198 ms of which 2 ms to minimize.
[2024-06-01 17:12:34] [INFO ] Deduced a trap composed of 226 places in 205 ms of which 3 ms to minimize.
[2024-06-01 17:12:35] [INFO ] Deduced a trap composed of 230 places in 210 ms of which 2 ms to minimize.
[2024-06-01 17:12:35] [INFO ] Deduced a trap composed of 226 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:12:35] [INFO ] Deduced a trap composed of 232 places in 197 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:12:36] [INFO ] Deduced a trap composed of 146 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:12:36] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 2 ms to minimize.
[2024-06-01 17:12:36] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 2 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 152 places in 195 ms of which 2 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 229 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 146 places in 198 ms of which 3 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 146 places in 188 ms of which 2 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 141 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:12:38] [INFO ] Deduced a trap composed of 142 places in 193 ms of which 3 ms to minimize.
[2024-06-01 17:12:38] [INFO ] Deduced a trap composed of 181 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:12:38] [INFO ] Deduced a trap composed of 157 places in 205 ms of which 3 ms to minimize.
[2024-06-01 17:12:38] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 3 ms to minimize.
[2024-06-01 17:12:39] [INFO ] Deduced a trap composed of 171 places in 179 ms of which 3 ms to minimize.
[2024-06-01 17:12:39] [INFO ] Deduced a trap composed of 151 places in 196 ms of which 2 ms to minimize.
[2024-06-01 17:12:39] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 3 ms to minimize.
[2024-06-01 17:12:39] [INFO ] Deduced a trap composed of 161 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:12:39] [INFO ] Deduced a trap composed of 177 places in 196 ms of which 3 ms to minimize.
[2024-06-01 17:12:40] [INFO ] Deduced a trap composed of 132 places in 213 ms of which 3 ms to minimize.
[2024-06-01 17:12:40] [INFO ] Deduced a trap composed of 162 places in 180 ms of which 3 ms to minimize.
[2024-06-01 17:12:40] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:12:51] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:12:51] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 3 ms to minimize.
[2024-06-01 17:12:51] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 3 ms to minimize.
[2024-06-01 17:12:51] [INFO ] Deduced a trap composed of 146 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:12:52] [INFO ] Deduced a trap composed of 161 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:12:52] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 3 ms to minimize.
SMT process timed out in 35123ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 35134ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 88522 ms. Remains : 580/580 places, 1251/1251 transitions.
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-02 finished in 353520 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&&(!p1 U (p2||G(!p1)))))))'
Support contains 14 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 113 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-06-01 17:12:53] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-06-01 17:12:53] [INFO ] Computed 82 invariants in 22 ms
[2024-06-01 17:12:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 57870ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 57887ms
[2024-06-01 17:13:50] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-06-01 17:13:50] [INFO ] Invariant cache hit.
[2024-06-01 17:13:51] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-06-01 17:13:51] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-06-01 17:13:51] [INFO ] Invariant cache hit.
[2024-06-01 17:13:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:14:01] [INFO ] Implicit Places using invariants and state equation in 9483 ms returned []
Implicit Place search using SMT with State Equation took 10068 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-06-01 17:14:01] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-06-01 17:14:01] [INFO ] Invariant cache hit.
[2024-06-01 17:14:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 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 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/653 variables, 11/82 constraints. Problems are: Problem set: 56 solved, 1872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/2583 variables, and 82 constraints, problems are : Problem set: 56 solved, 1872 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 77355ms problems are : Problem set: 56 solved, 1872 unsolved
Search for dead transitions found 56 dead transitions in 77374ms
Found 56 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 56 transitions
Dead transitions reduction (with SMT) removed 56 transitions
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1883/1940 transitions.
Applied a total of 0 rules in 32 ms. Remains 653 /653 variables (removed 0) and now considering 1883/1883 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145484 ms. Remains : 653/664 places, 1883/1940 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-05
Product exploration explored 100000 steps with 5601 reset in 1539 ms.
Product exploration explored 100000 steps with 5602 reset in 1406 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 p0 p2 (NOT p1)), (X p2), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 129 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (OR (NOT p0) (AND p1 (NOT p2)))]
RANDOM walk for 40000 steps (2239 resets) in 2800 ms. (14 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (422 resets) in 1408 ms. (28 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (136 resets) in 1800 ms. (22 steps per ms) remains 1/5 properties
[2024-06-01 17:15:23] [INFO ] Flow matrix only has 1874 transitions (discarded 9 similar events)
// Phase 1: matrix 1874 rows 653 cols
[2024-06-01 17:15:23] [INFO ] Computed 82 invariants in 20 ms
[2024-06-01 17:15:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 215/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 404/620 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/651 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/652 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1874/2526 variables, 652/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2526 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2526 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2527 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2527 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2527 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2527/2527 variables, and 736 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 653/653 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 215/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 404/620 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/651 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/652 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1874/2526 variables, 652/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2526 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2526 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2527 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2527 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2527 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2527 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2527/2527 variables, and 737 constraints, problems are : Problem set: 0 solved, 1 unsolved in 984 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 653/653 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2045ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 653/653 places, 1883/1883 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1848
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 618 transition count 1848
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 618 transition count 1813
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 583 transition count 1813
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 146 place count 580 transition count 1810
Applied a total of 146 rules in 160 ms. Remains 580 /653 variables (removed 73) and now considering 1810/1883 (removed 73) transitions.
Running 1799 sub problems to find dead transitions.
[2024-06-01 17:15:25] [INFO ] Flow matrix only has 1801 transitions (discarded 9 similar events)
// Phase 1: matrix 1801 rows 580 cols
[2024-06-01 17:15:25] [INFO ] Computed 82 invariants in 27 ms
[2024-06-01 17:15:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1799 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1799 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2381 variables, and 72 constraints, problems are : Problem set: 0 solved, 1799 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1799/1799 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1799 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1799 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1799 unsolved
[2024-06-01 17:16:13] [INFO ] Deduced a trap composed of 79 places in 236 ms of which 4 ms to minimize.
[2024-06-01 17:16:13] [INFO ] Deduced a trap composed of 254 places in 234 ms of which 3 ms to minimize.
[2024-06-01 17:16:13] [INFO ] Deduced a trap composed of 139 places in 236 ms of which 3 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 1 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 148 places in 375 ms of which 3 ms to minimize.
[2024-06-01 17:16:15] [INFO ] Deduced a trap composed of 78 places in 505 ms of which 4 ms to minimize.
[2024-06-01 17:16:19] [INFO ] Deduced a trap composed of 79 places in 390 ms of which 3 ms to minimize.
[2024-06-01 17:16:21] [INFO ] Deduced a trap composed of 252 places in 379 ms of which 3 ms to minimize.
[2024-06-01 17:16:22] [INFO ] Deduced a trap composed of 153 places in 388 ms of which 2 ms to minimize.
[2024-06-01 17:16:23] [INFO ] Deduced a trap composed of 230 places in 402 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2381 variables, and 82 constraints, problems are : Problem set: 0 solved, 1799 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1799 constraints, Known Traps: 10/10 constraints]
After SMT, in 64590ms problems are : Problem set: 0 solved, 1799 unsolved
Search for dead transitions found 0 dead transitions in 64620ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64786 ms. Remains : 580/653 places, 1810/1883 transitions.
RANDOM walk for 2089 steps (156 resets) in 29 ms. (69 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 11 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S10J30-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-05 finished in 217701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 75 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-06-01 17:16:30] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-06-01 17:16:30] [INFO ] Computed 82 invariants in 29 ms
[2024-06-01 17:16:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(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 1)
(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 1)
(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 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 7)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 1)
(s112 0)
(s113 2)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 2)
(s140 0)
(s141 0)
(s143 0)
(s144 0)
(s145 1)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(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)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 2)
(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 2)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(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 0)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(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 10)
(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 1)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(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 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 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 1)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 57382ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 57400ms
[2024-06-01 17:17:28] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-06-01 17:17:28] [INFO ] Invariant cache hit.
[2024-06-01 17:17:28] [INFO ] Implicit Places using invariants in 708 ms returned []
[2024-06-01 17:17:28] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-06-01 17:17:28] [INFO ] Invariant cache hit.
[2024-06-01 17:17:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:17:37] [INFO ] Implicit Places using invariants and state equation in 8990 ms returned []
Implicit Place search using SMT with State Equation took 9725 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-06-01 17:17:37] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-06-01 17:17:37] [INFO ] Invariant cache hit.
[2024-06-01 17:17:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/653 variables, 11/82 constraints. Problems are: Problem set: 6 solved, 1922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/2583 variables, and 82 constraints, problems are : Problem set: 6 solved, 1922 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 6 solved, 1922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 6 solved, 1922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 6 solved, 1922 unsolved
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1938 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/653 variables, 11/82 constraints. Problems are: Problem set: 615 solved, 1313 unsolved
[2024-06-01 17:18:51] [INFO ] Deduced a trap composed of 24 places in 436 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/2583 variables, and 83 constraints, problems are : Problem set: 615 solved, 1313 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 994/928 constraints, Known Traps: 1/1 constraints]
After SMT, in 77416ms problems are : Problem set: 615 solved, 1313 unsolved
Search for dead transitions found 615 dead transitions in 77449ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1940 transitions.
Applied a total of 0 rules in 10 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144674 ms. Remains : 653/664 places, 1324/1940 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-06
Product exploration explored 100000 steps with 6957 reset in 520 ms.
Product exploration explored 100000 steps with 6945 reset in 528 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 51 steps (0 resets) in 7 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 17:18:57] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2024-06-01 17:18:57] [INFO ] Computed 82 invariants in 28 ms
[2024-06-01 17:18:57] [INFO ] [Real]Absence check using 62 positive place invariants in 27 ms returned sat
[2024-06-01 17:18:58] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 78 ms returned sat
[2024-06-01 17:18:59] [INFO ] [Real]Absence check using state equation in 1431 ms returned sat
[2024-06-01 17:18:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:19:00] [INFO ] [Nat]Absence check using 62 positive place invariants in 25 ms returned sat
[2024-06-01 17:19:00] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 73 ms returned sat
[2024-06-01 17:19:02] [INFO ] [Nat]Absence check using state equation in 1834 ms returned sat
[2024-06-01 17:19:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:19:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2024-06-01 17:19:02] [INFO ] Computed and/alt/rep : 831/2537/831 causal constraints (skipped 473 transitions) in 177 ms.
[2024-06-01 17:19:02] [INFO ] Added : 14 causal constraints over 3 iterations in 647 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 20 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Running 1313 sub problems to find dead transitions.
[2024-06-01 17:19:02] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-06-01 17:19:02] [INFO ] Invariant cache hit.
[2024-06-01 17:19:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Could not compute solution for formula : PolyORBNT-PT-S10J30-LTLFireability-00
Could not compute solution for formula : PolyORBNT-PT-S10J30-LTLFireability-01
Could not compute solution for formula : PolyORBNT-PT-S10J30-LTLFireability-02
Could not compute solution for formula : PolyORBNT-PT-S10J30-LTLFireability-03
Could not compute solution for formula : PolyORBNT-PT-S10J30-LTLFireability-04
Could not compute solution for formula : PolyORBNT-PT-S10J30-LTLFireability-05
FORMULA PolyORBNT-PT-S10J30-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBNT-PT-S10J30-LTLFireability-08
FORMULA PolyORBNT-PT-S10J30-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBNT-PT-S10J30-LTLFireability-13
FORMULA PolyORBNT-PT-S10J30-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717262847755

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-00
ltl formula formula --ltl=/tmp/2096/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.970 real 0.760 user 0.690 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-01
ltl formula formula --ltl=/tmp/2096/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.480 real 0.650 user 0.400 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_1_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-02
ltl formula formula --ltl=/tmp/2096/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.580 real 0.660 user 0.520 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-03
ltl formula formula --ltl=/tmp/2096/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.790 real 0.620 user 0.460 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_3_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-04
ltl formula formula --ltl=/tmp/2096/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.620 real 0.560 user 0.440 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_4_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-05
ltl formula formula --ltl=/tmp/2096/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_5_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.560 real 0.610 user 0.470 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_5_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_5_
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-06
ltl formula formula --ltl=/tmp/2096/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.490 real 0.780 user 0.720 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12053 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5120
pnml2lts-mc( 0/ 4): unique states count: 5120
pnml2lts-mc( 0/ 4): unique transitions count: 24576
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 19496
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5172
pnml2lts-mc( 0/ 4): - cum. max stack depth: 57
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5172 states 24973 transitions, fanout: 4.828
pnml2lts-mc( 0/ 4): Total exploration time 1.630 sec (1.610 sec minimum, 1.625 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3173, Transitions per second: 15321
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 18.6 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-07
ltl formula formula --ltl=/tmp/2096/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.890 real 0.580 user 0.520 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12063 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~18!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 34
pnml2lts-mc( 0/ 4): unique transitions count: 527
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 37
pnml2lts-mc( 0/ 4): - cum. max stack depth: 37
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 37 states 564 transitions, fanout: 15.243
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.030 sec minimum, 0.035 sec on average)
pnml2lts-mc( 0/ 4): States per second: 925, Transitions per second: 14100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 52.3 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-08
ltl formula formula --ltl=/tmp/2096/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.410 real 0.810 user 0.680 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12064 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~30 levels ~10000 states ~28220 transitions
pnml2lts-mc( 1/ 4): ~30 levels ~20000 states ~52304 transitions
pnml2lts-mc( 1/ 4): ~30 levels ~40000 states ~100608 transitions
pnml2lts-mc( 1/ 4): ~30 levels ~80000 states ~198372 transitions
pnml2lts-mc( 1/ 4): ~30 levels ~160000 states ~413648 transitions
pnml2lts-mc( 0/ 4): ~30 levels ~320000 states ~833604 transitions
pnml2lts-mc( 0/ 4): ~30 levels ~640000 states ~1665328 transitions
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-09
ltl formula formula --ltl=/tmp/2096/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.630 real 0.800 user 0.670 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12053 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~17!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 26
pnml2lts-mc( 0/ 4): unique transitions count: 185
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 29
pnml2lts-mc( 0/ 4): - cum. max stack depth: 29
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 29 states 222 transitions, fanout: 7.655
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.010 sec minimum, 0.018 sec on average)
pnml2lts-mc( 0/ 4): States per second: 967, Transitions per second: 7400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 50.9 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-10
ltl formula formula --ltl=/tmp/2096/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.660 real 0.610 user 0.520 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12055 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~15!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 31
pnml2lts-mc( 0/ 4): unique transitions count: 211
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 34
pnml2lts-mc( 0/ 4): - cum. max stack depth: 34
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 34 states 248 transitions, fanout: 7.294
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.017 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1700, Transitions per second: 12400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 51.5 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-11
ltl formula formula --ltl=/tmp/2096/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_11_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.670 real 0.740 user 0.550 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 700 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12061 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~18!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 42
pnml2lts-mc( 0/ 4): unique transitions count: 255
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 45
pnml2lts-mc( 0/ 4): - cum. max stack depth: 45
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 45 states 292 transitions, fanout: 6.489
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.020 sec minimum, 0.027 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1500, Transitions per second: 9733
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 45.7 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-12
ltl formula formula --ltl=/tmp/2096/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.690 real 0.620 user 0.490 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12055 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~30!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 526
pnml2lts-mc( 0/ 4): unique states count: 585
pnml2lts-mc( 0/ 4): unique transitions count: 2667
pnml2lts-mc( 0/ 4): - self-loop count: 106
pnml2lts-mc( 0/ 4): - claim dead count: 1402
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 589
pnml2lts-mc( 0/ 4): - cum. max stack depth: 81
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 589 states 2714 transitions, fanout: 4.608
pnml2lts-mc( 0/ 4): Total exploration time 0.220 sec (0.210 sec minimum, 0.215 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2677, Transitions per second: 12336
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 37.3 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-13
ltl formula formula --ltl=/tmp/2096/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.400 real 0.650 user 0.520 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 700 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12071 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~30 levels ~10000 states ~28324 transitions
pnml2lts-mc( 1/ 4): ~30 levels ~20000 states ~52580 transitions
pnml2lts-mc( 1/ 4): ~30 levels ~40000 states ~97756 transitions
pnml2lts-mc( 1/ 4): ~30 levels ~80000 states ~201348 transitions
pnml2lts-mc( 1/ 4): ~30 levels ~160000 states ~411516 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~320000 states ~837120 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~640000 states ~1668620 transitions
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-14
ltl formula formula --ltl=/tmp/2096/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.740 real 0.600 user 0.490 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 700 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12054 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~16!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 39
pnml2lts-mc( 0/ 4): unique transitions count: 246
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 42
pnml2lts-mc( 0/ 4): - cum. max stack depth: 42
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 42 states 283 transitions, fanout: 6.738
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2100, Transitions per second: 14150
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 46.2 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-15
ltl formula formula --ltl=/tmp/2096/ltl_15_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.920 real 0.660 user 0.500 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2096/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2096/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2096/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2096/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12054 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~15!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 29
pnml2lts-mc( 0/ 4): unique transitions count: 220
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 32
pnml2lts-mc( 0/ 4): - cum. max stack depth: 32
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32 states 257 transitions, fanout: 8.031
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1600, Transitions per second: 12850
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 47.5 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J30"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S10J30, 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 r516-tajo-171654447200492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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