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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 17K Apr 11 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.5M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717253667630

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:54:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:54:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:54:29] [INFO ] Load time of PNML (sax parser for PT used): 287 ms
[2024-06-01 14:54:29] [INFO ] Transformed 554 places.
[2024-06-01 14:54:29] [INFO ] Transformed 2998 transitions.
[2024-06-01 14:54:29] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 463 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 112 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Applied a total of 4 rules in 97 ms. Remains 550 /554 variables (removed 4) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-06-01 14:54:30] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-06-01 14:54:30] [INFO ] Computed 46 invariants in 74 ms
[2024-06-01 14:54:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 110 places in 339 ms of which 32 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 174 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:54:46] [INFO ] Deduced a trap composed of 145 places in 628 ms of which 30 ms to minimize.
[2024-06-01 14:54:47] [INFO ] Deduced a trap composed of 276 places in 339 ms of which 3 ms to minimize.
[2024-06-01 14:54:47] [INFO ] Deduced a trap composed of 270 places in 532 ms of which 4 ms to minimize.
[2024-06-01 14:54:48] [INFO ] Deduced a trap composed of 274 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:54:48] [INFO ] Deduced a trap composed of 280 places in 241 ms of which 2 ms to minimize.
[2024-06-01 14:54:48] [INFO ] Deduced a trap composed of 274 places in 250 ms of which 4 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 290 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 277 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 290 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 265 places in 276 ms of which 2 ms to minimize.
[2024-06-01 14:54:50] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 264 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 277 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 276 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:54:52] [INFO ] Deduced a trap composed of 89 places in 186 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1898 variables, and 58 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20081 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:55:01] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:55:01] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:55:01] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:55:03] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:55:04] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:55:08] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/1898 variables, and 64 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 23/23 constraints]
After SMT, in 44822ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 44880ms
[2024-06-01 14:55:14] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 14:55:14] [INFO ] Invariant cache hit.
[2024-06-01 14:55:15] [INFO ] Implicit Places using invariants in 370 ms returned [88, 244, 274, 360, 382, 480]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 382 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 544/554 places, 1372/1372 transitions.
Applied a total of 0 rules in 15 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45433 ms. Remains : 544/554 places, 1372/1372 transitions.
Support contains 112 out of 544 places after structural reductions.
[2024-06-01 14:55:15] [INFO ] Flatten gal took : 225 ms
[2024-06-01 14:55:15] [INFO ] Flatten gal took : 85 ms
[2024-06-01 14:55:16] [INFO ] Input system was already deterministic with 1372 transitions.
RANDOM walk for 10475 steps (1 resets) in 344 ms. (30 steps per ms) remains 0/19 properties
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((G(p0)||((F(p1) U p2) U p3)))'
Support contains 52 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 544 transition count 1342
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 514 transition count 1336
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 508 transition count 1336
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 72 place count 508 transition count 1270
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 204 place count 442 transition count 1270
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 240 place count 424 transition count 1252
Applied a total of 240 rules in 330 ms. Remains 424 /544 variables (removed 120) and now considering 1252/1372 (removed 120) transitions.
Running 1248 sub problems to find dead transitions.
[2024-06-01 14:55:16] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
// Phase 1: matrix 1228 rows 424 cols
[2024-06-01 14:55:16] [INFO ] Computed 40 invariants in 25 ms
[2024-06-01 14:55:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 97 places in 212 ms of which 2 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 173 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:55:31] [INFO ] Deduced a trap composed of 188 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:55:31] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 2 ms to minimize.
[2024-06-01 14:55:31] [INFO ] Deduced a trap composed of 171 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:55:31] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:55:33] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 2 ms to minimize.
[2024-06-01 14:55:34] [INFO ] Deduced a trap composed of 70 places in 222 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 44 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 4 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:55:47] [INFO ] Deduced a trap composed of 152 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:55:51] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:55:51] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1248 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 420/1652 variables, and 51 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 16/16 constraints]
After SMT, in 45821ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 45845ms
[2024-06-01 14:56:02] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-06-01 14:56:02] [INFO ] Invariant cache hit.
[2024-06-01 14:56:03] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-06-01 14:56:03] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-06-01 14:56:03] [INFO ] Invariant cache hit.
[2024-06-01 14:56:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:56:10] [INFO ] Implicit Places using invariants and state equation in 7247 ms returned []
Implicit Place search using SMT with State Equation took 7991 ms to find 0 implicit places.
[2024-06-01 14:56:10] [INFO ] Redundant transitions in 76 ms returned []
Running 1248 sub problems to find dead transitions.
[2024-06-01 14:56:10] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-06-01 14:56:10] [INFO ] Invariant cache hit.
[2024-06-01 14:56:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 116 places in 236 ms of which 3 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 97 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:56:23] [INFO ] Deduced a trap composed of 179 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:56:23] [INFO ] Deduced a trap composed of 175 places in 168 ms of which 1 ms to minimize.
[2024-06-01 14:56:23] [INFO ] Deduced a trap composed of 168 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 68 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 165 places in 231 ms of which 2 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 1 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-06-01 14:56:26] [INFO ] Deduced a trap composed of 157 places in 186 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 50 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 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 TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD927 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/424 variables, 5/55 constraints. Problems are: Problem set: 324 solved, 924 unsolved
[2024-06-01 14:57:10] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:57:10] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 15 ms to minimize.
[2024-06-01 14:57:10] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:57:10] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 0 ms to minimize.
[2024-06-01 14:57:10] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 0 ms to minimize.
[2024-06-01 14:57:10] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:57:14] [INFO ] Deduced a trap composed of 258 places in 310 ms of which 3 ms to minimize.
[2024-06-01 14:57:14] [INFO ] Deduced a trap composed of 177 places in 282 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/1652 variables, and 63 constraints, problems are : Problem set: 324 solved, 924 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 23/23 constraints]
After SMT, in 64408ms problems are : Problem set: 324 solved, 924 unsolved
Search for dead transitions found 324 dead transitions in 64425ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) removed 324 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 424/544 places, 928/1372 transitions.
Applied a total of 0 rules in 54 ms. Remains 424 /424 variables (removed 0) and now considering 928/928 (removed 0) transitions.
[2024-06-01 14:57:15] [INFO ] Redundant transitions in 59 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 118818 ms. Remains : 424/544 places, 928/1372 transitions.
Stuttering acceptance computed with spot in 501 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-00
Product exploration explored 100000 steps with 1361 reset in 632 ms.
Product exploration explored 100000 steps with 1356 reset in 437 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 (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (AND p0 (NOT p3) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X (AND p0 (NOT p3)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 164 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 371 steps (0 resets) in 48 ms. (7 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (AND p0 (NOT p3) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X (AND p0 (NOT p3)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p3) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p3))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 p3))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p1), (F p3), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2 p3 p1))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 39 factoid took 888 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 52 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 928/928 transitions.
Applied a total of 0 rules in 27 ms. Remains 424 /424 variables (removed 0) and now considering 928/928 (removed 0) transitions.
Running 924 sub problems to find dead transitions.
[2024-06-01 14:57:19] [INFO ] Flow matrix only has 904 transitions (discarded 24 similar events)
// Phase 1: matrix 904 rows 424 cols
[2024-06-01 14:57:19] [INFO ] Computed 40 invariants in 18 ms
[2024-06-01 14:57:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:57:26] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:57:26] [INFO ] Deduced a trap composed of 172 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:57:26] [INFO ] Deduced a trap composed of 102 places in 212 ms of which 4 ms to minimize.
[2024-06-01 14:57:26] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:57:27] [INFO ] Deduced a trap composed of 181 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:57:27] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:57:28] [INFO ] Deduced a trap composed of 168 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:57:28] [INFO ] Deduced a trap composed of 163 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 233 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 208 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 238 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 232 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:57:31] [INFO ] Deduced a trap composed of 251 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:57:31] [INFO ] Deduced a trap composed of 205 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 14:57:33] [INFO ] Deduced a trap composed of 218 places in 221 ms of which 2 ms to minimize.
[2024-06-01 14:57:33] [INFO ] Deduced a trap composed of 228 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:57:33] [INFO ] Deduced a trap composed of 224 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:57:33] [INFO ] Deduced a trap composed of 230 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:57:33] [INFO ] Deduced a trap composed of 242 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:57:34] [INFO ] Deduced a trap composed of 222 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:57:34] [INFO ] Deduced a trap composed of 242 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:57:34] [INFO ] Deduced a trap composed of 264 places in 238 ms of which 5 ms to minimize.
[2024-06-01 14:57:34] [INFO ] Deduced a trap composed of 248 places in 187 ms of which 4 ms to minimize.
[2024-06-01 14:57:34] [INFO ] Deduced a trap composed of 236 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:57:35] [INFO ] Deduced a trap composed of 221 places in 160 ms of which 3 ms to minimize.
[2024-06-01 14:57:35] [INFO ] Deduced a trap composed of 285 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:57:36] [INFO ] Deduced a trap composed of 216 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:57:36] [INFO ] Deduced a trap composed of 204 places in 153 ms of which 3 ms to minimize.
[2024-06-01 14:57:36] [INFO ] Deduced a trap composed of 248 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:57:37] [INFO ] Deduced a trap composed of 227 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:57:37] [INFO ] Deduced a trap composed of 229 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:57:37] [INFO ] Deduced a trap composed of 194 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 114 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 227 places in 277 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 924 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1328 variables, and 75 constraints, problems are : Problem set: 0 solved, 924 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 924/924 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 924 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 40/75 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 14:57:47] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-01 14:57:47] [INFO ] Deduced a trap composed of 213 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:57:47] [INFO ] Deduced a trap composed of 202 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 239 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 209 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:57:49] [INFO ] Deduced a trap composed of 238 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:57:49] [INFO ] Deduced a trap composed of 232 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:57:49] [INFO ] Deduced a trap composed of 216 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:57:49] [INFO ] Deduced a trap composed of 229 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:57:50] [INFO ] Deduced a trap composed of 241 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:57:50] [INFO ] Deduced a trap composed of 234 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:57:50] [INFO ] Deduced a trap composed of 238 places in 217 ms of which 2 ms to minimize.
[2024-06-01 14:57:50] [INFO ] Deduced a trap composed of 243 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:57:50] [INFO ] Deduced a trap composed of 239 places in 235 ms of which 4 ms to minimize.
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 229 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 246 places in 219 ms of which 2 ms to minimize.
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 209 places in 238 ms of which 5 ms to minimize.
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 237 places in 204 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 14:57:59] [INFO ] Deduced a trap composed of 218 places in 277 ms of which 5 ms to minimize.
[2024-06-01 14:58:00] [INFO ] Deduced a trap composed of 243 places in 241 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1328 variables, and 97 constraints, problems are : Problem set: 0 solved, 924 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/924 constraints, Known Traps: 62/62 constraints]
After SMT, in 41299ms problems are : Problem set: 0 solved, 924 unsolved
Search for dead transitions found 0 dead transitions in 41312ms
[2024-06-01 14:58:00] [INFO ] Flow matrix only has 904 transitions (discarded 24 similar events)
[2024-06-01 14:58:00] [INFO ] Invariant cache hit.
[2024-06-01 14:58:00] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-06-01 14:58:00] [INFO ] Flow matrix only has 904 transitions (discarded 24 similar events)
[2024-06-01 14:58:00] [INFO ] Invariant cache hit.
[2024-06-01 14:58:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:58:24] [INFO ] Implicit Places using invariants and state equation in 23958 ms returned []
Implicit Place search using SMT with State Equation took 24438 ms to find 0 implicit places.
[2024-06-01 14:58:24] [INFO ] Redundant transitions in 38 ms returned []
Running 924 sub problems to find dead transitions.
[2024-06-01 14:58:24] [INFO ] Flow matrix only has 904 transitions (discarded 24 similar events)
[2024-06-01 14:58:24] [INFO ] Invariant cache hit.
[2024-06-01 14:58:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 3 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 195 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 196 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:58:32] [INFO ] Deduced a trap composed of 179 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:58:32] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:58:32] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 2 ms to minimize.
[2024-06-01 14:58:32] [INFO ] Deduced a trap composed of 160 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:58:33] [INFO ] Deduced a trap composed of 187 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:58:33] [INFO ] Deduced a trap composed of 188 places in 216 ms of which 3 ms to minimize.
[2024-06-01 14:58:34] [INFO ] Deduced a trap composed of 74 places in 230 ms of which 4 ms to minimize.
[2024-06-01 14:58:34] [INFO ] Deduced a trap composed of 126 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:58:34] [INFO ] Deduced a trap composed of 99 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:58:35] [INFO ] Deduced a trap composed of 185 places in 252 ms of which 7 ms to minimize.
[2024-06-01 14:58:35] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 14:58:37] [INFO ] Deduced a trap composed of 114 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:58:37] [INFO ] Deduced a trap composed of 187 places in 259 ms of which 4 ms to minimize.
[2024-06-01 14:58:38] [INFO ] Deduced a trap composed of 201 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 174 places in 249 ms of which 4 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 224 places in 227 ms of which 3 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 240 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 182 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:58:41] [INFO ] Deduced a trap composed of 223 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:58:41] [INFO ] Deduced a trap composed of 192 places in 201 ms of which 4 ms to minimize.
[2024-06-01 14:58:41] [INFO ] Deduced a trap composed of 180 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:58:42] [INFO ] Deduced a trap composed of 195 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:58:42] [INFO ] Deduced a trap composed of 203 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:58:44] [INFO ] Deduced a trap composed of 168 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:58:46] [INFO ] Deduced a trap composed of 266 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:58:46] [INFO ] Deduced a trap composed of 234 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:58:46] [INFO ] Deduced a trap composed of 242 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:58:47] [INFO ] Deduced a trap composed of 175 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:58:48] [INFO ] Deduced a trap composed of 233 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:58:48] [INFO ] Deduced a trap composed of 225 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:58:48] [INFO ] Deduced a trap composed of 231 places in 183 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 924 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1328 variables, and 75 constraints, problems are : Problem set: 0 solved, 924 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 924/924 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 924 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 40/75 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 14:59:01] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 209 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 217 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:59:03] [INFO ] Deduced a trap composed of 195 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:59:03] [INFO ] Deduced a trap composed of 233 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:59:03] [INFO ] Deduced a trap composed of 233 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 222 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 246 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 222 places in 189 ms of which 3 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 224 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 216 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 195 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 225 places in 218 ms of which 3 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 214 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 180 places in 216 ms of which 4 ms to minimize.
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 238 places in 218 ms of which 3 ms to minimize.
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 205 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 192 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 291 places in 237 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 14:59:13] [INFO ] Deduced a trap composed of 227 places in 283 ms of which 3 ms to minimize.
[2024-06-01 14:59:13] [INFO ] Deduced a trap composed of 205 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:59:13] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:59:13] [INFO ] Deduced a trap composed of 243 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:59:14] [INFO ] Deduced a trap composed of 205 places in 256 ms of which 4 ms to minimize.
[2024-06-01 14:59:14] [INFO ] Deduced a trap composed of 232 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:59:14] [INFO ] Deduced a trap composed of 213 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:59:14] [INFO ] Deduced a trap composed of 212 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:59:15] [INFO ] Deduced a trap composed of 219 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:59:15] [INFO ] Deduced a trap composed of 223 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:59:15] [INFO ] Deduced a trap composed of 208 places in 236 ms of which 3 ms to minimize.
[2024-06-01 14:59:15] [INFO ] Deduced a trap composed of 215 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 200 places in 226 ms of which 2 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 213 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 193 places in 216 ms of which 5 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 209 places in 252 ms of which 4 ms to minimize.
[2024-06-01 14:59:17] [INFO ] Deduced a trap composed of 210 places in 218 ms of which 4 ms to minimize.
[2024-06-01 14:59:17] [INFO ] Deduced a trap composed of 193 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:59:17] [INFO ] Deduced a trap composed of 197 places in 182 ms of which 3 ms to minimize.
[2024-06-01 14:59:17] [INFO ] Deduced a trap composed of 214 places in 236 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 14:59:25] [INFO ] Deduced a trap composed of 195 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:59:25] [INFO ] Deduced a trap composed of 204 places in 333 ms of which 3 ms to minimize.
SMT process timed out in 61076ms, After SMT, problems are : Problem set: 0 solved, 924 unsolved
Search for dead transitions found 0 dead transitions in 61092ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 126924 ms. Remains : 424/424 places, 928/928 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (AND p0 (NOT p2) (NOT p3))), (X (AND (NOT p2) (NOT p3) (NOT p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p2) (NOT p3) (NOT p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (AND (NOT p2) (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X (AND p0 (NOT p3)))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 194 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 353 steps (0 resets) in 28 ms. (12 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (AND p0 (NOT p2) (NOT p3))), (X (AND (NOT p2) (NOT p3) (NOT p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p2) (NOT p3) (NOT p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (AND (NOT p2) (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X (AND p0 (NOT p3)))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (F (NOT (OR p0 p2 p1 p3))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p1), (F p3), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p2 p3)))]
Knowledge based reduction with 39 factoid took 872 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1359 reset in 628 ms.
Product exploration explored 100000 steps with 1357 reset in 519 ms.
Support contains 52 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 928/928 transitions.
Applied a total of 0 rules in 20 ms. Remains 424 /424 variables (removed 0) and now considering 928/928 (removed 0) transitions.
Running 924 sub problems to find dead transitions.
[2024-06-01 14:59:29] [INFO ] Flow matrix only has 904 transitions (discarded 24 similar events)
[2024-06-01 14:59:29] [INFO ] Invariant cache hit.
[2024-06-01 14:59:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 14:59:36] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:59:36] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-06-01 14:59:36] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:59:36] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:59:36] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:59:36] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:59:37] [INFO ] Deduced a trap composed of 195 places in 207 ms of which 4 ms to minimize.
[2024-06-01 14:59:37] [INFO ] Deduced a trap composed of 196 places in 164 ms of which 3 ms to minimize.
[2024-06-01 14:59:37] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:59:37] [INFO ] Deduced a trap composed of 179 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:59:37] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:59:38] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 2 ms to minimize.
[2024-06-01 14:59:38] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:59:38] [INFO ] Deduced a trap composed of 187 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:59:39] [INFO ] Deduced a trap composed of 188 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:59:39] [INFO ] Deduced a trap composed of 74 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:59:39] [INFO ] Deduced a trap composed of 126 places in 237 ms of which 4 ms to minimize.
[2024-06-01 14:59:40] [INFO ] Deduced a trap composed of 99 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:59:41] [INFO ] Deduced a trap composed of 185 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:59:41] [INFO ] Deduced a trap composed of 230 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 14:59:42] [INFO ] Deduced a trap composed of 114 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:59:42] [INFO ] Deduced a trap composed of 187 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:59:43] [INFO ] Deduced a trap composed of 201 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:59:43] [INFO ] Deduced a trap composed of 174 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 224 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 240 places in 218 ms of which 5 ms to minimize.
[2024-06-01 14:59:45] [INFO ] Deduced a trap composed of 182 places in 155 ms of which 3 ms to minimize.
[2024-06-01 14:59:45] [INFO ] Deduced a trap composed of 223 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:59:45] [INFO ] Deduced a trap composed of 192 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:59:45] [INFO ] Deduced a trap composed of 180 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:59:46] [INFO ] Deduced a trap composed of 195 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:59:46] [INFO ] Deduced a trap composed of 203 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:59:47] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:59:49] [INFO ] Deduced a trap composed of 266 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:59:50] [INFO ] Deduced a trap composed of 234 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:59:50] [INFO ] Deduced a trap composed of 242 places in 188 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1328 variables, and 71 constraints, problems are : Problem set: 0 solved, 924 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 924/924 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 924 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 36/71 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 14:59:55] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:59:56] [INFO ] Deduced a trap composed of 199 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:59:56] [INFO ] Deduced a trap composed of 209 places in 204 ms of which 2 ms to minimize.
[2024-06-01 14:59:56] [INFO ] Deduced a trap composed of 207 places in 224 ms of which 2 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 217 places in 204 ms of which 2 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 209 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 219 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 277 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 257 places in 172 ms of which 3 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 220 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 256 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 232 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 211 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 195 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:59:59] [INFO ] Deduced a trap composed of 232 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:59:59] [INFO ] Deduced a trap composed of 195 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:59:59] [INFO ] Deduced a trap composed of 196 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:59:59] [INFO ] Deduced a trap composed of 194 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:59:59] [INFO ] Deduced a trap composed of 198 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:00:00] [INFO ] Deduced a trap composed of 199 places in 203 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 238 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 233 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 248 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 240 places in 243 ms of which 3 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 252 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 247 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 248 places in 231 ms of which 2 ms to minimize.
[2024-06-01 15:00:09] [INFO ] Deduced a trap composed of 261 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:00:09] [INFO ] Deduced a trap composed of 222 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:00:09] [INFO ] Deduced a trap composed of 147 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:00:09] [INFO ] Deduced a trap composed of 138 places in 240 ms of which 3 ms to minimize.
[2024-06-01 15:00:10] [INFO ] Deduced a trap composed of 173 places in 263 ms of which 3 ms to minimize.
[2024-06-01 15:00:10] [INFO ] Deduced a trap composed of 200 places in 246 ms of which 3 ms to minimize.
SMT process timed out in 41317ms, After SMT, problems are : Problem set: 0 solved, 924 unsolved
Search for dead transitions found 0 dead transitions in 41329ms
[2024-06-01 15:00:10] [INFO ] Flow matrix only has 904 transitions (discarded 24 similar events)
[2024-06-01 15:00:10] [INFO ] Invariant cache hit.
[2024-06-01 15:00:11] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-06-01 15:00:11] [INFO ] Flow matrix only has 904 transitions (discarded 24 similar events)
[2024-06-01 15:00:11] [INFO ] Invariant cache hit.
[2024-06-01 15:00:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:00:52] [INFO ] Performed 328/424 implicitness test of which 0 returned IMPLICIT in 40 seconds.
[2024-06-01 15:00:54] [INFO ] Implicit Places using invariants and state equation in 43438 ms returned []
Implicit Place search using SMT with State Equation took 43826 ms to find 0 implicit places.
[2024-06-01 15:00:54] [INFO ] Redundant transitions in 29 ms returned []
Running 924 sub problems to find dead transitions.
[2024-06-01 15:00:54] [INFO ] Flow matrix only has 904 transitions (discarded 24 similar events)
[2024-06-01 15:00:54] [INFO ] Invariant cache hit.
[2024-06-01 15:00:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 15:01:00] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:01:00] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:01:01] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 0 ms to minimize.
[2024-06-01 15:01:01] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:01:01] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 0 ms to minimize.
[2024-06-01 15:01:01] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:01:01] [INFO ] Deduced a trap composed of 195 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:01:01] [INFO ] Deduced a trap composed of 196 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:01:01] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:01:02] [INFO ] Deduced a trap composed of 179 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:01:02] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2024-06-01 15:01:02] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:01:02] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:01:02] [INFO ] Deduced a trap composed of 187 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 188 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 126 places in 204 ms of which 3 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 99 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:01:04] [INFO ] Deduced a trap composed of 185 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:01:04] [INFO ] Deduced a trap composed of 230 places in 179 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 15:01:06] [INFO ] Deduced a trap composed of 114 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:01:06] [INFO ] Deduced a trap composed of 187 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:01:07] [INFO ] Deduced a trap composed of 201 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:01:07] [INFO ] Deduced a trap composed of 174 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:01:08] [INFO ] Deduced a trap composed of 224 places in 235 ms of which 4 ms to minimize.
[2024-06-01 15:01:08] [INFO ] Deduced a trap composed of 240 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:01:09] [INFO ] Deduced a trap composed of 182 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:01:09] [INFO ] Deduced a trap composed of 223 places in 217 ms of which 3 ms to minimize.
[2024-06-01 15:01:09] [INFO ] Deduced a trap composed of 192 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:01:10] [INFO ] Deduced a trap composed of 180 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:01:11] [INFO ] Deduced a trap composed of 195 places in 226 ms of which 2 ms to minimize.
[2024-06-01 15:01:11] [INFO ] Deduced a trap composed of 203 places in 219 ms of which 3 ms to minimize.
[2024-06-01 15:01:12] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:01:14] [INFO ] Deduced a trap composed of 266 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:01:15] [INFO ] Deduced a trap composed of 234 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:01:15] [INFO ] Deduced a trap composed of 242 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:01:15] [INFO ] Deduced a trap composed of 175 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:01:16] [INFO ] Deduced a trap composed of 233 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:01:16] [INFO ] Deduced a trap composed of 225 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:01:16] [INFO ] Deduced a trap composed of 231 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 924 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1328 variables, and 75 constraints, problems are : Problem set: 0 solved, 924 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 924/924 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 924 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 40/75 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 15:01:31] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:01:32] [INFO ] Deduced a trap composed of 209 places in 210 ms of which 2 ms to minimize.
[2024-06-01 15:01:32] [INFO ] Deduced a trap composed of 217 places in 203 ms of which 2 ms to minimize.
[2024-06-01 15:01:33] [INFO ] Deduced a trap composed of 195 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:01:33] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 2 ms to minimize.
[2024-06-01 15:01:33] [INFO ] Deduced a trap composed of 233 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:01:33] [INFO ] Deduced a trap composed of 222 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:01:33] [INFO ] Deduced a trap composed of 246 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:01:34] [INFO ] Deduced a trap composed of 222 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:01:34] [INFO ] Deduced a trap composed of 224 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:01:34] [INFO ] Deduced a trap composed of 216 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:01:34] [INFO ] Deduced a trap composed of 195 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:01:34] [INFO ] Deduced a trap composed of 224 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:01:35] [INFO ] Deduced a trap composed of 225 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:01:35] [INFO ] Deduced a trap composed of 214 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:01:35] [INFO ] Deduced a trap composed of 180 places in 222 ms of which 2 ms to minimize.
[2024-06-01 15:01:35] [INFO ] Deduced a trap composed of 238 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:01:36] [INFO ] Deduced a trap composed of 205 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:01:36] [INFO ] Deduced a trap composed of 192 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:01:36] [INFO ] Deduced a trap composed of 291 places in 185 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 15:01:42] [INFO ] Deduced a trap composed of 227 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:01:43] [INFO ] Deduced a trap composed of 205 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:01:43] [INFO ] Deduced a trap composed of 228 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:01:43] [INFO ] Deduced a trap composed of 243 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:01:43] [INFO ] Deduced a trap composed of 205 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:01:43] [INFO ] Deduced a trap composed of 232 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 213 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 212 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 219 places in 199 ms of which 3 ms to minimize.
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 223 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 208 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 215 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 200 places in 195 ms of which 3 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 213 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 193 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:01:46] [INFO ] Deduced a trap composed of 209 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:01:46] [INFO ] Deduced a trap composed of 210 places in 227 ms of which 2 ms to minimize.
[2024-06-01 15:01:46] [INFO ] Deduced a trap composed of 193 places in 207 ms of which 3 ms to minimize.
[2024-06-01 15:01:46] [INFO ] Deduced a trap composed of 197 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:01:47] [INFO ] Deduced a trap composed of 214 places in 197 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-06-01 15:01:54] [INFO ] Deduced a trap composed of 195 places in 275 ms of which 3 ms to minimize.
[2024-06-01 15:01:55] [INFO ] Deduced a trap composed of 204 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:01:55] [INFO ] Deduced a trap composed of 192 places in 354 ms of which 2 ms to minimize.
[2024-06-01 15:01:55] [INFO ] Deduced a trap composed of 202 places in 208 ms of which 3 ms to minimize.
SMT process timed out in 61050ms, After SMT, problems are : Problem set: 0 solved, 924 unsolved
Search for dead transitions found 0 dead transitions in 61064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 146289 ms. Remains : 424/424 places, 928/928 transitions.
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-00 finished in 399352 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 12 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 544 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 490 transition count 1258
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 430 transition count 1258
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 230 place count 428 transition count 1256
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 428 transition count 1256
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 352 place count 368 transition count 1196
Applied a total of 352 rules in 101 ms. Remains 368 /544 variables (removed 176) and now considering 1196/1372 (removed 176) transitions.
Running 1192 sub problems to find dead transitions.
[2024-06-01 15:01:55] [INFO ] Flow matrix only has 1172 transitions (discarded 24 similar events)
// Phase 1: matrix 1172 rows 368 cols
[2024-06-01 15:01:56] [INFO ] Computed 40 invariants in 32 ms
[2024-06-01 15:01:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 15:02:08] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-06-01 15:02:08] [INFO ] Deduced a trap composed of 56 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:02:08] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2024-06-01 15:02:16] [INFO ] Deduced a trap composed of 133 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:02:16] [INFO ] Deduced a trap composed of 121 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:02:16] [INFO ] Deduced a trap composed of 120 places in 170 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1192 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 364/1540 variables, and 40 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 22/28 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1192/1192 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 15:02:24] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 2 ms to minimize.
[2024-06-01 15:02:24] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2024-06-01 15:02:24] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 15:02:34] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2024-06-01 15:02:37] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1540 variables, and 45 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 22/28 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1192 constraints, Known Traps: 11/11 constraints]
After SMT, in 45682ms problems are : Problem set: 0 solved, 1192 unsolved
Search for dead transitions found 0 dead transitions in 45694ms
[2024-06-01 15:02:41] [INFO ] Flow matrix only has 1172 transitions (discarded 24 similar events)
[2024-06-01 15:02:41] [INFO ] Invariant cache hit.
[2024-06-01 15:02:41] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-06-01 15:02:42] [INFO ] Flow matrix only has 1172 transitions (discarded 24 similar events)
[2024-06-01 15:02:42] [INFO ] Invariant cache hit.
[2024-06-01 15:02:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:02:48] [INFO ] Implicit Places using invariants and state equation in 6862 ms returned []
Implicit Place search using SMT with State Equation took 7197 ms to find 0 implicit places.
[2024-06-01 15:02:48] [INFO ] Redundant transitions in 48 ms returned []
Running 1192 sub problems to find dead transitions.
[2024-06-01 15:02:48] [INFO ] Flow matrix only has 1172 transitions (discarded 24 similar events)
[2024-06-01 15:02:48] [INFO ] Invariant cache hit.
[2024-06-01 15:02:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 15:03:01] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:03:01] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 1 ms to minimize.
[2024-06-01 15:03:02] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:03:07] [INFO ] Deduced a trap composed of 120 places in 157 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 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 TDEAD772 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/368 variables, 6/44 constraints. Problems are: Problem set: 324 solved, 868 unsolved
[2024-06-01 15:03:24] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:03:24] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:03:24] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:03:24] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:03:24] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:03:24] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/1540 variables, and 50 constraints, problems are : Problem set: 324 solved, 868 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1192/1192 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 324 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 324 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 22/34 constraints. Problems are: Problem set: 324 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 10/44 constraints. Problems are: Problem set: 324 solved, 868 unsolved
[2024-06-01 15:03:28] [INFO ] Deduced a trap composed of 171 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:03:28] [INFO ] Deduced a trap composed of 169 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:03:28] [INFO ] Deduced a trap composed of 169 places in 246 ms of which 2 ms to minimize.
[2024-06-01 15:03:28] [INFO ] Deduced a trap composed of 167 places in 209 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 4/48 constraints. Problems are: Problem set: 324 solved, 868 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/48 constraints. Problems are: Problem set: 324 solved, 868 unsolved
At refinement iteration 5 (OVERLAPS) 4/368 variables, 6/54 constraints. Problems are: Problem set: 324 solved, 868 unsolved
[2024-06-01 15:03:49] [INFO ] Deduced a trap composed of 159 places in 262 ms of which 2 ms to minimize.
[2024-06-01 15:03:52] [INFO ] Deduced a trap composed of 207 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:03:52] [INFO ] Deduced a trap composed of 125 places in 254 ms of which 3 ms to minimize.
[2024-06-01 15:03:52] [INFO ] Deduced a trap composed of 178 places in 290 ms of which 3 ms to minimize.
[2024-06-01 15:03:53] [INFO ] Deduced a trap composed of 187 places in 276 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 368/1540 variables, and 59 constraints, problems are : Problem set: 324 solved, 868 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1192 constraints, Known Traps: 19/19 constraints]
After SMT, in 65850ms problems are : Problem set: 324 solved, 868 unsolved
Search for dead transitions found 324 dead transitions in 65867ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) removed 324 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 368/544 places, 872/1372 transitions.
Applied a total of 0 rules in 37 ms. Remains 368 /368 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-06-01 15:03:54] [INFO ] Redundant transitions in 19 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 118990 ms. Remains : 368/544 places, 872/1372 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-02
Product exploration explored 100000 steps with 3068 reset in 516 ms.
Product exploration explored 100000 steps with 3084 reset in 741 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 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 124 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 122 steps (0 resets) in 8 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:03:56] [INFO ] Flow matrix only has 848 transitions (discarded 24 similar events)
// Phase 1: matrix 848 rows 368 cols
[2024-06-01 15:03:56] [INFO ] Computed 40 invariants in 31 ms
[2024-06-01 15:03:57] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 15:03:57] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 133 ms returned sat
[2024-06-01 15:03:58] [INFO ] [Real]Absence check using state equation in 1322 ms returned sat
[2024-06-01 15:03:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:03:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 15:03:59] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 46 ms returned sat
[2024-06-01 15:04:00] [INFO ] [Nat]Absence check using state equation in 1602 ms returned sat
[2024-06-01 15:04:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:04:01] [INFO ] [Nat]Added 120 Read/Feed constraints in 656 ms returned sat
[2024-06-01 15:04:01] [INFO ] Deduced a trap composed of 133 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:04:02] [INFO ] Deduced a trap composed of 138 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:04:02] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:04:03] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 2 ms to minimize.
[2024-06-01 15:04:03] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:04:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2436 ms
[2024-06-01 15:04:04] [INFO ] Computed and/alt/rep : 574/3335/556 causal constraints (skipped 288 transitions) in 97 ms.
[2024-06-01 15:04:12] [INFO ] Added : 394 causal constraints over 79 iterations in 8364 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 368/368 places, 872/872 transitions.
Applied a total of 0 rules in 38 ms. Remains 368 /368 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Running 868 sub problems to find dead transitions.
[2024-06-01 15:04:12] [INFO ] Flow matrix only has 848 transitions (discarded 24 similar events)
[2024-06-01 15:04:12] [INFO ] Invariant cache hit.
[2024-06-01 15:04:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:04:18] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 1 ms to minimize.
[2024-06-01 15:04:18] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:04:18] [INFO ] Deduced a trap composed of 184 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:04:18] [INFO ] Deduced a trap composed of 182 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:04:19] [INFO ] Deduced a trap composed of 200 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:04:19] [INFO ] Deduced a trap composed of 179 places in 402 ms of which 1 ms to minimize.
[2024-06-01 15:04:20] [INFO ] Deduced a trap composed of 167 places in 789 ms of which 2 ms to minimize.
[2024-06-01 15:04:20] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:04:20] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 4 ms to minimize.
[2024-06-01 15:04:20] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 120 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 155 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:04:22] [INFO ] Deduced a trap composed of 204 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:04:22] [INFO ] Deduced a trap composed of 148 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:04:22] [INFO ] Deduced a trap composed of 188 places in 155 ms of which 1 ms to minimize.
[2024-06-01 15:04:22] [INFO ] Deduced a trap composed of 179 places in 139 ms of which 1 ms to minimize.
[2024-06-01 15:04:22] [INFO ] Deduced a trap composed of 197 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:04:22] [INFO ] Deduced a trap composed of 175 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 173 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 184 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 158 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 172 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:04:25] [INFO ] Deduced a trap composed of 186 places in 139 ms of which 1 ms to minimize.
[2024-06-01 15:04:25] [INFO ] Deduced a trap composed of 185 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:04:25] [INFO ] Deduced a trap composed of 151 places in 127 ms of which 1 ms to minimize.
[2024-06-01 15:04:25] [INFO ] Deduced a trap composed of 166 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:04:25] [INFO ] Deduced a trap composed of 180 places in 158 ms of which 1 ms to minimize.
[2024-06-01 15:04:25] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:04:25] [INFO ] Deduced a trap composed of 149 places in 147 ms of which 1 ms to minimize.
[2024-06-01 15:04:26] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 1 ms to minimize.
[2024-06-01 15:04:26] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 1 ms to minimize.
[2024-06-01 15:04:26] [INFO ] Deduced a trap composed of 180 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:04:27] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:04:27] [INFO ] Deduced a trap composed of 104 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:04:28] [INFO ] Deduced a trap composed of 170 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:04:28] [INFO ] Deduced a trap composed of 181 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:04:28] [INFO ] Deduced a trap composed of 152 places in 163 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1216 variables, and 74 constraints, problems are : Problem set: 0 solved, 868 unsolved in 20165 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 24/29 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 40/74 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 171 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 152 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 199 places in 211 ms of which 2 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 163 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 184 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 170 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 187 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 188 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:04:40] [INFO ] Deduced a trap composed of 189 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:04:40] [INFO ] Deduced a trap composed of 181 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:04:40] [INFO ] Deduced a trap composed of 180 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:04:40] [INFO ] Deduced a trap composed of 195 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:04:40] [INFO ] Deduced a trap composed of 188 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:04:40] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:04:40] [INFO ] Deduced a trap composed of 177 places in 132 ms of which 1 ms to minimize.
[2024-06-01 15:04:41] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 1 ms to minimize.
[2024-06-01 15:04:41] [INFO ] Deduced a trap composed of 176 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:04:41] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:04:41] [INFO ] Deduced a trap composed of 175 places in 160 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:04:44] [INFO ] Deduced a trap composed of 153 places in 149 ms of which 1 ms to minimize.
[2024-06-01 15:04:44] [INFO ] Deduced a trap composed of 165 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:04:45] [INFO ] Deduced a trap composed of 159 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:04:45] [INFO ] Deduced a trap composed of 139 places in 233 ms of which 3 ms to minimize.
[2024-06-01 15:04:45] [INFO ] Deduced a trap composed of 206 places in 157 ms of which 6 ms to minimize.
[2024-06-01 15:04:45] [INFO ] Deduced a trap composed of 174 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:04:46] [INFO ] Deduced a trap composed of 177 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:04:46] [INFO ] Deduced a trap composed of 185 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:04:46] [INFO ] Deduced a trap composed of 196 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:04:46] [INFO ] Deduced a trap composed of 184 places in 214 ms of which 2 ms to minimize.
[2024-06-01 15:04:46] [INFO ] Deduced a trap composed of 182 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:04:47] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 1 ms to minimize.
[2024-06-01 15:04:47] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 3 ms to minimize.
[2024-06-01 15:04:47] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 1 ms to minimize.
[2024-06-01 15:04:47] [INFO ] Deduced a trap composed of 46 places in 224 ms of which 4 ms to minimize.
[2024-06-01 15:04:47] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:04:48] [INFO ] Deduced a trap composed of 154 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:04:48] [INFO ] Deduced a trap composed of 195 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:04:48] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 3 ms to minimize.
[2024-06-01 15:04:48] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1216 variables, and 114 constraints, problems are : Problem set: 0 solved, 868 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 24/29 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 80/80 constraints]
After SMT, in 41413ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 41429ms
[2024-06-01 15:04:53] [INFO ] Flow matrix only has 848 transitions (discarded 24 similar events)
[2024-06-01 15:04:53] [INFO ] Invariant cache hit.
[2024-06-01 15:04:54] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-06-01 15:04:54] [INFO ] Flow matrix only has 848 transitions (discarded 24 similar events)
[2024-06-01 15:04:54] [INFO ] Invariant cache hit.
[2024-06-01 15:04:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:05:00] [INFO ] Implicit Places using invariants and state equation in 6494 ms returned []
Implicit Place search using SMT with State Equation took 6966 ms to find 0 implicit places.
[2024-06-01 15:05:00] [INFO ] Redundant transitions in 9 ms returned []
Running 868 sub problems to find dead transitions.
[2024-06-01 15:05:00] [INFO ] Flow matrix only has 848 transitions (discarded 24 similar events)
[2024-06-01 15:05:00] [INFO ] Invariant cache hit.
[2024-06-01 15:05:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:05:06] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:05:06] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:05:06] [INFO ] Deduced a trap composed of 184 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:05:07] [INFO ] Deduced a trap composed of 182 places in 137 ms of which 1 ms to minimize.
[2024-06-01 15:05:07] [INFO ] Deduced a trap composed of 200 places in 137 ms of which 1 ms to minimize.
[2024-06-01 15:05:07] [INFO ] Deduced a trap composed of 179 places in 137 ms of which 1 ms to minimize.
[2024-06-01 15:05:07] [INFO ] Deduced a trap composed of 167 places in 132 ms of which 1 ms to minimize.
[2024-06-01 15:05:07] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:05:07] [INFO ] Deduced a trap composed of 164 places in 131 ms of which 1 ms to minimize.
[2024-06-01 15:05:07] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:05:08] [INFO ] Deduced a trap composed of 119 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:05:08] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:05:08] [INFO ] Deduced a trap composed of 120 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:05:08] [INFO ] Deduced a trap composed of 155 places in 131 ms of which 1 ms to minimize.
[2024-06-01 15:05:08] [INFO ] Deduced a trap composed of 204 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:05:09] [INFO ] Deduced a trap composed of 148 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:05:09] [INFO ] Deduced a trap composed of 188 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:05:09] [INFO ] Deduced a trap composed of 179 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:05:09] [INFO ] Deduced a trap composed of 197 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:05:09] [INFO ] Deduced a trap composed of 175 places in 143 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:05:10] [INFO ] Deduced a trap composed of 173 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:05:10] [INFO ] Deduced a trap composed of 184 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:05:11] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 1 ms to minimize.
[2024-06-01 15:05:11] [INFO ] Deduced a trap composed of 174 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:05:11] [INFO ] Deduced a trap composed of 172 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:05:11] [INFO ] Deduced a trap composed of 186 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:05:11] [INFO ] Deduced a trap composed of 185 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:05:12] [INFO ] Deduced a trap composed of 151 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:05:12] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:05:12] [INFO ] Deduced a trap composed of 180 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:05:12] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:05:12] [INFO ] Deduced a trap composed of 149 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:05:12] [INFO ] Deduced a trap composed of 151 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:05:13] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:05:13] [INFO ] Deduced a trap composed of 180 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:05:13] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:05:14] [INFO ] Deduced a trap composed of 104 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:05:14] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:05:14] [INFO ] Deduced a trap composed of 181 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:05:14] [INFO ] Deduced a trap composed of 152 places in 147 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:05:22] [INFO ] Deduced a trap composed of 189 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:05:23] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:05:23] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:05:23] [INFO ] Deduced a trap composed of 205 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:05:23] [INFO ] Deduced a trap composed of 170 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:05:23] [INFO ] Deduced a trap composed of 201 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:05:23] [INFO ] Deduced a trap composed of 200 places in 120 ms of which 1 ms to minimize.
[2024-06-01 15:05:23] [INFO ] Deduced a trap composed of 173 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:05:24] [INFO ] Deduced a trap composed of 157 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:05:24] [INFO ] Deduced a trap composed of 191 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:05:24] [INFO ] Deduced a trap composed of 184 places in 128 ms of which 1 ms to minimize.
[2024-06-01 15:05:24] [INFO ] Deduced a trap composed of 216 places in 131 ms of which 1 ms to minimize.
[2024-06-01 15:05:24] [INFO ] Deduced a trap composed of 180 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:05:24] [INFO ] Deduced a trap composed of 195 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:05:25] [INFO ] Deduced a trap composed of 180 places in 140 ms of which 1 ms to minimize.
[2024-06-01 15:05:25] [INFO ] Deduced a trap composed of 165 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:05:25] [INFO ] Deduced a trap composed of 192 places in 126 ms of which 1 ms to minimize.
[2024-06-01 15:05:25] [INFO ] Deduced a trap composed of 168 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:05:25] [INFO ] Deduced a trap composed of 167 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:05:25] [INFO ] Deduced a trap composed of 185 places in 142 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:05:27] [INFO ] Deduced a trap composed of 184 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:05:27] [INFO ] Deduced a trap composed of 206 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:05:27] [INFO ] Deduced a trap composed of 169 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:05:27] [INFO ] Deduced a trap composed of 122 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:05:28] [INFO ] Deduced a trap composed of 124 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:05:28] [INFO ] Deduced a trap composed of 196 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:05:28] [INFO ] Deduced a trap composed of 114 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:05:28] [INFO ] Deduced a trap composed of 122 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:05:28] [INFO ] Deduced a trap composed of 184 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:05:28] [INFO ] Deduced a trap composed of 172 places in 133 ms of which 1 ms to minimize.
[2024-06-01 15:05:29] [INFO ] Deduced a trap composed of 205 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:05:29] [INFO ] Deduced a trap composed of 208 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:05:29] [INFO ] Deduced a trap composed of 189 places in 159 ms of which 1 ms to minimize.
[2024-06-01 15:05:30] [INFO ] Deduced a trap composed of 105 places in 226 ms of which 2 ms to minimize.
[2024-06-01 15:05:30] [INFO ] Deduced a trap composed of 110 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:05:30] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 1 ms to minimize.
[2024-06-01 15:05:30] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:05:31] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:05:31] [INFO ] Deduced a trap composed of 161 places in 216 ms of which 3 ms to minimize.
[2024-06-01 15:05:31] [INFO ] Deduced a trap composed of 172 places in 217 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1216 variables, and 114 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 24/29 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 80/114 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 177 places in 188 ms of which 3 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 183 places in 203 ms of which 2 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 159 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 163 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 171 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 183 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 177 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 167 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 152 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 204 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 149 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 150 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 157 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 188 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 160 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:05:41] [INFO ] Deduced a trap composed of 149 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:05:41] [INFO ] Deduced a trap composed of 140 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:05:41] [INFO ] Deduced a trap composed of 168 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:05:45] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:05:45] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:05:46] [INFO ] Deduced a trap composed of 169 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:05:46] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:05:46] [INFO ] Deduced a trap composed of 181 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:05:46] [INFO ] Deduced a trap composed of 178 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:05:47] [INFO ] Deduced a trap composed of 167 places in 214 ms of which 2 ms to minimize.
[2024-06-01 15:05:47] [INFO ] Deduced a trap composed of 181 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:05:48] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:05:48] [INFO ] Deduced a trap composed of 143 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:05:48] [INFO ] Deduced a trap composed of 182 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:05:49] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:05:49] [INFO ] Deduced a trap composed of 182 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:05:49] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:05:49] [INFO ] Deduced a trap composed of 176 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:05:49] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:05:49] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 1 ms to minimize.
[2024-06-01 15:05:50] [INFO ] Deduced a trap composed of 175 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:05:50] [INFO ] Deduced a trap composed of 187 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:05:50] [INFO ] Deduced a trap composed of 160 places in 142 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:05:56] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 2 ms to minimize.
[2024-06-01 15:05:56] [INFO ] Deduced a trap composed of 144 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:05:57] [INFO ] Deduced a trap composed of 192 places in 245 ms of which 2 ms to minimize.
[2024-06-01 15:05:57] [INFO ] Deduced a trap composed of 153 places in 222 ms of which 2 ms to minimize.
[2024-06-01 15:05:57] [INFO ] Deduced a trap composed of 175 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:05:57] [INFO ] Deduced a trap composed of 167 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:05:57] [INFO ] Deduced a trap composed of 193 places in 195 ms of which 3 ms to minimize.
[2024-06-01 15:05:58] [INFO ] Deduced a trap composed of 181 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:05:58] [INFO ] Deduced a trap composed of 201 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:05:58] [INFO ] Deduced a trap composed of 196 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:05:58] [INFO ] Deduced a trap composed of 178 places in 161 ms of which 1 ms to minimize.
[2024-06-01 15:05:58] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 202 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 189 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 185 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 155 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 171 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:06:00] [INFO ] Deduced a trap composed of 161 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:06:00] [INFO ] Deduced a trap composed of 187 places in 187 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1216 variables, and 174 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 24/29 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 140/140 constraints]
After SMT, in 61113ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 61128ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109586 ms. Remains : 368/368 places, 872/872 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 107 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:06:02] [INFO ] Flow matrix only has 848 transitions (discarded 24 similar events)
[2024-06-01 15:06:02] [INFO ] Invariant cache hit.
[2024-06-01 15:06:02] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 15:06:02] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 109 ms returned sat
[2024-06-01 15:06:03] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2024-06-01 15:06:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:06:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 15:06:04] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 62 ms returned sat
[2024-06-01 15:06:10] [INFO ] [Nat]Absence check using state equation in 5469 ms returned sat
[2024-06-01 15:06:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:06:10] [INFO ] [Nat]Added 120 Read/Feed constraints in 943 ms returned sat
[2024-06-01 15:06:11] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-06-01 15:06:11] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:06:11] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:06:12] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:06:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1222 ms
[2024-06-01 15:06:12] [INFO ] Computed and/alt/rep : 574/3335/556 causal constraints (skipped 288 transitions) in 91 ms.
[2024-06-01 15:06:18] [INFO ] Added : 335 causal constraints over 67 iterations in 6121 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3061 reset in 666 ms.
Product exploration explored 100000 steps with 3084 reset in 547 ms.
Support contains 12 out of 368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 368/368 places, 872/872 transitions.
Applied a total of 0 rules in 12 ms. Remains 368 /368 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Running 868 sub problems to find dead transitions.
[2024-06-01 15:06:19] [INFO ] Flow matrix only has 848 transitions (discarded 24 similar events)
[2024-06-01 15:06:19] [INFO ] Invariant cache hit.
[2024-06-01 15:06:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:06:26] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 1 ms to minimize.
[2024-06-01 15:06:26] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 1 ms to minimize.
[2024-06-01 15:06:26] [INFO ] Deduced a trap composed of 184 places in 203 ms of which 2 ms to minimize.
[2024-06-01 15:06:27] [INFO ] Deduced a trap composed of 182 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:06:27] [INFO ] Deduced a trap composed of 200 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:06:27] [INFO ] Deduced a trap composed of 179 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:06:27] [INFO ] Deduced a trap composed of 167 places in 235 ms of which 2 ms to minimize.
[2024-06-01 15:06:28] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
[2024-06-01 15:06:28] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 2 ms to minimize.
[2024-06-01 15:06:28] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:06:28] [INFO ] Deduced a trap composed of 119 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:06:29] [INFO ] Deduced a trap composed of 57 places in 235 ms of which 2 ms to minimize.
[2024-06-01 15:06:29] [INFO ] Deduced a trap composed of 120 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:06:29] [INFO ] Deduced a trap composed of 155 places in 224 ms of which 2 ms to minimize.
[2024-06-01 15:06:30] [INFO ] Deduced a trap composed of 204 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:06:30] [INFO ] Deduced a trap composed of 148 places in 231 ms of which 2 ms to minimize.
[2024-06-01 15:06:30] [INFO ] Deduced a trap composed of 188 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:06:30] [INFO ] Deduced a trap composed of 179 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 197 places in 214 ms of which 2 ms to minimize.
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 175 places in 214 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 173 places in 142 ms of which 1 ms to minimize.
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 184 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 174 places in 130 ms of which 1 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 172 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 186 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 185 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 151 places in 138 ms of which 1 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 180 places in 136 ms of which 1 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 1 ms to minimize.
[2024-06-01 15:06:34] [INFO ] Deduced a trap composed of 149 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:06:34] [INFO ] Deduced a trap composed of 151 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:06:34] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:06:35] [INFO ] Deduced a trap composed of 180 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:06:35] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:06:35] [INFO ] Deduced a trap composed of 104 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:06:36] [INFO ] Deduced a trap composed of 170 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:06:36] [INFO ] Deduced a trap composed of 181 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:06:36] [INFO ] Deduced a trap composed of 152 places in 168 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1216 variables, and 74 constraints, problems are : Problem set: 0 solved, 868 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 24/29 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 40/74 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:06:44] [INFO ] Deduced a trap composed of 171 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:06:44] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:06:44] [INFO ] Deduced a trap composed of 152 places in 209 ms of which 2 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 199 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 163 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 184 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 187 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 188 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:06:46] [INFO ] Deduced a trap composed of 189 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:06:46] [INFO ] Deduced a trap composed of 181 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:06:46] [INFO ] Deduced a trap composed of 180 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:06:46] [INFO ] Deduced a trap composed of 195 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:06:46] [INFO ] Deduced a trap composed of 188 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:06:47] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:06:47] [INFO ] Deduced a trap composed of 177 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:06:47] [INFO ] Deduced a trap composed of 158 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:06:47] [INFO ] Deduced a trap composed of 176 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:06:47] [INFO ] Deduced a trap composed of 161 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:06:47] [INFO ] Deduced a trap composed of 175 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:06:50] [INFO ] Deduced a trap composed of 153 places in 231 ms of which 3 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 2 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 159 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 139 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 206 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 174 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 177 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 185 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 196 places in 209 ms of which 2 ms to minimize.
[2024-06-01 15:06:53] [INFO ] Deduced a trap composed of 184 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:06:53] [INFO ] Deduced a trap composed of 182 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:06:53] [INFO ] Deduced a trap composed of 168 places in 173 ms of which 1 ms to minimize.
[2024-06-01 15:06:53] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:06:53] [INFO ] Deduced a trap composed of 171 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:06:54] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:06:54] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:06:54] [INFO ] Deduced a trap composed of 154 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:06:54] [INFO ] Deduced a trap composed of 195 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:06:54] [INFO ] Deduced a trap composed of 171 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:06:55] [INFO ] Deduced a trap composed of 168 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1216 variables, and 114 constraints, problems are : Problem set: 0 solved, 868 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 24/29 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 80/80 constraints]
After SMT, in 40837ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 40846ms
[2024-06-01 15:07:00] [INFO ] Flow matrix only has 848 transitions (discarded 24 similar events)
[2024-06-01 15:07:00] [INFO ] Invariant cache hit.
[2024-06-01 15:07:00] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-06-01 15:07:00] [INFO ] Flow matrix only has 848 transitions (discarded 24 similar events)
[2024-06-01 15:07:00] [INFO ] Invariant cache hit.
[2024-06-01 15:07:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:07:08] [INFO ] Implicit Places using invariants and state equation in 7505 ms returned []
Implicit Place search using SMT with State Equation took 7902 ms to find 0 implicit places.
[2024-06-01 15:07:08] [INFO ] Redundant transitions in 10 ms returned []
Running 868 sub problems to find dead transitions.
[2024-06-01 15:07:08] [INFO ] Flow matrix only has 848 transitions (discarded 24 similar events)
[2024-06-01 15:07:08] [INFO ] Invariant cache hit.
[2024-06-01 15:07:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:07:13] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 184 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 182 places in 144 ms of which 1 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 200 places in 147 ms of which 1 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 179 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 167 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:07:15] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 1 ms to minimize.
[2024-06-01 15:07:15] [INFO ] Deduced a trap composed of 164 places in 138 ms of which 1 ms to minimize.
[2024-06-01 15:07:15] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:07:15] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:07:15] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 204 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 148 places in 139 ms of which 1 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 188 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 179 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:07:17] [INFO ] Deduced a trap composed of 197 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:07:17] [INFO ] Deduced a trap composed of 175 places in 153 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:07:18] [INFO ] Deduced a trap composed of 173 places in 165 ms of which 1 ms to minimize.
[2024-06-01 15:07:18] [INFO ] Deduced a trap composed of 184 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:07:18] [INFO ] Deduced a trap composed of 158 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:07:18] [INFO ] Deduced a trap composed of 174 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:07:18] [INFO ] Deduced a trap composed of 172 places in 141 ms of which 1 ms to minimize.
[2024-06-01 15:07:18] [INFO ] Deduced a trap composed of 186 places in 168 ms of which 1 ms to minimize.
[2024-06-01 15:07:19] [INFO ] Deduced a trap composed of 185 places in 139 ms of which 1 ms to minimize.
[2024-06-01 15:07:19] [INFO ] Deduced a trap composed of 151 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:07:19] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:07:19] [INFO ] Deduced a trap composed of 180 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:07:19] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:07:19] [INFO ] Deduced a trap composed of 149 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:07:20] [INFO ] Deduced a trap composed of 151 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:07:20] [INFO ] Deduced a trap composed of 166 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:07:20] [INFO ] Deduced a trap composed of 180 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:07:20] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 1 ms to minimize.
[2024-06-01 15:07:21] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:07:21] [INFO ] Deduced a trap composed of 170 places in 128 ms of which 1 ms to minimize.
[2024-06-01 15:07:21] [INFO ] Deduced a trap composed of 181 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:07:21] [INFO ] Deduced a trap composed of 152 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:07:29] [INFO ] Deduced a trap composed of 189 places in 138 ms of which 1 ms to minimize.
[2024-06-01 15:07:29] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 1 ms to minimize.
[2024-06-01 15:07:29] [INFO ] Deduced a trap composed of 166 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:07:29] [INFO ] Deduced a trap composed of 205 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:07:29] [INFO ] Deduced a trap composed of 170 places in 146 ms of which 1 ms to minimize.
[2024-06-01 15:07:30] [INFO ] Deduced a trap composed of 201 places in 150 ms of which 1 ms to minimize.
[2024-06-01 15:07:30] [INFO ] Deduced a trap composed of 200 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:07:30] [INFO ] Deduced a trap composed of 173 places in 139 ms of which 1 ms to minimize.
[2024-06-01 15:07:30] [INFO ] Deduced a trap composed of 157 places in 152 ms of which 1 ms to minimize.
[2024-06-01 15:07:30] [INFO ] Deduced a trap composed of 191 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:07:30] [INFO ] Deduced a trap composed of 184 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:07:31] [INFO ] Deduced a trap composed of 216 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:07:31] [INFO ] Deduced a trap composed of 180 places in 143 ms of which 14 ms to minimize.
[2024-06-01 15:07:31] [INFO ] Deduced a trap composed of 195 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:07:31] [INFO ] Deduced a trap composed of 180 places in 147 ms of which 1 ms to minimize.
[2024-06-01 15:07:31] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 1 ms to minimize.
[2024-06-01 15:07:31] [INFO ] Deduced a trap composed of 192 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:07:32] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:07:32] [INFO ] Deduced a trap composed of 167 places in 141 ms of which 1 ms to minimize.
[2024-06-01 15:07:32] [INFO ] Deduced a trap composed of 185 places in 156 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:07:34] [INFO ] Deduced a trap composed of 184 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:07:34] [INFO ] Deduced a trap composed of 206 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:07:34] [INFO ] Deduced a trap composed of 169 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:07:34] [INFO ] Deduced a trap composed of 122 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:07:35] [INFO ] Deduced a trap composed of 124 places in 189 ms of which 1 ms to minimize.
[2024-06-01 15:07:35] [INFO ] Deduced a trap composed of 196 places in 173 ms of which 1 ms to minimize.
[2024-06-01 15:07:35] [INFO ] Deduced a trap composed of 114 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:07:35] [INFO ] Deduced a trap composed of 122 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:07:35] [INFO ] Deduced a trap composed of 184 places in 193 ms of which 1 ms to minimize.
[2024-06-01 15:07:36] [INFO ] Deduced a trap composed of 172 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:07:36] [INFO ] Deduced a trap composed of 205 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:07:36] [INFO ] Deduced a trap composed of 208 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:07:36] [INFO ] Deduced a trap composed of 189 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:07:37] [INFO ] Deduced a trap composed of 105 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:07:37] [INFO ] Deduced a trap composed of 110 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:07:37] [INFO ] Deduced a trap composed of 165 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:07:37] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:07:38] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 2 ms to minimize.
[2024-06-01 15:07:38] [INFO ] Deduced a trap composed of 161 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:07:38] [INFO ] Deduced a trap composed of 172 places in 189 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1216 variables, and 114 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 24/29 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 80/114 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:07:44] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:07:44] [INFO ] Deduced a trap composed of 177 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:07:45] [INFO ] Deduced a trap composed of 183 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:07:45] [INFO ] Deduced a trap composed of 159 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:07:45] [INFO ] Deduced a trap composed of 163 places in 194 ms of which 2 ms to minimize.
[2024-06-01 15:07:45] [INFO ] Deduced a trap composed of 171 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:07:45] [INFO ] Deduced a trap composed of 183 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:07:46] [INFO ] Deduced a trap composed of 177 places in 199 ms of which 3 ms to minimize.
[2024-06-01 15:07:46] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:07:46] [INFO ] Deduced a trap composed of 167 places in 179 ms of which 4 ms to minimize.
[2024-06-01 15:07:46] [INFO ] Deduced a trap composed of 152 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:07:47] [INFO ] Deduced a trap composed of 204 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:07:47] [INFO ] Deduced a trap composed of 149 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:07:47] [INFO ] Deduced a trap composed of 150 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:07:47] [INFO ] Deduced a trap composed of 157 places in 228 ms of which 2 ms to minimize.
[2024-06-01 15:07:48] [INFO ] Deduced a trap composed of 188 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:07:48] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:07:48] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:07:48] [INFO ] Deduced a trap composed of 140 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:07:48] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:07:53] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:07:53] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:07:53] [INFO ] Deduced a trap composed of 169 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:07:53] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:07:54] [INFO ] Deduced a trap composed of 181 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:07:54] [INFO ] Deduced a trap composed of 178 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:07:54] [INFO ] Deduced a trap composed of 167 places in 258 ms of which 2 ms to minimize.
[2024-06-01 15:07:55] [INFO ] Deduced a trap composed of 181 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:07:55] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:07:55] [INFO ] Deduced a trap composed of 143 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:07:55] [INFO ] Deduced a trap composed of 182 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:07:56] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 1 ms to minimize.
[2024-06-01 15:07:56] [INFO ] Deduced a trap composed of 182 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:07:56] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:07:56] [INFO ] Deduced a trap composed of 176 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:07:56] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:07:56] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:07:57] [INFO ] Deduced a trap composed of 175 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:07:57] [INFO ] Deduced a trap composed of 187 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:07:57] [INFO ] Deduced a trap composed of 160 places in 157 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-06-01 15:08:03] [INFO ] Deduced a trap composed of 137 places in 249 ms of which 3 ms to minimize.
[2024-06-01 15:08:03] [INFO ] Deduced a trap composed of 144 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:08:04] [INFO ] Deduced a trap composed of 192 places in 235 ms of which 3 ms to minimize.
[2024-06-01 15:08:04] [INFO ] Deduced a trap composed of 153 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:08:04] [INFO ] Deduced a trap composed of 175 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:08:04] [INFO ] Deduced a trap composed of 167 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:08:04] [INFO ] Deduced a trap composed of 193 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:08:05] [INFO ] Deduced a trap composed of 181 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:08:05] [INFO ] Deduced a trap composed of 201 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:08:05] [INFO ] Deduced a trap composed of 196 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:08:05] [INFO ] Deduced a trap composed of 178 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:08:05] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 1 ms to minimize.
[2024-06-01 15:08:05] [INFO ] Deduced a trap composed of 202 places in 140 ms of which 1 ms to minimize.
[2024-06-01 15:08:06] [INFO ] Deduced a trap composed of 189 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:08:06] [INFO ] Deduced a trap composed of 185 places in 134 ms of which 1 ms to minimize.
[2024-06-01 15:08:06] [INFO ] Deduced a trap composed of 155 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:08:06] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:08:06] [INFO ] Deduced a trap composed of 160 places in 152 ms of which 1 ms to minimize.
[2024-06-01 15:08:07] [INFO ] Deduced a trap composed of 161 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:08:07] [INFO ] Deduced a trap composed of 187 places in 149 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1216 variables, and 174 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 24/29 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 140/140 constraints]
After SMT, in 60864ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60872ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109665 ms. Remains : 368/368 places, 872/872 transitions.
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-02 finished in 373566 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' '!((p0 U G(!p1)))'
Support contains 13 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
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 544 transition count 1336
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 508 transition count 1330
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 502 transition count 1330
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 84 place count 502 transition count 1264
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 216 place count 436 transition count 1264
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 430 transition count 1258
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 430 transition count 1258
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 324 place count 382 transition count 1210
Applied a total of 324 rules in 81 ms. Remains 382 /544 variables (removed 162) and now considering 1210/1372 (removed 162) transitions.
Running 1206 sub problems to find dead transitions.
[2024-06-01 15:08:09] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
// Phase 1: matrix 1186 rows 382 cols
[2024-06-01 15:08:09] [INFO ] Computed 40 invariants in 17 ms
[2024-06-01 15:08:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 33 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-06-01 15:08:36] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:08:37] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 1 ms to minimize.
[2024-06-01 15:08:37] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:08:37] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:08:37] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 53 places in 259 ms of which 3 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 1 ms to minimize.
[2024-06-01 15:08:44] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:08:46] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1206 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 378/1568 variables, and 42 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 11/11 constraints]
After SMT, in 44299ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 44312ms
[2024-06-01 15:08:53] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-06-01 15:08:53] [INFO ] Invariant cache hit.
[2024-06-01 15:08:54] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 15:08:54] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-06-01 15:08:54] [INFO ] Invariant cache hit.
[2024-06-01 15:08:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:09:01] [INFO ] Implicit Places using invariants and state equation in 7339 ms returned []
Implicit Place search using SMT with State Equation took 7709 ms to find 0 implicit places.
[2024-06-01 15:09:01] [INFO ] Redundant transitions in 29 ms returned []
Running 1206 sub problems to find dead transitions.
[2024-06-01 15:09:01] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-06-01 15:09:01] [INFO ] Invariant cache hit.
[2024-06-01 15:09:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD826 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/379 variables, 1/34 constraints. Problems are: Problem set: 90 solved, 1116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 5/39 constraints. Problems are: Problem set: 90 solved, 1116 unsolved
[2024-06-01 15:09:33] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:09:33] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2024-06-01 15:09:33] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:09:33] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:09:33] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 4 ms to minimize.
[2024-06-01 15:09:33] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:09:33] [INFO ] Deduced a trap composed of 163 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:09:34] [INFO ] Deduced a trap composed of 150 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:09:34] [INFO ] Deduced a trap composed of 119 places in 153 ms of which 1 ms to minimize.
[2024-06-01 15:09:34] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:09:35] [INFO ] Deduced a trap composed of 132 places in 186 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/1568 variables, and 50 constraints, problems are : Problem set: 90 solved, 1116 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 90 solved, 1116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 90 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 17/31 constraints. Problems are: Problem set: 90 solved, 1116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 13/44 constraints. Problems are: Problem set: 90 solved, 1116 unsolved
[2024-06-01 15:09:42] [INFO ] Deduced a trap composed of 116 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/45 constraints. Problems are: Problem set: 90 solved, 1116 unsolved
[2024-06-01 15:09:44] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:09:44] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:09:47] [INFO ] Deduced a trap composed of 142 places in 209 ms of which 2 ms to minimize.
[2024-06-01 15:09:47] [INFO ] Deduced a trap composed of 146 places in 201 ms of which 2 ms to minimize.
[2024-06-01 15:09:48] [INFO ] Deduced a trap composed of 159 places in 222 ms of which 2 ms to minimize.
[2024-06-01 15:09:48] [INFO ] Deduced a trap composed of 71 places in 176 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 6/51 constraints. Problems are: Problem set: 90 solved, 1116 unsolved
[2024-06-01 15:09:52] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 1/52 constraints. Problems are: Problem set: 90 solved, 1116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/52 constraints. Problems are: Problem set: 90 solved, 1116 unsolved
At refinement iteration 7 (OVERLAPS) 1/379 variables, 1/53 constraints. Problems are: Problem set: 90 solved, 1116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 5/58 constraints. Problems are: Problem set: 90 solved, 1116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/1568 variables, and 58 constraints, problems are : Problem set: 90 solved, 1116 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 21/21 constraints]
After SMT, in 64583ms problems are : Problem set: 90 solved, 1116 unsolved
Search for dead transitions found 90 dead transitions in 64596ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 382/544 places, 1120/1372 transitions.
Applied a total of 0 rules in 15 ms. Remains 382 /382 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
[2024-06-01 15:10:06] [INFO ] Redundant transitions in 18 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 116781 ms. Remains : 382/544 places, 1120/1372 transitions.
Stuttering acceptance computed with spot in 121 ms :[p1, true, p1]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 62 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-04 finished in 116924 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 20 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 40 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 15:10:06] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-06-01 15:10:06] [INFO ] Computed 40 invariants in 38 ms
[2024-06-01 15:10:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:10:20] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:10:22] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:10:37] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:10:37] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:10:37] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:10:37] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 0 ms to minimize.
[2024-06-01 15:10:40] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:10:40] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:10:47] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 41 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 11/11 constraints]
After SMT, in 45670ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45691ms
[2024-06-01 15:10:52] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 15:10:52] [INFO ] Invariant cache hit.
[2024-06-01 15:10:52] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-06-01 15:10:52] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 15:10:52] [INFO ] Invariant cache hit.
[2024-06-01 15:10:53] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:11:01] [INFO ] Implicit Places using invariants and state equation in 9418 ms returned []
Implicit Place search using SMT with State Equation took 9827 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-06-01 15:11:01] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 15:11:01] [INFO ] Invariant cache hit.
[2024-06-01 15:11:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:11:14] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:11:24] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 33 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:11:42] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 2 ms to minimize.
[2024-06-01 15:11:42] [INFO ] Deduced a trap composed of 75 places in 199 ms of which 1 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 5 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 1 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:11:52] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:11:57] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:11:57] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:11:57] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:12:02] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:12:02] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:12:02] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 46 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 16/16 constraints]
After SMT, in 63604ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 63626ms
Starting structural reductions in LTL mode, iteration 1 : 532/544 places, 1360/1372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119196 ms. Remains : 532/544 places, 1360/1372 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-06 finished in 119373 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 6 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 544 transition count 1330
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 502 transition count 1330
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 502 transition count 1270
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 442 transition count 1270
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 324 place count 382 transition count 1210
Applied a total of 324 rules in 53 ms. Remains 382 /544 variables (removed 162) and now considering 1210/1372 (removed 162) transitions.
Running 1206 sub problems to find dead transitions.
[2024-06-01 15:12:05] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
// Phase 1: matrix 1186 rows 382 cols
[2024-06-01 15:12:05] [INFO ] Computed 40 invariants in 13 ms
[2024-06-01 15:12:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-06-01 15:12:15] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:12:20] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
SMT process timed out in 24471ms, After SMT, problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 24482ms
[2024-06-01 15:12:30] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-06-01 15:12:30] [INFO ] Invariant cache hit.
[2024-06-01 15:12:30] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-06-01 15:12:30] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-06-01 15:12:30] [INFO ] Invariant cache hit.
[2024-06-01 15:12:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:12:36] [INFO ] Implicit Places using invariants and state equation in 6188 ms returned []
Implicit Place search using SMT with State Equation took 6656 ms to find 0 implicit places.
[2024-06-01 15:12:36] [INFO ] Redundant transitions in 29 ms returned []
Running 1206 sub problems to find dead transitions.
[2024-06-01 15:12:36] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-06-01 15:12:36] [INFO ] Invariant cache hit.
[2024-06-01 15:12:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-06-01 15:12:49] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:12:49] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:12:54] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:12:56] [INFO ] Deduced a trap composed of 110 places in 149 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 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 TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD819 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/382 variables, 9/44 constraints. Problems are: Problem set: 324 solved, 882 unsolved
[2024-06-01 15:13:10] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:13:10] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:13:10] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:13:10] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:13:10] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:13:11] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:13:11] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 0 ms to minimize.
[2024-06-01 15:13:11] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-06-01 15:13:11] [INFO ] Deduced a trap composed of 149 places in 221 ms of which 2 ms to minimize.
[2024-06-01 15:13:12] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
SMT process timed out in 35182ms, After SMT, problems are : Problem set: 324 solved, 882 unsolved
Search for dead transitions found 324 dead transitions in 35196ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) removed 324 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 382/544 places, 886/1372 transitions.
Applied a total of 0 rules in 12 ms. Remains 382 /382 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2024-06-01 15:13:12] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 66456 ms. Remains : 382/544 places, 886/1372 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-07
Product exploration explored 100000 steps with 1476 reset in 347 ms.
Product exploration explored 100000 steps with 1472 reset in 558 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 271 steps (0 resets) in 6 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 85 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:13:13] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2024-06-01 15:13:13] [INFO ] Computed 40 invariants in 16 ms
[2024-06-01 15:13:14] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-06-01 15:13:14] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 40 ms returned sat
[2024-06-01 15:13:15] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2024-06-01 15:13:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:13:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 15:13:15] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 24 ms returned sat
[2024-06-01 15:13:18] [INFO ] [Nat]Absence check using state equation in 2988 ms returned sat
[2024-06-01 15:13:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:13:19] [INFO ] [Nat]Added 120 Read/Feed constraints in 1288 ms returned sat
[2024-06-01 15:13:20] [INFO ] Deduced a trap composed of 49 places in 262 ms of which 2 ms to minimize.
[2024-06-01 15:13:20] [INFO ] Deduced a trap composed of 87 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:13:21] [INFO ] Deduced a trap composed of 49 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:13:21] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:13:23] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 3239 ms
Could not prove EG (NOT p0)
Support contains 6 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 886/886 transitions.
Applied a total of 0 rules in 29 ms. Remains 382 /382 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Running 882 sub problems to find dead transitions.
[2024-06-01 15:13:23] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2024-06-01 15:13:23] [INFO ] Invariant cache hit.
[2024-06-01 15:13:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 49 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 100 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 93 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 109 places in 134 ms of which 1 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 188 places in 222 ms of which 2 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 177 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 154 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 141 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:13:32] [INFO ] Deduced a trap composed of 151 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:13:32] [INFO ] Deduced a trap composed of 203 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:13:32] [INFO ] Deduced a trap composed of 155 places in 168 ms of which 1 ms to minimize.
[2024-06-01 15:13:33] [INFO ] Deduced a trap composed of 173 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:13:34] [INFO ] Deduced a trap composed of 200 places in 233 ms of which 3 ms to minimize.
[2024-06-01 15:13:34] [INFO ] Deduced a trap composed of 201 places in 211 ms of which 3 ms to minimize.
[2024-06-01 15:13:34] [INFO ] Deduced a trap composed of 219 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:13:35] [INFO ] Deduced a trap composed of 180 places in 186 ms of which 1 ms to minimize.
[2024-06-01 15:13:35] [INFO ] Deduced a trap composed of 196 places in 175 ms of which 1 ms to minimize.
[2024-06-01 15:13:35] [INFO ] Deduced a trap composed of 194 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:13:35] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:13:36] [INFO ] Deduced a trap composed of 200 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:13:36] [INFO ] Deduced a trap composed of 200 places in 312 ms of which 3 ms to minimize.
[2024-06-01 15:13:36] [INFO ] Deduced a trap composed of 189 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:13:37] [INFO ] Deduced a trap composed of 109 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:13:37] [INFO ] Deduced a trap composed of 179 places in 279 ms of which 2 ms to minimize.
[2024-06-01 15:13:38] [INFO ] Deduced a trap composed of 172 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:13:38] [INFO ] Deduced a trap composed of 171 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:13:38] [INFO ] Deduced a trap composed of 190 places in 215 ms of which 2 ms to minimize.
[2024-06-01 15:13:39] [INFO ] Deduced a trap composed of 188 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:13:39] [INFO ] Deduced a trap composed of 132 places in 214 ms of which 2 ms to minimize.
[2024-06-01 15:13:40] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:13:40] [INFO ] Deduced a trap composed of 185 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:13:40] [INFO ] Deduced a trap composed of 187 places in 212 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1244 variables, and 76 constraints, problems are : Problem set: 0 solved, 882 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 40/76 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:13:50] [INFO ] Deduced a trap composed of 194 places in 268 ms of which 2 ms to minimize.
[2024-06-01 15:13:50] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 3 ms to minimize.
[2024-06-01 15:13:51] [INFO ] Deduced a trap composed of 179 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:13:51] [INFO ] Deduced a trap composed of 211 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:13:51] [INFO ] Deduced a trap composed of 171 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:13:51] [INFO ] Deduced a trap composed of 182 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:13:51] [INFO ] Deduced a trap composed of 195 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:13:52] [INFO ] Deduced a trap composed of 212 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:13:52] [INFO ] Deduced a trap composed of 197 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:13:52] [INFO ] Deduced a trap composed of 207 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:13:52] [INFO ] Deduced a trap composed of 217 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:13:52] [INFO ] Deduced a trap composed of 206 places in 137 ms of which 1 ms to minimize.
[2024-06-01 15:13:53] [INFO ] Deduced a trap composed of 182 places in 154 ms of which 1 ms to minimize.
[2024-06-01 15:13:53] [INFO ] Deduced a trap composed of 201 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:13:53] [INFO ] Deduced a trap composed of 210 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:13:53] [INFO ] Deduced a trap composed of 197 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:13:53] [INFO ] Deduced a trap composed of 216 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:13:54] [INFO ] Deduced a trap composed of 213 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:13:54] [INFO ] Deduced a trap composed of 186 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:13:54] [INFO ] Deduced a trap composed of 202 places in 255 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:14:00] [INFO ] Deduced a trap composed of 175 places in 280 ms of which 3 ms to minimize.
[2024-06-01 15:14:01] [INFO ] Deduced a trap composed of 211 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:14:01] [INFO ] Deduced a trap composed of 199 places in 221 ms of which 3 ms to minimize.
[2024-06-01 15:14:01] [INFO ] Deduced a trap composed of 177 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:14:01] [INFO ] Deduced a trap composed of 194 places in 217 ms of which 2 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 211 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 208 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 224 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 228 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 211 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 214 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 200 places in 245 ms of which 2 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 173 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 215 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 177 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:14:04] [INFO ] Deduced a trap composed of 204 places in 226 ms of which 2 ms to minimize.
[2024-06-01 15:14:04] [INFO ] Deduced a trap composed of 203 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:14:04] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 3 ms to minimize.
SMT process timed out in 41463ms, After SMT, problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 41477ms
[2024-06-01 15:14:04] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2024-06-01 15:14:04] [INFO ] Invariant cache hit.
[2024-06-01 15:14:05] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-06-01 15:14:05] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2024-06-01 15:14:05] [INFO ] Invariant cache hit.
[2024-06-01 15:14:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:14:14] [INFO ] Implicit Places using invariants and state equation in 9017 ms returned []
Implicit Place search using SMT with State Equation took 9453 ms to find 0 implicit places.
[2024-06-01 15:14:14] [INFO ] Redundant transitions in 29 ms returned []
Running 882 sub problems to find dead transitions.
[2024-06-01 15:14:14] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2024-06-01 15:14:14] [INFO ] Invariant cache hit.
[2024-06-01 15:14:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:14:19] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:14:19] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:14:20] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:14:20] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:14:20] [INFO ] Deduced a trap composed of 49 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:14:20] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:14:20] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:14:20] [INFO ] Deduced a trap composed of 100 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:14:20] [INFO ] Deduced a trap composed of 93 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:14:20] [INFO ] Deduced a trap composed of 71 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:14:21] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:14:21] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:14:21] [INFO ] Deduced a trap composed of 188 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:14:22] [INFO ] Deduced a trap composed of 177 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:14:22] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:14:22] [INFO ] Deduced a trap composed of 141 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:14:22] [INFO ] Deduced a trap composed of 151 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:14:23] [INFO ] Deduced a trap composed of 203 places in 211 ms of which 3 ms to minimize.
[2024-06-01 15:14:23] [INFO ] Deduced a trap composed of 155 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:14:23] [INFO ] Deduced a trap composed of 173 places in 198 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:14:24] [INFO ] Deduced a trap composed of 200 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:14:24] [INFO ] Deduced a trap composed of 201 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:14:24] [INFO ] Deduced a trap composed of 219 places in 217 ms of which 2 ms to minimize.
[2024-06-01 15:14:25] [INFO ] Deduced a trap composed of 180 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:14:25] [INFO ] Deduced a trap composed of 196 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:14:25] [INFO ] Deduced a trap composed of 194 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:14:25] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 3 ms to minimize.
[2024-06-01 15:14:26] [INFO ] Deduced a trap composed of 200 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:14:26] [INFO ] Deduced a trap composed of 200 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:14:26] [INFO ] Deduced a trap composed of 189 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:14:26] [INFO ] Deduced a trap composed of 109 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:14:27] [INFO ] Deduced a trap composed of 179 places in 231 ms of which 3 ms to minimize.
[2024-06-01 15:14:27] [INFO ] Deduced a trap composed of 172 places in 211 ms of which 2 ms to minimize.
[2024-06-01 15:14:28] [INFO ] Deduced a trap composed of 171 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:14:28] [INFO ] Deduced a trap composed of 190 places in 220 ms of which 3 ms to minimize.
[2024-06-01 15:14:28] [INFO ] Deduced a trap composed of 188 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:14:29] [INFO ] Deduced a trap composed of 132 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:14:30] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 2 ms to minimize.
[2024-06-01 15:14:30] [INFO ] Deduced a trap composed of 185 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:14:30] [INFO ] Deduced a trap composed of 187 places in 248 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 136 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 174 places in 195 ms of which 3 ms to minimize.
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 144 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 168 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 177 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:14:42] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:14:42] [INFO ] Deduced a trap composed of 210 places in 240 ms of which 3 ms to minimize.
[2024-06-01 15:14:42] [INFO ] Deduced a trap composed of 219 places in 254 ms of which 3 ms to minimize.
[2024-06-01 15:14:42] [INFO ] Deduced a trap composed of 201 places in 194 ms of which 2 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 200 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 207 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 221 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 198 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 171 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 196 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 194 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 209 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1244 variables, and 96 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:14:56] [INFO ] Deduced a trap composed of 187 places in 267 ms of which 3 ms to minimize.
[2024-06-01 15:14:56] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:14:56] [INFO ] Deduced a trap composed of 187 places in 259 ms of which 3 ms to minimize.
[2024-06-01 15:14:56] [INFO ] Deduced a trap composed of 197 places in 227 ms of which 3 ms to minimize.
[2024-06-01 15:14:57] [INFO ] Deduced a trap composed of 153 places in 260 ms of which 3 ms to minimize.
[2024-06-01 15:14:57] [INFO ] Deduced a trap composed of 146 places in 240 ms of which 3 ms to minimize.
[2024-06-01 15:14:58] [INFO ] Deduced a trap composed of 183 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:14:58] [INFO ] Deduced a trap composed of 163 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:14:58] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 3 ms to minimize.
[2024-06-01 15:14:58] [INFO ] Deduced a trap composed of 182 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:14:59] [INFO ] Deduced a trap composed of 154 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:14:59] [INFO ] Deduced a trap composed of 182 places in 215 ms of which 2 ms to minimize.
[2024-06-01 15:14:59] [INFO ] Deduced a trap composed of 167 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:14:59] [INFO ] Deduced a trap composed of 161 places in 199 ms of which 3 ms to minimize.
[2024-06-01 15:15:00] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:15:00] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:15:00] [INFO ] Deduced a trap composed of 176 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:15:00] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:15:01] [INFO ] Deduced a trap composed of 171 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:15:01] [INFO ] Deduced a trap composed of 187 places in 180 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 188 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 172 places in 257 ms of which 3 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 180 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1244 variables, and 120 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/882 constraints, Known Traps: 84/84 constraints]
After SMT, in 61359ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 61376ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112383 ms. Remains : 382/382 places, 886/886 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 255 steps (0 resets) in 7 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 129 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:15:16] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2024-06-01 15:15:16] [INFO ] Invariant cache hit.
[2024-06-01 15:15:16] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 15:15:16] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 67 ms returned sat
[2024-06-01 15:15:18] [INFO ] [Real]Absence check using state equation in 1562 ms returned sat
[2024-06-01 15:15:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:15:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 15:15:18] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 33 ms returned sat
[2024-06-01 15:15:21] [INFO ] [Nat]Absence check using state equation in 2513 ms returned sat
[2024-06-01 15:15:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:15:21] [INFO ] [Nat]Added 120 Read/Feed constraints in 783 ms returned sat
[2024-06-01 15:15:22] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 2 ms to minimize.
[2024-06-01 15:15:22] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:15:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 705 ms
[2024-06-01 15:15:22] [INFO ] Computed and/alt/rep : 588/3349/570 causal constraints (skipped 288 transitions) in 74 ms.
[2024-06-01 15:15:28] [INFO ] Added : 269 causal constraints over 54 iterations in 5604 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1464 reset in 446 ms.
Product exploration explored 100000 steps with 1467 reset in 433 ms.
Support contains 6 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 886/886 transitions.
Applied a total of 0 rules in 11 ms. Remains 382 /382 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Running 882 sub problems to find dead transitions.
[2024-06-01 15:15:29] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2024-06-01 15:15:29] [INFO ] Invariant cache hit.
[2024-06-01 15:15:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:15:34] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 100 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 93 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 71 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 109 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 188 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 177 places in 216 ms of which 3 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 141 places in 195 ms of which 3 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 151 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:15:38] [INFO ] Deduced a trap composed of 203 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:15:38] [INFO ] Deduced a trap composed of 155 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:15:38] [INFO ] Deduced a trap composed of 173 places in 198 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:15:39] [INFO ] Deduced a trap composed of 200 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:15:39] [INFO ] Deduced a trap composed of 201 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:15:39] [INFO ] Deduced a trap composed of 219 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 180 places in 195 ms of which 3 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 196 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 194 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 198 places in 219 ms of which 3 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 200 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 200 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 189 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 109 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:15:42] [INFO ] Deduced a trap composed of 179 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:15:42] [INFO ] Deduced a trap composed of 172 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:15:42] [INFO ] Deduced a trap composed of 171 places in 312 ms of which 3 ms to minimize.
[2024-06-01 15:15:43] [INFO ] Deduced a trap composed of 190 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:15:43] [INFO ] Deduced a trap composed of 188 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:15:44] [INFO ] Deduced a trap composed of 132 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:15:44] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:15:45] [INFO ] Deduced a trap composed of 185 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:15:45] [INFO ] Deduced a trap composed of 187 places in 212 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1244 variables, and 76 constraints, problems are : Problem set: 0 solved, 882 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 40/76 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:15:55] [INFO ] Deduced a trap composed of 194 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:15:56] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:15:56] [INFO ] Deduced a trap composed of 179 places in 201 ms of which 2 ms to minimize.
[2024-06-01 15:15:56] [INFO ] Deduced a trap composed of 211 places in 190 ms of which 14 ms to minimize.
[2024-06-01 15:15:56] [INFO ] Deduced a trap composed of 171 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:15:57] [INFO ] Deduced a trap composed of 182 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:15:57] [INFO ] Deduced a trap composed of 195 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:15:57] [INFO ] Deduced a trap composed of 212 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:15:57] [INFO ] Deduced a trap composed of 197 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:15:58] [INFO ] Deduced a trap composed of 207 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:15:58] [INFO ] Deduced a trap composed of 217 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:15:58] [INFO ] Deduced a trap composed of 206 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:15:58] [INFO ] Deduced a trap composed of 182 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:15:58] [INFO ] Deduced a trap composed of 201 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:15:58] [INFO ] Deduced a trap composed of 210 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:15:59] [INFO ] Deduced a trap composed of 197 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:15:59] [INFO ] Deduced a trap composed of 216 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:15:59] [INFO ] Deduced a trap composed of 213 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:15:59] [INFO ] Deduced a trap composed of 186 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:16:00] [INFO ] Deduced a trap composed of 202 places in 205 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:16:06] [INFO ] Deduced a trap composed of 175 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:16:06] [INFO ] Deduced a trap composed of 211 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:16:06] [INFO ] Deduced a trap composed of 199 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:16:06] [INFO ] Deduced a trap composed of 177 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:16:06] [INFO ] Deduced a trap composed of 194 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:16:07] [INFO ] Deduced a trap composed of 211 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:16:07] [INFO ] Deduced a trap composed of 208 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:16:07] [INFO ] Deduced a trap composed of 224 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:16:07] [INFO ] Deduced a trap composed of 228 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:16:07] [INFO ] Deduced a trap composed of 211 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:16:08] [INFO ] Deduced a trap composed of 214 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:16:08] [INFO ] Deduced a trap composed of 200 places in 222 ms of which 3 ms to minimize.
[2024-06-01 15:16:08] [INFO ] Deduced a trap composed of 173 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:16:08] [INFO ] Deduced a trap composed of 215 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:16:09] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:16:09] [INFO ] Deduced a trap composed of 204 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:16:09] [INFO ] Deduced a trap composed of 203 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:16:09] [INFO ] Deduced a trap composed of 226 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:16:09] [INFO ] Deduced a trap composed of 200 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:16:10] [INFO ] Deduced a trap composed of 184 places in 230 ms of which 5 ms to minimize.
SMT process timed out in 40889ms, After SMT, problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 40896ms
[2024-06-01 15:16:10] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2024-06-01 15:16:10] [INFO ] Invariant cache hit.
[2024-06-01 15:16:10] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-06-01 15:16:10] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2024-06-01 15:16:10] [INFO ] Invariant cache hit.
[2024-06-01 15:16:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:16:21] [INFO ] Implicit Places using invariants and state equation in 10691 ms returned []
Implicit Place search using SMT with State Equation took 11064 ms to find 0 implicit places.
[2024-06-01 15:16:21] [INFO ] Redundant transitions in 26 ms returned []
Running 882 sub problems to find dead transitions.
[2024-06-01 15:16:21] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
[2024-06-01 15:16:21] [INFO ] Invariant cache hit.
[2024-06-01 15:16:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:16:26] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:16:26] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:16:26] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2024-06-01 15:16:26] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:16:26] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:16:26] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 0 ms to minimize.
[2024-06-01 15:16:27] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:16:27] [INFO ] Deduced a trap composed of 100 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:16:27] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:16:27] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:16:27] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:16:28] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:16:28] [INFO ] Deduced a trap composed of 188 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:16:28] [INFO ] Deduced a trap composed of 177 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:16:28] [INFO ] Deduced a trap composed of 154 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:16:29] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:16:29] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:16:29] [INFO ] Deduced a trap composed of 203 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:16:29] [INFO ] Deduced a trap composed of 155 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:16:29] [INFO ] Deduced a trap composed of 173 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:16:31] [INFO ] Deduced a trap composed of 200 places in 201 ms of which 2 ms to minimize.
[2024-06-01 15:16:31] [INFO ] Deduced a trap composed of 201 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:16:31] [INFO ] Deduced a trap composed of 219 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:16:31] [INFO ] Deduced a trap composed of 180 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:16:31] [INFO ] Deduced a trap composed of 196 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:16:31] [INFO ] Deduced a trap composed of 194 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:16:32] [INFO ] Deduced a trap composed of 198 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:16:32] [INFO ] Deduced a trap composed of 200 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:16:32] [INFO ] Deduced a trap composed of 200 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:16:32] [INFO ] Deduced a trap composed of 189 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:16:33] [INFO ] Deduced a trap composed of 109 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:16:33] [INFO ] Deduced a trap composed of 179 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:16:33] [INFO ] Deduced a trap composed of 172 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:16:34] [INFO ] Deduced a trap composed of 171 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:16:34] [INFO ] Deduced a trap composed of 190 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:16:34] [INFO ] Deduced a trap composed of 188 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:16:35] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:16:35] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:16:35] [INFO ] Deduced a trap composed of 185 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:16:36] [INFO ] Deduced a trap composed of 187 places in 230 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:16:44] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:16:44] [INFO ] Deduced a trap composed of 174 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:16:44] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:16:44] [INFO ] Deduced a trap composed of 154 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:16:45] [INFO ] Deduced a trap composed of 153 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:16:45] [INFO ] Deduced a trap composed of 144 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:16:45] [INFO ] Deduced a trap composed of 168 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:16:45] [INFO ] Deduced a trap composed of 177 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:16:46] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 1 ms to minimize.
[2024-06-01 15:16:46] [INFO ] Deduced a trap composed of 210 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:16:46] [INFO ] Deduced a trap composed of 219 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:16:46] [INFO ] Deduced a trap composed of 201 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 200 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 207 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 221 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 198 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 171 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 196 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:16:48] [INFO ] Deduced a trap composed of 194 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:16:48] [INFO ] Deduced a trap composed of 209 places in 185 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 211 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 188 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 217 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 186 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 216 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:16:51] [INFO ] Deduced a trap composed of 180 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:16:51] [INFO ] Deduced a trap composed of 182 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:16:52] [INFO ] Deduced a trap composed of 185 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1244 variables, and 104 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 68/104 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 15:17:09] [INFO ] Deduced a trap composed of 149 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:17:09] [INFO ] Deduced a trap composed of 163 places in 249 ms of which 3 ms to minimize.
[2024-06-01 15:17:10] [INFO ] Deduced a trap composed of 174 places in 249 ms of which 3 ms to minimize.
[2024-06-01 15:17:10] [INFO ] Deduced a trap composed of 147 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:17:10] [INFO ] Deduced a trap composed of 173 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:17:10] [INFO ] Deduced a trap composed of 155 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:17:11] [INFO ] Deduced a trap composed of 217 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:17:11] [INFO ] Deduced a trap composed of 214 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:17:11] [INFO ] Deduced a trap composed of 188 places in 199 ms of which 3 ms to minimize.
[2024-06-01 15:17:11] [INFO ] Deduced a trap composed of 174 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:17:12] [INFO ] Deduced a trap composed of 183 places in 243 ms of which 3 ms to minimize.
[2024-06-01 15:17:12] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 3 ms to minimize.
[2024-06-01 15:17:12] [INFO ] Deduced a trap composed of 175 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:17:12] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 2 ms to minimize.
[2024-06-01 15:17:13] [INFO ] Deduced a trap composed of 176 places in 222 ms of which 2 ms to minimize.
[2024-06-01 15:17:13] [INFO ] Deduced a trap composed of 192 places in 204 ms of which 2 ms to minimize.
[2024-06-01 15:17:13] [INFO ] Deduced a trap composed of 182 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:17:14] [INFO ] Deduced a trap composed of 200 places in 257 ms of which 2 ms to minimize.
[2024-06-01 15:17:14] [INFO ] Deduced a trap composed of 195 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:17:14] [INFO ] Deduced a trap composed of 185 places in 176 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1244 variables, and 124 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/882 constraints, Known Traps: 88/88 constraints]
After SMT, in 61102ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 61115ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113138 ms. Remains : 382/382 places, 886/886 transitions.
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-07 finished in 316694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 544 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 490 transition count 1258
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 430 transition count 1258
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 230 place count 428 transition count 1256
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 428 transition count 1256
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 352 place count 368 transition count 1196
Applied a total of 352 rules in 88 ms. Remains 368 /544 variables (removed 176) and now considering 1196/1372 (removed 176) transitions.
Running 1192 sub problems to find dead transitions.
[2024-06-01 15:17:22] [INFO ] Flow matrix only has 1172 transitions (discarded 24 similar events)
// Phase 1: matrix 1172 rows 368 cols
[2024-06-01 15:17:22] [INFO ] Computed 40 invariants in 22 ms
[2024-06-01 15:17:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 15:17:33] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2024-06-01 15:17:34] [INFO ] Deduced a trap composed of 56 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:17:34] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-06-01 15:17:40] [INFO ] Deduced a trap composed of 133 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:17:40] [INFO ] Deduced a trap composed of 121 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:17:40] [INFO ] Deduced a trap composed of 120 places in 186 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1540 variables, and 40 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 22/28 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1192/1192 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 15:17:49] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:17:50] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:17:50] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 15:18:01] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:18:04] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1540 variables, and 45 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 22/28 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1192 constraints, Known Traps: 11/11 constraints]
After SMT, in 44703ms problems are : Problem set: 0 solved, 1192 unsolved
Search for dead transitions found 0 dead transitions in 44716ms
[2024-06-01 15:18:07] [INFO ] Flow matrix only has 1172 transitions (discarded 24 similar events)
[2024-06-01 15:18:07] [INFO ] Invariant cache hit.
[2024-06-01 15:18:07] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-06-01 15:18:07] [INFO ] Flow matrix only has 1172 transitions (discarded 24 similar events)
[2024-06-01 15:18:07] [INFO ] Invariant cache hit.
[2024-06-01 15:18:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:18:12] [INFO ] Implicit Places using invariants and state equation in 5409 ms returned []
Implicit Place search using SMT with State Equation took 5776 ms to find 0 implicit places.
[2024-06-01 15:18:13] [INFO ] Redundant transitions in 38 ms returned []
Running 1192 sub problems to find dead transitions.
[2024-06-01 15:18:13] [INFO ] Flow matrix only has 1172 transitions (discarded 24 similar events)
[2024-06-01 15:18:13] [INFO ] Invariant cache hit.
[2024-06-01 15:18:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 15:18:23] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:18:23] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:18:24] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2024-06-01 15:18:29] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 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 TDEAD772 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/368 variables, 6/44 constraints. Problems are: Problem set: 324 solved, 868 unsolved
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/1540 variables, and 50 constraints, problems are : Problem set: 324 solved, 868 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1192/1192 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 324 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 324 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 22/34 constraints. Problems are: Problem set: 324 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 10/44 constraints. Problems are: Problem set: 324 solved, 868 unsolved
[2024-06-01 15:18:49] [INFO ] Deduced a trap composed of 171 places in 243 ms of which 2 ms to minimize.
[2024-06-01 15:18:49] [INFO ] Deduced a trap composed of 169 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:18:50] [INFO ] Deduced a trap composed of 169 places in 222 ms of which 2 ms to minimize.
[2024-06-01 15:18:50] [INFO ] Deduced a trap composed of 167 places in 185 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 4/48 constraints. Problems are: Problem set: 324 solved, 868 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/48 constraints. Problems are: Problem set: 324 solved, 868 unsolved
At refinement iteration 5 (OVERLAPS) 4/368 variables, 6/54 constraints. Problems are: Problem set: 324 solved, 868 unsolved
[2024-06-01 15:19:07] [INFO ] Deduced a trap composed of 159 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:19:10] [INFO ] Deduced a trap composed of 207 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:19:10] [INFO ] Deduced a trap composed of 125 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:19:11] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 2 ms to minimize.
[2024-06-01 15:19:11] [INFO ] Deduced a trap composed of 187 places in 205 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/1540 variables, and 59 constraints, problems are : Problem set: 324 solved, 868 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/368 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1192 constraints, Known Traps: 19/19 constraints]
After SMT, in 63554ms problems are : Problem set: 324 solved, 868 unsolved
Search for dead transitions found 324 dead transitions in 63569ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) removed 324 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 368/544 places, 872/1372 transitions.
Applied a total of 0 rules in 12 ms. Remains 368 /368 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-06-01 15:19:16] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 114260 ms. Remains : 368/544 places, 872/1372 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-09
Product exploration explored 100000 steps with 13 reset in 364 ms.
Stack based approach found an accepted trace after 2083 steps with 0 reset with depth 2084 and stack size 2084 in 14 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-09 finished in 114715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X((X(X(G(p1)))&&F(p0)))))))'
Support contains 3 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 544 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 490 transition count 1258
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 430 transition count 1258
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 230 place count 428 transition count 1256
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 428 transition count 1256
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 350 place count 369 transition count 1197
Applied a total of 350 rules in 63 ms. Remains 369 /544 variables (removed 175) and now considering 1197/1372 (removed 175) transitions.
Running 1193 sub problems to find dead transitions.
[2024-06-01 15:19:17] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-06-01 15:19:17] [INFO ] Computed 40 invariants in 13 ms
[2024-06-01 15:19:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 15:19:27] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:19:27] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:19:28] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:19:28] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:19:28] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:19:28] [INFO ] Deduced a trap composed of 47 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:19:28] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:19:28] [INFO ] Deduced a trap composed of 80 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:19:29] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:19:29] [INFO ] Deduced a trap composed of 123 places in 218 ms of which 2 ms to minimize.
[2024-06-01 15:19:30] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 2 ms to minimize.
[2024-06-01 15:19:30] [INFO ] Deduced a trap composed of 121 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:19:30] [INFO ] Deduced a trap composed of 128 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:19:31] [INFO ] Deduced a trap composed of 206 places in 258 ms of which 2 ms to minimize.
[2024-06-01 15:19:35] [INFO ] Deduced a trap composed of 150 places in 259 ms of which 2 ms to minimize.
[2024-06-01 15:19:39] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 2 ms to minimize.
[2024-06-01 15:19:39] [INFO ] Deduced a trap composed of 174 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:19:40] [INFO ] Deduced a trap composed of 157 places in 194 ms of which 1 ms to minimize.
[2024-06-01 15:19:40] [INFO ] Deduced a trap composed of 183 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:19:40] [INFO ] Deduced a trap composed of 185 places in 232 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 (/ 39.0 4.0))
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 (/ 1.0 4.0))
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 (/ 1.0 4.0))
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 (/ 3.0 4.0))
(s54 0.0)
(s55 (/ 3.0 4.0))
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 (/ 1.0 4.0))
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 (/ 13.0 2.0))
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 55 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 15:19:54] [INFO ] Deduced a trap composed of 140 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:19:59] [INFO ] Deduced a trap composed of 172 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:20:00] [INFO ] Deduced a trap composed of 179 places in 174 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 58 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 23/23 constraints]
After SMT, in 44595ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 44606ms
[2024-06-01 15:20:01] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-06-01 15:20:01] [INFO ] Invariant cache hit.
[2024-06-01 15:20:02] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-01 15:20:02] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-06-01 15:20:02] [INFO ] Invariant cache hit.
[2024-06-01 15:20:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:20:10] [INFO ] Implicit Places using invariants and state equation in 8172 ms returned []
Implicit Place search using SMT with State Equation took 8506 ms to find 0 implicit places.
[2024-06-01 15:20:10] [INFO ] Redundant transitions in 19 ms returned []
Running 1193 sub problems to find dead transitions.
[2024-06-01 15:20:10] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-06-01 15:20:10] [INFO ] Invariant cache hit.
[2024-06-01 15:20:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 15:20:21] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:20:21] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2024-06-01 15:20:21] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:20:21] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:20:21] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2024-06-01 15:20:21] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:20:22] [INFO ] Deduced a trap composed of 58 places in 250 ms of which 2 ms to minimize.
[2024-06-01 15:20:22] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:20:22] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:20:23] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:20:24] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 3 ms to minimize.
[2024-06-01 15:20:24] [INFO ] Deduced a trap composed of 130 places in 209 ms of which 2 ms to minimize.
[2024-06-01 15:20:24] [INFO ] Deduced a trap composed of 121 places in 219 ms of which 2 ms to minimize.
[2024-06-01 15:20:28] [INFO ] Deduced a trap composed of 152 places in 262 ms of which 2 ms to minimize.
[2024-06-01 15:20:31] [INFO ] Deduced a trap composed of 121 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:20:31] [INFO ] Deduced a trap composed of 174 places in 176 ms of which 1 ms to minimize.
[2024-06-01 15:20:31] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 1 ms to minimize.
[2024-06-01 15:20:32] [INFO ] Deduced a trap composed of 149 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:20:32] [INFO ] Deduced a trap composed of 160 places in 254 ms of which 3 ms to minimize.
[2024-06-01 15:20:32] [INFO ] Deduced a trap composed of 140 places in 284 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 15:20:36] [INFO ] Deduced a trap composed of 185 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:20:42] [INFO ] Deduced a trap composed of 174 places in 327 ms of which 3 ms to minimize.
[2024-06-01 15:20:43] [INFO ] Deduced a trap composed of 169 places in 271 ms of which 3 ms to minimize.
[2024-06-01 15:20:43] [INFO ] Deduced a trap composed of 190 places in 222 ms of which 3 ms to minimize.
[2024-06-01 15:20:43] [INFO ] Deduced a trap composed of 184 places in 189 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 60 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 15:20:49] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 61 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 26/26 constraints]
After SMT, in 65360ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 65371ms
Starting structural reductions in SI_LTL mode, iteration 1 : 369/544 places, 1197/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118578 ms. Remains : 369/544 places, 1197/1372 transitions.
Stuttering acceptance computed with spot in 464 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-11
Stuttering criterion allowed to conclude after 3669 steps with 7 reset in 14 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-11 finished in 119117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 1 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 544 transition count 1319
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 491 transition count 1319
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 106 place count 491 transition count 1259
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 226 place count 431 transition count 1259
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 228 place count 429 transition count 1257
Iterating global reduction 2 with 2 rules applied. Total rules applied 230 place count 429 transition count 1257
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 348 place count 370 transition count 1198
Applied a total of 348 rules in 49 ms. Remains 370 /544 variables (removed 174) and now considering 1198/1372 (removed 174) transitions.
Running 1194 sub problems to find dead transitions.
[2024-06-01 15:21:16] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
// Phase 1: matrix 1174 rows 370 cols
[2024-06-01 15:21:16] [INFO ] Computed 40 invariants in 13 ms
[2024-06-01 15:21:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 15:21:27] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:21:27] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 33 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 0 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 15:21:49] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:21:51] [INFO ] Deduced a trap composed of 59 places in 359 ms of which 2 ms to minimize.
[2024-06-01 15:21:52] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 15:21:58] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 42 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 11/11 constraints]
After SMT, in 44952ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 44962ms
[2024-06-01 15:22:01] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-06-01 15:22:01] [INFO ] Invariant cache hit.
[2024-06-01 15:22:01] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-06-01 15:22:01] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-06-01 15:22:01] [INFO ] Invariant cache hit.
[2024-06-01 15:22:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:22:09] [INFO ] Implicit Places using invariants and state equation in 8349 ms returned []
Implicit Place search using SMT with State Equation took 8724 ms to find 0 implicit places.
[2024-06-01 15:22:10] [INFO ] Redundant transitions in 29 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-06-01 15:22:10] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-06-01 15:22:10] [INFO ] Invariant cache hit.
[2024-06-01 15:22:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 15:22:21] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:22:21] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:22:23] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD810 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/367 variables, 1/35 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/1544 variables, and 35 constraints, problems are : Problem set: 90 solved, 1104 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 90 solved, 1104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 10/10 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 21/31 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 3/34 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/34 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
At refinement iteration 4 (OVERLAPS) 1/367 variables, 1/35 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 1 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 6/41 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/41 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD807 is UNSAT
At refinement iteration 7 (OVERLAPS) 3/370 variables, 8/49 constraints. Problems are: Problem set: 324 solved, 870 unsolved
[2024-06-01 15:23:12] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:23:12] [INFO ] Deduced a trap composed of 170 places in 285 ms of which 2 ms to minimize.
[2024-06-01 15:23:12] [INFO ] Deduced a trap composed of 173 places in 260 ms of which 2 ms to minimize.
[2024-06-01 15:23:13] [INFO ] Deduced a trap composed of 174 places in 231 ms of which 2 ms to minimize.
[2024-06-01 15:23:13] [INFO ] Deduced a trap composed of 37 places in 245 ms of which 2 ms to minimize.
[2024-06-01 15:23:13] [INFO ] Deduced a trap composed of 151 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:23:14] [INFO ] Deduced a trap composed of 171 places in 246 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1544 variables, and 56 constraints, problems are : Problem set: 324 solved, 870 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 16/16 constraints]
After SMT, in 65211ms problems are : Problem set: 324 solved, 870 unsolved
Search for dead transitions found 324 dead transitions in 65224ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) removed 324 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 370/544 places, 874/1372 transitions.
Applied a total of 0 rules in 14 ms. Remains 370 /370 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-06-01 15:23:15] [INFO ] Redundant transitions in 15 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 119047 ms. Remains : 370/544 places, 874/1372 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-12
Product exploration explored 100000 steps with 19 reset in 407 ms.
Stack based approach found an accepted trace after 1061 steps with 0 reset with depth 1062 and stack size 1062 in 5 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-12 finished in 119502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 5 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 33 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 15:23:15] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-06-01 15:23:15] [INFO ] Computed 40 invariants in 17 ms
[2024-06-01 15:23:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:23:29] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:23:31] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:23:46] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 3 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 0 ms to minimize.
[2024-06-01 15:23:49] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:23:49] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:23:57] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 41 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 11/11 constraints]
After SMT, in 44783ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44795ms
[2024-06-01 15:24:00] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 15:24:00] [INFO ] Invariant cache hit.
[2024-06-01 15:24:00] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-06-01 15:24:00] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 15:24:00] [INFO ] Invariant cache hit.
[2024-06-01 15:24:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:24:10] [INFO ] Implicit Places using invariants and state equation in 9904 ms returned []
Implicit Place search using SMT with State Equation took 10310 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-06-01 15:24:10] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 15:24:10] [INFO ] Invariant cache hit.
[2024-06-01 15:24:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:24:27] [INFO ] Deduced a trap composed of 3 places in 480 ms of which 5 ms to minimize.
[2024-06-01 15:24:28] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:24:38] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 33 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:24:55] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 2 ms to minimize.
[2024-06-01 15:24:55] [INFO ] Deduced a trap composed of 75 places in 217 ms of which 2 ms to minimize.
[2024-06-01 15:24:55] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:24:55] [INFO ] Deduced a trap composed of 74 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:24:55] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:24:55] [INFO ] Deduced a trap composed of 74 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:25:05] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 1 ms to minimize.
[2024-06-01 15:25:12] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:25:12] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:25:12] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 13/13 constraints]
After SMT, in 66239ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 66251ms
Starting structural reductions in LTL mode, iteration 1 : 532/544 places, 1360/1372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121395 ms. Remains : 532/544 places, 1360/1372 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-13
Stuttering criterion allowed to conclude after 37312 steps with 0 reset in 109 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-13 finished in 121589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 43 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 15:25:17] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 15:25:17] [INFO ] Invariant cache hit.
[2024-06-01 15:25:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:25:32] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:25:34] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:25:54] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 33 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 3/3 constraints]
After SMT, in 45152ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45170ms
[2024-06-01 15:26:02] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 15:26:02] [INFO ] Invariant cache hit.
[2024-06-01 15:26:02] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-06-01 15:26:02] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 15:26:02] [INFO ] Invariant cache hit.
[2024-06-01 15:26:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:26:13] [INFO ] Implicit Places using invariants and state equation in 10190 ms returned []
Implicit Place search using SMT with State Equation took 10581 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-06-01 15:26:13] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 15:26:13] [INFO ] Invariant cache hit.
[2024-06-01 15:26:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:26:27] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:26:28] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:26:38] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 33 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:26:57] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 2 ms to minimize.
[2024-06-01 15:26:57] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 1 ms to minimize.
[2024-06-01 15:26:57] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:26:57] [INFO ] Deduced a trap composed of 74 places in 194 ms of which 2 ms to minimize.
[2024-06-01 15:26:58] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:26:58] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:27:06] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:27:13] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 3 ms to minimize.
[2024-06-01 15:27:13] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:27:13] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:27:18] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 1 ms to minimize.
[2024-06-01 15:27:18] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 2 ms to minimize.
SMT process timed out in 65401ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 65416ms
Starting structural reductions in LTL mode, iteration 1 : 532/544 places, 1360/1372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121220 ms. Remains : 532/544 places, 1360/1372 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 500 ms.
Product exploration explored 100000 steps with 50000 reset in 514 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-14 finished in 122323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 544 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 490 transition count 1258
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 430 transition count 1258
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 230 place count 428 transition count 1256
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 428 transition count 1256
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 350 place count 369 transition count 1197
Applied a total of 350 rules in 71 ms. Remains 369 /544 variables (removed 175) and now considering 1197/1372 (removed 175) transitions.
Running 1193 sub problems to find dead transitions.
[2024-06-01 15:27:19] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-06-01 15:27:19] [INFO ] Computed 40 invariants in 18 ms
[2024-06-01 15:27:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 15:27:30] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:27:35] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
SMT process timed out in 24468ms, After SMT, problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 24478ms
[2024-06-01 15:27:44] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-06-01 15:27:44] [INFO ] Invariant cache hit.
[2024-06-01 15:27:44] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-06-01 15:27:44] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-06-01 15:27:44] [INFO ] Invariant cache hit.
[2024-06-01 15:27:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:27:52] [INFO ] Implicit Places using invariants and state equation in 7985 ms returned []
Implicit Place search using SMT with State Equation took 8347 ms to find 0 implicit places.
[2024-06-01 15:27:52] [INFO ] Redundant transitions in 48 ms returned []
Running 1193 sub problems to find dead transitions.
[2024-06-01 15:27:52] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-06-01 15:27:52] [INFO ] Invariant cache hit.
[2024-06-01 15:27:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 15:28:03] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 15:28:18] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 28 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 15/29 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD809 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/366 variables, 1/29 constraints. Problems are: Problem set: 90 solved, 1103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/29 constraints. Problems are: Problem set: 90 solved, 1103 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD806 is UNSAT
At refinement iteration 6 (OVERLAPS) 3/369 variables, 14/43 constraints. Problems are: Problem set: 324 solved, 869 unsolved
[2024-06-01 15:28:46] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:28:46] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:28:46] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:28:46] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:28:46] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:28:46] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:28:47] [INFO ] Deduced a trap composed of 27 places in 311 ms of which 3 ms to minimize.
[2024-06-01 15:28:47] [INFO ] Deduced a trap composed of 140 places in 308 ms of which 3 ms to minimize.
[2024-06-01 15:28:48] [INFO ] Deduced a trap composed of 131 places in 296 ms of which 2 ms to minimize.
[2024-06-01 15:28:48] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 2 ms to minimize.
[2024-06-01 15:28:48] [INFO ] Deduced a trap composed of 121 places in 265 ms of which 2 ms to minimize.
[2024-06-01 15:28:49] [INFO ] Deduced a trap composed of 184 places in 306 ms of which 3 ms to minimize.
[2024-06-01 15:28:50] [INFO ] Deduced a trap composed of 180 places in 303 ms of which 2 ms to minimize.
[2024-06-01 15:28:50] [INFO ] Deduced a trap composed of 167 places in 218 ms of which 2 ms to minimize.
[2024-06-01 15:28:50] [INFO ] Deduced a trap composed of 160 places in 280 ms of which 3 ms to minimize.
[2024-06-01 15:28:52] [INFO ] Deduced a trap composed of 123 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:28:52] [INFO ] Deduced a trap composed of 173 places in 308 ms of which 3 ms to minimize.
[2024-06-01 15:28:56] [INFO ] Deduced a trap composed of 174 places in 307 ms of which 3 ms to minimize.
[2024-06-01 15:28:56] [INFO ] Deduced a trap composed of 178 places in 237 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/1542 variables, and 62 constraints, problems are : Problem set: 324 solved, 869 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 22/22 constraints]
After SMT, in 64797ms problems are : Problem set: 324 solved, 869 unsolved
Search for dead transitions found 324 dead transitions in 64807ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) removed 324 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 369/544 places, 873/1372 transitions.
Applied a total of 0 rules in 16 ms. Remains 369 /369 variables (removed 0) and now considering 873/873 (removed 0) transitions.
[2024-06-01 15:28:57] [INFO ] Redundant transitions in 14 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 97813 ms. Remains : 369/544 places, 873/1372 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-15
Stuttering criterion allowed to conclude after 9021 steps with 61 reset in 43 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-15 finished in 97909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((F(p1) U p2) U p3)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 15:28:58] [INFO ] Flatten gal took : 139 ms
[2024-06-01 15:28:58] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 15:28:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 544 places, 1372 transitions and 6956 arcs took 13 ms.
Total runtime 2069055 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-LTLFireability-00
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-LTLFireability-02
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-LTLFireability-07

BK_STOP 1717256426406

--------------------
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 PolyORBLF-PT-S04J04T06-LTLFireability-00
ltl formula formula --ltl=/tmp/5919/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 544 places, 1372 transitions and 6956 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.070 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5919/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5919/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5919/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5919/ltl_0_
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(): invalid chunk size
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(): invalid chunk size
ltl formula name PolyORBLF-PT-S04J04T06-LTLFireability-02
ltl formula formula --ltl=/tmp/5919/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 544 places, 1372 transitions and 6956 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5919/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5919/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5919/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.050 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5919/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 565 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 545, there are 1379 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): ~62 levels ~10000 states ~13028 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~20000 states ~26068 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~40000 states ~62108 transitions
pnml2lts-mc( 3/ 4): ~73 levels ~80000 states ~128716 transitions
pnml2lts-mc( 3/ 4): ~73 levels ~160000 states ~261648 transitions
pnml2lts-mc( 3/ 4): ~73 levels ~320000 states ~541940 transitions
pnml2lts-mc( 3/ 4): ~73 levels ~640000 states ~1086352 transitions
pnml2lts-mc( 3/ 4): ~73 levels ~1280000 states ~2167456 transitions
pnml2lts-mc( 3/ 4): ~73 levels ~2560000 states ~4336884 transitions
pnml2lts-mc( 2/ 4): ~84 levels ~5120000 states ~12448720 transitions
pnml2lts-mc( 2/ 4): ~84 levels ~10240000 states ~25383128 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8616092
pnml2lts-mc( 0/ 4): unique states count: 8616361
pnml2lts-mc( 0/ 4): unique transitions count: 21644893
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 13027710
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8616404
pnml2lts-mc( 0/ 4): - cum. max stack depth: 385
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8616404 states 21644990 transitions, fanout: 2.512
pnml2lts-mc( 0/ 4): Total exploration time 264.670 sec (264.650 sec minimum, 264.660 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32555, Transitions per second: 81781
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 129.7MB, 15.8 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 25.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1402 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 129.7MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T06-LTLFireability-07
ltl formula formula --ltl=/tmp/5919/ltl_2_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 544 places, 1372 transitions and 6956 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.050 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5919/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5919/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5919/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5919/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 565 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 545, there are 1375 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): ~234 levels ~10000 states ~19996 transitions
pnml2lts-mc( 0/ 4): ~234 levels ~20000 states ~40068 transitions
pnml2lts-mc( 0/ 4): ~234 levels ~40000 states ~82628 transitions
pnml2lts-mc( 3/ 4): ~237 levels ~80000 states ~160540 transitions
pnml2lts-mc( 3/ 4): ~237 levels ~160000 states ~346060 transitions
pnml2lts-mc( 3/ 4): ~237 levels ~320000 states ~836940 transitions
pnml2lts-mc( 3/ 4): ~237 levels ~640000 states ~1977312 transitions
pnml2lts-mc( 3/ 4): ~237 levels ~1280000 states ~4065284 transitions
pnml2lts-mc( 3/ 4): ~252 levels ~2560000 states ~8395120 transitions
pnml2lts-mc( 3/ 4): ~252 levels ~5120000 states ~16978732 transitions
pnml2lts-mc( 2/ 4): ~237 levels ~10240000 states ~25619996 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13830319
pnml2lts-mc( 0/ 4): unique states count: 13831087
pnml2lts-mc( 0/ 4): unique transitions count: 45465535
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 31633729
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 13831098
pnml2lts-mc( 0/ 4): - cum. max stack depth: 970
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13831098 states 45465587 transitions, fanout: 3.287
pnml2lts-mc( 0/ 4): Total exploration time 420.540 sec (420.520 sec minimum, 420.525 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32889, Transitions per second: 108112
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 169.5MB, 12.9 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 41.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1402 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 169.5MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J04T06"
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 PolyORBLF-PT-S04J04T06, 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-171654446700268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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