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.r290-tajo-171654446600220.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 itstools
Input is PolyORBLF-PT-S02J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446600220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 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 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 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 862K 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-S02J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716912983269

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 16:16:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 16:16:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:16:24] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-28 16:16:24] [INFO ] Transformed 476 places.
[2024-05-28 16:16:24] [INFO ] Transformed 920 transitions.
[2024-05-28 16:16:24] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 220 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 462 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 462 transition count 812
Applied a total of 26 rules in 75 ms. Remains 462 /476 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:16:25] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 462 cols
[2024-05-28 16:16:25] [INFO ] Computed 44 invariants in 43 ms
[2024-05-28 16:16:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:16:32] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 14 ms to minimize.
[2024-05-28 16:16:32] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:16:32] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:16:32] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:16:32] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:16:32] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 2 ms to minimize.
[2024-05-28 16:16:33] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:16:33] [INFO ] Deduced a trap composed of 127 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:16:33] [INFO ] Deduced a trap composed of 225 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:16:33] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:16:33] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:16:34] [INFO ] Deduced a trap composed of 222 places in 227 ms of which 3 ms to minimize.
[2024-05-28 16:16:36] [INFO ] Deduced a trap composed of 228 places in 224 ms of which 4 ms to minimize.
[2024-05-28 16:16:36] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 4 ms to minimize.
[2024-05-28 16:16:37] [INFO ] Deduced a trap composed of 256 places in 201 ms of which 3 ms to minimize.
[2024-05-28 16:16:37] [INFO ] Deduced a trap composed of 240 places in 230 ms of which 4 ms to minimize.
[2024-05-28 16:16:37] [INFO ] Deduced a trap composed of 240 places in 262 ms of which 4 ms to minimize.
[2024-05-28 16:16:38] [INFO ] Deduced a trap composed of 223 places in 234 ms of which 5 ms to minimize.
[2024-05-28 16:16:38] [INFO ] Deduced a trap composed of 289 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:16:41] [INFO ] Deduced a trap composed of 259 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:16:45] [INFO ] Deduced a trap composed of 298 places in 233 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1262 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:17:04] [INFO ] Deduced a trap composed of 248 places in 287 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1262 variables, and 64 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 22/22 constraints]
After SMT, in 41085ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 41117ms
[2024-05-28 16:17:06] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:17:06] [INFO ] Invariant cache hit.
[2024-05-28 16:17:06] [INFO ] Implicit Places using invariants in 253 ms returned [235, 271, 274, 410, 422]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 260 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 457/476 places, 812/824 transitions.
Applied a total of 0 rules in 8 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41518 ms. Remains : 457/476 places, 812/824 transitions.
Support contains 220 out of 457 places after structural reductions.
[2024-05-28 16:17:06] [INFO ] Flatten gal took : 89 ms
[2024-05-28 16:17:06] [INFO ] Flatten gal took : 51 ms
[2024-05-28 16:17:06] [INFO ] Input system was already deterministic with 812 transitions.
Support contains 180 out of 457 places (down from 220) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 2816 ms. (14 steps per ms) remains 4/30 properties
BEST_FIRST walk for 40001 steps (11 resets) in 589 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (11 resets) in 322 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (13 resets) in 319 ms. (125 steps per ms) remains 4/4 properties
[2024-05-28 16:17:08] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2024-05-28 16:17:08] [INFO ] Computed 39 invariants in 17 ms
[2024-05-28 16:17:08] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem AtomicPropp28 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 328/339 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 52/391 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/395 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 8 (OVERLAPS) 57/452 variables, 24/35 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-28 16:17:08] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:17:08] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:17:08] [INFO ] Deduced a trap composed of 65 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:17:08] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:17:09] [INFO ] Deduced a trap composed of 252 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:17:09] [INFO ] Deduced a trap composed of 264 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:17:09] [INFO ] Deduced a trap composed of 250 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:17:09] [INFO ] Deduced a trap composed of 263 places in 152 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 8/43 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-28 16:17:09] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 1/44 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/455 variables, 3/47 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/455 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 800/1255 variables, 455/502 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1255 variables, 72/574 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1255 variables, 0/574 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1257 variables, 2/576 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1257 variables, 1/577 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1257 variables, 0/577 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1257 variables, 0/577 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1257/1257 variables, and 577 constraints, problems are : Problem set: 3 solved, 1 unsolved in 2523 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 457/457 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 330/336 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/388 variables, 6/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/392 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/452 variables, 25/35 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 9/44 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/455 variables, 3/47 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1255/1257 variables, and 502 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1236 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 455/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 3803ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 6 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 812/812 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 457 transition count 770
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 415 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 415 transition count 722
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 367 transition count 722
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 2 with 96 rules applied. Total rules applied 276 place count 319 transition count 674
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 280 place count 315 transition count 670
Iterating global reduction 2 with 4 rules applied. Total rules applied 284 place count 315 transition count 670
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 296 place count 315 transition count 658
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 308 place count 303 transition count 658
Applied a total of 308 rules in 180 ms. Remains 303 /457 variables (removed 154) and now considering 658/812 (removed 154) transitions.
Running 656 sub problems to find dead transitions.
[2024-05-28 16:17:12] [INFO ] Flow matrix only has 646 transitions (discarded 12 similar events)
// Phase 1: matrix 646 rows 303 cols
[2024-05-28 16:17:12] [INFO ] Computed 39 invariants in 14 ms
[2024-05-28 16:17:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 656 unsolved
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 6 ms to minimize.
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:17:17] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:17:17] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:17:17] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:17:18] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:17:18] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:17:19] [INFO ] Deduced a trap composed of 111 places in 180 ms of which 2 ms to minimize.
[2024-05-28 16:17:20] [INFO ] Deduced a trap composed of 101 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:17:20] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:17:20] [INFO ] Deduced a trap composed of 116 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:17:20] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:17:21] [INFO ] Deduced a trap composed of 129 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:17:21] [INFO ] Deduced a trap composed of 126 places in 210 ms of which 2 ms to minimize.
[2024-05-28 16:17:21] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:17:22] [INFO ] Deduced a trap composed of 185 places in 219 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 656 unsolved
[2024-05-28 16:17:25] [INFO ] Deduced a trap composed of 102 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:17:25] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 2 ms to minimize.
[2024-05-28 16:17:26] [INFO ] Deduced a trap composed of 126 places in 189 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 656 unsolved
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/303 variables, 2/62 constraints. Problems are: Problem set: 66 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 303/949 variables, and 62 constraints, problems are : Problem set: 66 solved, 590 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 656/656 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 66 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 66 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 24/37 constraints. Problems are: Problem set: 66 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 23/60 constraints. Problems are: Problem set: 66 solved, 590 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/60 constraints. Problems are: Problem set: 66 solved, 590 unsolved
At refinement iteration 4 (OVERLAPS) 2/303 variables, 2/62 constraints. Problems are: Problem set: 66 solved, 590 unsolved
[2024-05-28 16:17:47] [INFO ] Deduced a trap composed of 100 places in 192 ms of which 2 ms to minimize.
[2024-05-28 16:17:50] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
[2024-05-28 16:17:50] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:17:53] [INFO ] Deduced a trap composed of 105 places in 222 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/949 variables, and 66 constraints, problems are : Problem set: 66 solved, 590 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/656 constraints, Known Traps: 27/27 constraints]
After SMT, in 41222ms problems are : Problem set: 66 solved, 590 unsolved
Search for dead transitions found 66 dead transitions in 41234ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 303/457 places, 592/812 transitions.
Reduce places removed 2 places and 12 transitions.
Graph (complete) has 1790 edges and 301 vertex of which 6 are kept as prefixes of interest. Removing 295 places using SCC suffix rule.1 ms
Discarding 295 places :
Also discarding 574 output transitions
Drop transitions (Output transitions of discarded places.) removed 574 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 6 transition count 6
Reduce places removed 0 places and 6 transitions.
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 3 rules in 11 ms. Remains 6 /303 variables (removed 297) and now considering 0/592 (removed 592) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41429 ms. Remains : 6/457 places, 0/812 transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 12 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 812/812 transitions.
Applied a total of 0 rules in 7 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:17:53] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2024-05-28 16:17:53] [INFO ] Computed 39 invariants in 16 ms
[2024-05-28 16:17:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:17:59] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:18:00] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:18:00] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:18:00] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:18:00] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 104 places in 207 ms of which 5 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 130 places in 219 ms of which 3 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 237 places in 235 ms of which 3 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:18:02] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:18:02] [INFO ] Deduced a trap composed of 64 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:18:02] [INFO ] Deduced a trap composed of 222 places in 240 ms of which 4 ms to minimize.
[2024-05-28 16:18:03] [INFO ] Deduced a trap composed of 253 places in 245 ms of which 4 ms to minimize.
[2024-05-28 16:18:03] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:18:05] [INFO ] Deduced a trap composed of 219 places in 201 ms of which 3 ms to minimize.
[2024-05-28 16:18:05] [INFO ] Deduced a trap composed of 236 places in 233 ms of which 3 ms to minimize.
[2024-05-28 16:18:06] [INFO ] Deduced a trap composed of 298 places in 212 ms of which 4 ms to minimize.
[2024-05-28 16:18:09] [INFO ] Deduced a trap composed of 231 places in 244 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 56 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:18:24] [INFO ] Deduced a trap composed of 255 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:18:27] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 21/21 constraints]
After SMT, in 40930ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40940ms
[2024-05-28 16:18:34] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:18:34] [INFO ] Invariant cache hit.
[2024-05-28 16:18:35] [INFO ] Implicit Places using invariants in 459 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 461 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/457 places, 812/812 transitions.
Applied a total of 0 rules in 10 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41423 ms. Remains : 456/457 places, 812/812 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-00 finished in 41732 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&&G(!p1))) U X(X(!p2))))'
Support contains 33 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 812/812 transitions.
Applied a total of 0 rules in 7 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:18:35] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:18:35] [INFO ] Invariant cache hit.
[2024-05-28 16:18:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:18:42] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:18:42] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:18:42] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:18:42] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:18:43] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 1 ms to minimize.
[2024-05-28 16:18:43] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:18:43] [INFO ] Deduced a trap composed of 127 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:18:43] [INFO ] Deduced a trap composed of 229 places in 189 ms of which 2 ms to minimize.
[2024-05-28 16:18:44] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:18:44] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:18:44] [INFO ] Deduced a trap composed of 222 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:18:45] [INFO ] Deduced a trap composed of 218 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:18:47] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 3 ms to minimize.
[2024-05-28 16:18:47] [INFO ] Deduced a trap composed of 252 places in 180 ms of which 2 ms to minimize.
[2024-05-28 16:18:48] [INFO ] Deduced a trap composed of 229 places in 191 ms of which 2 ms to minimize.
[2024-05-28 16:18:48] [INFO ] Deduced a trap composed of 230 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:18:48] [INFO ] Deduced a trap composed of 231 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:18:51] [INFO ] Deduced a trap composed of 264 places in 185 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:19:10] [INFO ] Deduced a trap composed of 218 places in 275 ms of which 4 ms to minimize.
[2024-05-28 16:19:10] [INFO ] Deduced a trap composed of 244 places in 219 ms of which 3 ms to minimize.
[2024-05-28 16:19:10] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 4 ms to minimize.
[2024-05-28 16:19:14] [INFO ] Deduced a trap composed of 86 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:19:15] [INFO ] Deduced a trap composed of 205 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:19:15] [INFO ] Deduced a trap composed of 298 places in 222 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 455/1257 variables, and 61 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 24/24 constraints]
After SMT, in 40958ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40974ms
[2024-05-28 16:19:16] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:19:16] [INFO ] Invariant cache hit.
[2024-05-28 16:19:16] [INFO ] Implicit Places using invariants in 446 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 450 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/457 places, 812/812 transitions.
Applied a total of 0 rules in 7 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41443 ms. Remains : 456/457 places, 812/812 transitions.
Stuttering acceptance computed with spot in 494 ms :[p2, (OR (AND (NOT p0) p2) (AND p1 p2)), p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), p2, (AND p1 p2), (OR (NOT p0) p1), p1]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 597 ms.
Product exploration explored 100000 steps with 33333 reset in 443 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 14 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-01 finished in 43034 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 U (p1||G(!p0)))||F(G(p2)))))'
Support contains 50 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 812/812 transitions.
Applied a total of 0 rules in 5 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:19:18] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:19:18] [INFO ] Invariant cache hit.
[2024-05-28 16:19:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:19:24] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:19:24] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:19:26] [INFO ] Deduced a trap composed of 127 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:19:26] [INFO ] Deduced a trap composed of 229 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:19:26] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:19:26] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:19:27] [INFO ] Deduced a trap composed of 222 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:19:28] [INFO ] Deduced a trap composed of 218 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:19:29] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 3 ms to minimize.
[2024-05-28 16:19:30] [INFO ] Deduced a trap composed of 252 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:19:30] [INFO ] Deduced a trap composed of 229 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:19:30] [INFO ] Deduced a trap composed of 230 places in 188 ms of which 2 ms to minimize.
[2024-05-28 16:19:31] [INFO ] Deduced a trap composed of 231 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:19:33] [INFO ] Deduced a trap composed of 264 places in 199 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:19:53] [INFO ] Deduced a trap composed of 256 places in 176 ms of which 4 ms to minimize.
[2024-05-28 16:19:53] [INFO ] Deduced a trap composed of 244 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:19:54] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 3 ms to minimize.
[2024-05-28 16:19:55] [INFO ] Deduced a trap composed of 306 places in 256 ms of which 4 ms to minimize.
[2024-05-28 16:19:56] [INFO ] Deduced a trap composed of 247 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:19:56] [INFO ] Deduced a trap composed of 266 places in 188 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 61 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 24/24 constraints]
After SMT, in 40776ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40785ms
[2024-05-28 16:19:59] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:19:59] [INFO ] Invariant cache hit.
[2024-05-28 16:19:59] [INFO ] Implicit Places using invariants in 449 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 463 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/457 places, 812/812 transitions.
Applied a total of 0 rules in 6 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41262 ms. Remains : 456/457 places, 812/812 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-02
Product exploration explored 100000 steps with 4158 reset in 455 ms.
Product exploration explored 100000 steps with 4166 reset in 442 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 155 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 276 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2)), false, false, false, false]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (11 resets) in 579 ms. (68 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40002 steps (10 resets) in 1110 ms. (36 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (12 resets) in 671 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (10 resets) in 401 ms. (99 steps per ms) remains 3/3 properties
[2024-05-28 16:20:02] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 16:20:02] [INFO ] Computed 38 invariants in 20 ms
[2024-05-28 16:20:02] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem apf2 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 243/293 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/299 variables, 4/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 453/1256 variables, and 36 constraints, problems are : Problem set: 3 solved, 0 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 285ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p0 (NOT p1) p2))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 13 factoid took 442 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 194 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Support contains 50 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 812/812 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 456 transition count 770
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 414 transition count 770
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 84 place count 414 transition count 734
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 156 place count 378 transition count 734
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 2 with 96 rules applied. Total rules applied 252 place count 330 transition count 686
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 256 place count 326 transition count 682
Iterating global reduction 2 with 4 rules applied. Total rules applied 260 place count 326 transition count 682
Applied a total of 260 rules in 64 ms. Remains 326 /456 variables (removed 130) and now considering 682/812 (removed 130) transitions.
Running 680 sub problems to find dead transitions.
[2024-05-28 16:20:03] [INFO ] Flow matrix only has 670 transitions (discarded 12 similar events)
// Phase 1: matrix 670 rows 326 cols
[2024-05-28 16:20:03] [INFO ] Computed 38 invariants in 9 ms
[2024-05-28 16:20:03] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 680 unsolved
[2024-05-28 16:20:08] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:20:08] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:20:08] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:20:08] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:20:08] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:20:08] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:20:08] [INFO ] Deduced a trap composed of 120 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:20:08] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:20:09] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:20:10] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:20:10] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 680 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/326 variables, 8/49 constraints. Problems are: Problem set: 66 solved, 614 unsolved
[2024-05-28 16:20:22] [INFO ] Deduced a trap composed of 126 places in 200 ms of which 3 ms to minimize.
[2024-05-28 16:20:24] [INFO ] Deduced a trap composed of 162 places in 137 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 326/996 variables, and 51 constraints, problems are : Problem set: 66 solved, 614 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/326 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 66 solved, 614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 15/15 constraints. Problems are: Problem set: 66 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 15/30 constraints. Problems are: Problem set: 66 solved, 614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 12/42 constraints. Problems are: Problem set: 66 solved, 614 unsolved
[2024-05-28 16:20:29] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:20:29] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:20:29] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:20:29] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 1 ms to minimize.
[2024-05-28 16:20:29] [INFO ] Deduced a trap composed of 148 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:20:30] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:20:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-28 16:20:31] [INFO ] Deduced a trap composed of 159 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:20:31] [INFO ] Deduced a trap composed of 148 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:20:31] [INFO ] Deduced a trap composed of 139 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:20:32] [INFO ] Deduced a trap composed of 126 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:20:32] [INFO ] Deduced a trap composed of 177 places in 176 ms of which 2 ms to minimize.
[2024-05-28 16:20:32] [INFO ] Deduced a trap composed of 191 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:20:33] [INFO ] Deduced a trap composed of 203 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:20:33] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:20:36] [INFO ] Deduced a trap composed of 164 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:20:36] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:20:36] [INFO ] Deduced a trap composed of 148 places in 140 ms of which 1 ms to minimize.
[2024-05-28 16:20:37] [INFO ] Deduced a trap composed of 182 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:20:38] [INFO ] Deduced a trap composed of 193 places in 178 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 20/62 constraints. Problems are: Problem set: 66 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/996 variables, and 62 constraints, problems are : Problem set: 66 solved, 614 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 15/23 constraints, State Equation: 0/326 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/680 constraints, Known Traps: 32/33 constraints]
After SMT, in 41013ms problems are : Problem set: 66 solved, 614 unsolved
Search for dead transitions found 66 dead transitions in 41021ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-05-28 16:20:44] [INFO ] Flow matrix only has 604 transitions (discarded 12 similar events)
// Phase 1: matrix 604 rows 326 cols
[2024-05-28 16:20:44] [INFO ] Computed 38 invariants in 13 ms
[2024-05-28 16:20:44] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-28 16:20:44] [INFO ] Flow matrix only has 604 transitions (discarded 12 similar events)
[2024-05-28 16:20:44] [INFO ] Invariant cache hit.
[2024-05-28 16:20:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:20:46] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 2345 ms to find 0 implicit places.
[2024-05-28 16:20:46] [INFO ] Redundant transitions in 38 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 326/456 places, 616/812 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 312 transition count 592
Applied a total of 12 rules in 15 ms. Remains 312 /326 variables (removed 14) and now considering 592/616 (removed 24) transitions.
[2024-05-28 16:20:46] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
// Phase 1: matrix 580 rows 312 cols
[2024-05-28 16:20:46] [INFO ] Computed 38 invariants in 10 ms
[2024-05-28 16:20:47] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-28 16:20:47] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
[2024-05-28 16:20:47] [INFO ] Invariant cache hit.
[2024-05-28 16:20:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:20:48] [INFO ] Implicit Places using invariants and state equation in 1631 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 312/456 places, 592/812 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45418 ms. Remains : 312/456 places, 592/812 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 101 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
RANDOM walk for 40000 steps (25 resets) in 342 ms. (116 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (9 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
[2024-05-28 16:20:49] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
[2024-05-28 16:20:49] [INFO ] Invariant cache hit.
[2024-05-28 16:20:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/139 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 293/892 variables, and 28 constraints, problems are : Problem set: 1 solved, 0 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 9/13 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 242 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Product exploration explored 100000 steps with 5760 reset in 382 ms.
Product exploration explored 100000 steps with 5735 reset in 412 ms.
Built C files in :
/tmp/ltsmin13010993789269230382
[2024-05-28 16:20:50] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2024-05-28 16:20:50] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:20:50] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2024-05-28 16:20:50] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:20:50] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
[2024-05-28 16:20:50] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:20:50] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13010993789269230382
Running compilation step : cd /tmp/ltsmin13010993789269230382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1774 ms.
Running link step : cd /tmp/ltsmin13010993789269230382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin13010993789269230382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14473005321752410670.hoa' '--buchi-type=spotba'
LTSmin run took 5288 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-02 finished in 99704 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 8 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 812/812 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 457 transition count 770
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 415 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 415 transition count 722
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 367 transition count 722
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 264 place count 325 transition count 680
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 268 place count 321 transition count 676
Iterating global reduction 2 with 4 rules applied. Total rules applied 272 place count 321 transition count 676
Applied a total of 272 rules in 44 ms. Remains 321 /457 variables (removed 136) and now considering 676/812 (removed 136) transitions.
Running 674 sub problems to find dead transitions.
[2024-05-28 16:20:58] [INFO ] Flow matrix only has 664 transitions (discarded 12 similar events)
// Phase 1: matrix 664 rows 321 cols
[2024-05-28 16:20:58] [INFO ] Computed 39 invariants in 9 ms
[2024-05-28 16:20:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-28 16:21:02] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 3 ms to minimize.
[2024-05-28 16:21:02] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 4 ms to minimize.
[2024-05-28 16:21:02] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 2 ms to minimize.
[2024-05-28 16:21:02] [INFO ] Deduced a trap composed of 41 places in 304 ms of which 2 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 3 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 121 places in 231 ms of which 2 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 146 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 119 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:21:04] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:21:04] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:21:05] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:21:08] [INFO ] Deduced a trap composed of 127 places in 172 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-28 16:21:10] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:21:14] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/985 variables, and 53 constraints, problems are : Problem set: 0 solved, 674 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/321 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-28 16:21:23] [INFO ] Deduced a trap composed of 192 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:21:26] [INFO ] Deduced a trap composed of 122 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 674 unsolved
SMT process timed out in 40688ms, After SMT, problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 40696ms
[2024-05-28 16:21:38] [INFO ] Flow matrix only has 664 transitions (discarded 12 similar events)
[2024-05-28 16:21:38] [INFO ] Invariant cache hit.
[2024-05-28 16:21:39] [INFO ] Implicit Places using invariants in 296 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 299 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/457 places, 676/812 transitions.
Applied a total of 0 rules in 15 ms. Remains 320 /320 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41057 ms. Remains : 320/457 places, 676/812 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-03
Product exploration explored 100000 steps with 45 reset in 410 ms.
Stack based approach found an accepted trace after 786 steps with 1 reset with depth 453 and stack size 453 in 4 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-03 finished in 41530 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) U !p1)))'
Support contains 38 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 812/812 transitions.
Applied a total of 0 rules in 5 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:21:39] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2024-05-28 16:21:39] [INFO ] Computed 39 invariants in 9 ms
[2024-05-28 16:21:39] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:21:45] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:21:45] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:21:45] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:21:45] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:21:46] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 1 ms to minimize.
[2024-05-28 16:21:46] [INFO ] Deduced a trap composed of 104 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:21:46] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:21:46] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:21:47] [INFO ] Deduced a trap composed of 237 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:21:47] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:21:47] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:21:47] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:21:47] [INFO ] Deduced a trap composed of 222 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:21:48] [INFO ] Deduced a trap composed of 253 places in 263 ms of which 3 ms to minimize.
[2024-05-28 16:21:48] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:21:51] [INFO ] Deduced a trap composed of 219 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:21:51] [INFO ] Deduced a trap composed of 236 places in 214 ms of which 4 ms to minimize.
[2024-05-28 16:21:52] [INFO ] Deduced a trap composed of 298 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:21:54] [INFO ] Deduced a trap composed of 231 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 2.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.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 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 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 455/1257 variables, and 56 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:22:10] [INFO ] Deduced a trap composed of 255 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:22:11] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 21/21 constraints]
After SMT, in 40626ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40634ms
[2024-05-28 16:22:20] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:22:20] [INFO ] Invariant cache hit.
[2024-05-28 16:22:20] [INFO ] Implicit Places using invariants in 394 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 396 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/457 places, 812/812 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41043 ms. Remains : 456/457 places, 812/812 transitions.
Stuttering acceptance computed with spot in 122 ms :[p1, p1, true, (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 423 ms.
Product exploration explored 100000 steps with 50000 reset in 424 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 11 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-05 finished in 42047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 12 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 812/812 transitions.
Applied a total of 0 rules in 4 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:22:21] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:22:21] [INFO ] Invariant cache hit.
[2024-05-28 16:22:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:22:28] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:22:28] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-05-28 16:22:28] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:22:28] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:22:29] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:22:29] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 3 ms to minimize.
[2024-05-28 16:22:29] [INFO ] Deduced a trap composed of 127 places in 201 ms of which 4 ms to minimize.
[2024-05-28 16:22:30] [INFO ] Deduced a trap composed of 229 places in 232 ms of which 4 ms to minimize.
[2024-05-28 16:22:30] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:22:30] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:22:30] [INFO ] Deduced a trap composed of 222 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:22:31] [INFO ] Deduced a trap composed of 218 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:22:33] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 4 ms to minimize.
[2024-05-28 16:22:33] [INFO ] Deduced a trap composed of 252 places in 211 ms of which 3 ms to minimize.
[2024-05-28 16:22:33] [INFO ] Deduced a trap composed of 229 places in 289 ms of which 3 ms to minimize.
[2024-05-28 16:22:34] [INFO ] Deduced a trap composed of 230 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:22:35] [INFO ] Deduced a trap composed of 231 places in 243 ms of which 4 ms to minimize.
[2024-05-28 16:22:38] [INFO ] Deduced a trap composed of 264 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:22:59] [INFO ] Deduced a trap composed of 231 places in 241 ms of which 4 ms to minimize.
[2024-05-28 16:22:59] [INFO ] Deduced a trap composed of 236 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:23:01] [INFO ] Deduced a trap composed of 298 places in 255 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 21/21 constraints]
After SMT, in 40790ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40799ms
[2024-05-28 16:23:02] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:23:02] [INFO ] Invariant cache hit.
[2024-05-28 16:23:02] [INFO ] Implicit Places using invariants in 419 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 443 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/457 places, 812/812 transitions.
Applied a total of 0 rules in 4 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41252 ms. Remains : 456/457 places, 812/812 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-06
Product exploration explored 100000 steps with 2872 reset in 541 ms.
Product exploration explored 100000 steps with 2871 reset in 435 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 155 steps (0 resets) in 7 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 16:23:04] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 16:23:04] [INFO ] Computed 38 invariants in 11 ms
[2024-05-28 16:23:04] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 16:23:04] [INFO ] [Real]Absence check using 14 positive and 24 generalized place invariants in 53 ms returned sat
[2024-05-28 16:23:05] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2024-05-28 16:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:23:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-28 16:23:06] [INFO ] [Nat]Absence check using 14 positive and 24 generalized place invariants in 65 ms returned sat
[2024-05-28 16:23:08] [INFO ] [Nat]Absence check using state equation in 1682 ms returned sat
[2024-05-28 16:23:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:23:08] [INFO ] [Nat]Added 72 Read/Feed constraints in 383 ms returned sat
[2024-05-28 16:23:08] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 3 ms to minimize.
[2024-05-28 16:23:09] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:23:10] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 4 ms to minimize.
[2024-05-28 16:23:10] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 3 ms to minimize.
[2024-05-28 16:23:10] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:23:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2429 ms
[2024-05-28 16:23:11] [INFO ] Computed and/alt/rep : 546/1845/540 causal constraints (skipped 258 transitions) in 81 ms.
[2024-05-28 16:23:16] [INFO ] Added : 345 causal constraints over 70 iterations in 5384 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Applied a total of 0 rules in 11 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:23:16] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:23:16] [INFO ] Invariant cache hit.
[2024-05-28 16:23:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:23:21] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:23:22] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 4 ms to minimize.
[2024-05-28 16:23:22] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 4 ms to minimize.
[2024-05-28 16:23:22] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:23:22] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:23:22] [INFO ] Deduced a trap composed of 124 places in 179 ms of which 2 ms to minimize.
[2024-05-28 16:23:23] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:23:23] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:23:23] [INFO ] Deduced a trap composed of 225 places in 254 ms of which 4 ms to minimize.
[2024-05-28 16:23:24] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:23:24] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:23:25] [INFO ] Deduced a trap composed of 222 places in 225 ms of which 3 ms to minimize.
[2024-05-28 16:23:26] [INFO ] Deduced a trap composed of 217 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:23:27] [INFO ] Deduced a trap composed of 244 places in 226 ms of which 4 ms to minimize.
[2024-05-28 16:23:27] [INFO ] Deduced a trap composed of 263 places in 184 ms of which 2 ms to minimize.
[2024-05-28 16:23:27] [INFO ] Deduced a trap composed of 266 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:23:29] [INFO ] Deduced a trap composed of 306 places in 234 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:23:33] [INFO ] Deduced a trap composed of 227 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:23:35] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints]
After SMT, in 40819ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40834ms
[2024-05-28 16:23:57] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:23:57] [INFO ] Invariant cache hit.
[2024-05-28 16:23:57] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-28 16:23:57] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:23:57] [INFO ] Invariant cache hit.
[2024-05-28 16:23:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:24:02] [INFO ] Implicit Places using invariants and state equation in 4518 ms returned []
Implicit Place search using SMT with State Equation took 4970 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:24:02] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:24:02] [INFO ] Invariant cache hit.
[2024-05-28 16:24:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:24:07] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-05-28 16:24:08] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 5 ms to minimize.
[2024-05-28 16:24:08] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:24:08] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 3 ms to minimize.
[2024-05-28 16:24:08] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 4 ms to minimize.
[2024-05-28 16:24:09] [INFO ] Deduced a trap composed of 124 places in 276 ms of which 3 ms to minimize.
[2024-05-28 16:24:09] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:24:09] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:24:09] [INFO ] Deduced a trap composed of 225 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:24:10] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:24:10] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 15 ms to minimize.
[2024-05-28 16:24:11] [INFO ] Deduced a trap composed of 222 places in 159 ms of which 15 ms to minimize.
[2024-05-28 16:24:12] [INFO ] Deduced a trap composed of 217 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:24:12] [INFO ] Deduced a trap composed of 244 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:24:13] [INFO ] Deduced a trap composed of 263 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:24:13] [INFO ] Deduced a trap composed of 266 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:24:15] [INFO ] Deduced a trap composed of 306 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:24:19] [INFO ] Deduced a trap composed of 227 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:24:21] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:24:52] [INFO ] Deduced a trap composed of 253 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:25:00] [INFO ] Deduced a trap composed of 244 places in 223 ms of which 2 ms to minimize.
[2024-05-28 16:25:00] [INFO ] Deduced a trap composed of 236 places in 192 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 22/22 constraints]
After SMT, in 60851ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60860ms
Finished structural reductions in LTL mode , in 1 iterations and 106680 ms. Remains : 456/456 places, 812/812 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 137 steps (0 resets) in 17 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 16:25:03] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:25:03] [INFO ] Invariant cache hit.
[2024-05-28 16:25:03] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-28 16:25:03] [INFO ] [Real]Absence check using 14 positive and 24 generalized place invariants in 77 ms returned sat
[2024-05-28 16:25:04] [INFO ] [Real]Absence check using state equation in 924 ms returned sat
[2024-05-28 16:25:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:25:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-28 16:25:05] [INFO ] [Nat]Absence check using 14 positive and 24 generalized place invariants in 183 ms returned sat
[2024-05-28 16:25:08] [INFO ] [Nat]Absence check using state equation in 2744 ms returned sat
[2024-05-28 16:25:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:25:08] [INFO ] [Nat]Added 72 Read/Feed constraints in 872 ms returned sat
[2024-05-28 16:25:09] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:25:09] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-28 16:25:09] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:25:09] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:25:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 661 ms
[2024-05-28 16:25:09] [INFO ] Computed and/alt/rep : 546/1845/540 causal constraints (skipped 258 transitions) in 74 ms.
[2024-05-28 16:25:14] [INFO ] Added : 283 causal constraints over 58 iterations in 4787 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2887 reset in 366 ms.
Product exploration explored 100000 steps with 2885 reset in 375 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 456 transition count 812
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 38 place count 456 transition count 842
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 78 place count 456 transition count 842
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 90 place count 444 transition count 830
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 444 transition count 830
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 150 place count 444 transition count 830
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 172 place count 422 transition count 808
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 194 place count 422 transition count 808
Deduced a syphon composed of 96 places in 1 ms
Applied a total of 194 rules in 74 ms. Remains 422 /456 variables (removed 34) and now considering 808/812 (removed 4) transitions.
Running 806 sub problems to find dead transitions.
[2024-05-28 16:25:15] [INFO ] Flow matrix only has 796 transitions (discarded 12 similar events)
// Phase 1: matrix 796 rows 422 cols
[2024-05-28 16:25:15] [INFO ] Computed 38 invariants in 14 ms
[2024-05-28 16:25:15] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-05-28 16:25:21] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:25:21] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:25:21] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:25:21] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:25:21] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:25:21] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:25:21] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
[2024-05-28 16:25:22] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-28 16:25:22] [INFO ] Deduced a trap composed of 120 places in 230 ms of which 3 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
[2024-05-28 16:25:23] [INFO ] Deduced a trap composed of 186 places in 215 ms of which 3 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
[2024-05-28 16:25:24] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 2 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD613 is UNSAT
[2024-05-28 16:25:27] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 3 ms to minimize.
Problem TDEAD643 is UNSAT
[2024-05-28 16:25:28] [INFO ] Deduced a trap composed of 145 places in 217 ms of which 3 ms to minimize.
[2024-05-28 16:25:28] [INFO ] Deduced a trap composed of 127 places in 220 ms of which 3 ms to minimize.
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
[2024-05-28 16:25:28] [INFO ] Deduced a trap composed of 127 places in 210 ms of which 2 ms to minimize.
Problem TDEAD667 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD713 is UNSAT
[2024-05-28 16:25:29] [INFO ] Deduced a trap composed of 153 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:25:29] [INFO ] Deduced a trap composed of 146 places in 169 ms of which 2 ms to minimize.
Problem TDEAD760 is UNSAT
Problem TDEAD787 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 17/53 constraints. Problems are: Problem set: 114 solved, 692 unsolved
[2024-05-28 16:25:35] [INFO ] Deduced a trap composed of 139 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 1/54 constraints. Problems are: Problem set: 114 solved, 692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1218 variables, and 54 constraints, problems are : Problem set: 114 solved, 692 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/21 constraints, State Equation: 0/422 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 806/806 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 114 solved, 692 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 9/9 constraints. Problems are: Problem set: 114 solved, 692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/336 variables, 10/19 constraints. Problems are: Problem set: 114 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 18/37 constraints. Problems are: Problem set: 114 solved, 692 unsolved
[2024-05-28 16:25:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 1/38 constraints. Problems are: Problem set: 114 solved, 692 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/38 constraints. Problems are: Problem set: 114 solved, 692 unsolved
At refinement iteration 5 (OVERLAPS) 48/384 variables, 8/46 constraints. Problems are: Problem set: 114 solved, 692 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 6/52 constraints. Problems are: Problem set: 114 solved, 692 unsolved
[2024-05-28 16:25:46] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:25:46] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:25:46] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:25:46] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:25:47] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 5/57 constraints. Problems are: Problem set: 114 solved, 692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1218 variables, and 57 constraints, problems are : Problem set: 114 solved, 692 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/422 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/806 constraints, Known Traps: 24/24 constraints]
After SMT, in 41065ms problems are : Problem set: 114 solved, 692 unsolved
Search for dead transitions found 114 dead transitions in 41079ms
Found 114 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 114 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 114 transitions.
[2024-05-28 16:25:56] [INFO ] Redundant transitions in 12 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 422/456 places, 694/812 transitions.
Graph (complete) has 1944 edges and 422 vertex of which 338 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.2 ms
Discarding 84 places :
Also discarding 0 output transitions
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 1 rules in 22 ms. Remains 338 /422 variables (removed 84) and now considering 694/694 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 338/456 places, 694/812 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41198 ms. Remains : 338/456 places, 694/812 transitions.
Built C files in :
/tmp/ltsmin15446320581745126088
[2024-05-28 16:25:56] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15446320581745126088
Running compilation step : cd /tmp/ltsmin15446320581745126088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1885 ms.
Running link step : cd /tmp/ltsmin15446320581745126088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15446320581745126088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11418362460663565282.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Applied a total of 0 rules in 7 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:26:11] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 16:26:11] [INFO ] Computed 38 invariants in 8 ms
[2024-05-28 16:26:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:26:17] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:26:17] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:26:17] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:26:17] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:26:18] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:26:18] [INFO ] Deduced a trap composed of 127 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:26:18] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:26:18] [INFO ] Deduced a trap composed of 237 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:26:19] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:26:19] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:26:19] [INFO ] Deduced a trap composed of 222 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:26:22] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 3 ms to minimize.
[2024-05-28 16:26:22] [INFO ] Deduced a trap composed of 244 places in 200 ms of which 2 ms to minimize.
[2024-05-28 16:26:22] [INFO ] Deduced a trap composed of 219 places in 178 ms of which 4 ms to minimize.
[2024-05-28 16:26:23] [INFO ] Deduced a trap composed of 228 places in 199 ms of which 3 ms to minimize.
[2024-05-28 16:26:26] [INFO ] Deduced a trap composed of 298 places in 247 ms of which 3 ms to minimize.
[2024-05-28 16:26:27] [INFO ] Deduced a trap composed of 86 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:26:31] [INFO ] Deduced a trap composed of 253 places in 144 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:26:49] [INFO ] Deduced a trap composed of 244 places in 250 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints]
After SMT, in 40939ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40950ms
[2024-05-28 16:26:52] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:26:52] [INFO ] Invariant cache hit.
[2024-05-28 16:26:53] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-28 16:26:53] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:26:53] [INFO ] Invariant cache hit.
[2024-05-28 16:26:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:26:57] [INFO ] Implicit Places using invariants and state equation in 4485 ms returned []
Implicit Place search using SMT with State Equation took 4799 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:26:57] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:26:57] [INFO ] Invariant cache hit.
[2024-05-28 16:26:57] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:27:03] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:27:03] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-05-28 16:27:03] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:27:03] [INFO ] Deduced a trap composed of 64 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:27:04] [INFO ] Deduced a trap composed of 64 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:27:04] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:27:04] [INFO ] Deduced a trap composed of 64 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:27:04] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:27:05] [INFO ] Deduced a trap composed of 225 places in 252 ms of which 4 ms to minimize.
[2024-05-28 16:27:05] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-28 16:27:06] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:27:06] [INFO ] Deduced a trap composed of 222 places in 236 ms of which 3 ms to minimize.
[2024-05-28 16:27:07] [INFO ] Deduced a trap composed of 217 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:27:08] [INFO ] Deduced a trap composed of 244 places in 152 ms of which 5 ms to minimize.
[2024-05-28 16:27:08] [INFO ] Deduced a trap composed of 263 places in 239 ms of which 4 ms to minimize.
[2024-05-28 16:27:08] [INFO ] Deduced a trap composed of 266 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:27:11] [INFO ] Deduced a trap composed of 306 places in 142 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:27:15] [INFO ] Deduced a trap composed of 227 places in 235 ms of which 3 ms to minimize.
[2024-05-28 16:27:17] [INFO ] Deduced a trap composed of 55 places in 239 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:27:48] [INFO ] Deduced a trap composed of 253 places in 220 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:27:56] [INFO ] Deduced a trap composed of 244 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:27:56] [INFO ] Deduced a trap composed of 236 places in 201 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 22/22 constraints]
After SMT, in 60777ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60789ms
Finished structural reductions in LTL mode , in 1 iterations and 106551 ms. Remains : 456/456 places, 812/812 transitions.
Built C files in :
/tmp/ltsmin8243411412445489491
[2024-05-28 16:27:58] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8243411412445489491
Running compilation step : cd /tmp/ltsmin8243411412445489491;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2205 ms.
Running link step : cd /tmp/ltsmin8243411412445489491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8243411412445489491;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13710303884115155446.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 16:28:13] [INFO ] Flatten gal took : 64 ms
[2024-05-28 16:28:13] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:28:13] [INFO ] Time to serialize gal into /tmp/LTL13740954991082417177.gal : 27 ms
[2024-05-28 16:28:13] [INFO ] Time to serialize properties into /tmp/LTL3910174837305134392.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13740954991082417177.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8387697011492976261.hoa' '-atoms' '/tmp/LTL3910174837305134392.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3910174837305134392.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8387697011492976261.hoa
Detected timeout of ITS tools.
[2024-05-28 16:28:28] [INFO ] Flatten gal took : 72 ms
[2024-05-28 16:28:29] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:28:29] [INFO ] Time to serialize gal into /tmp/LTL10559477511357517242.gal : 26 ms
[2024-05-28 16:28:29] [INFO ] Time to serialize properties into /tmp/LTL15355263841509760716.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10559477511357517242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15355263841509760716.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((Insert_Source_B_6_1>=1)||(Insert_Source_B_4_1>=1))||((Insert_Source_B_1_2>=1)||(Insert_Source_B_2_2>=1)))||(((Insert_So...369
Formula 0 simplified : XXG!"(((((Insert_Source_B_6_1>=1)||(Insert_Source_B_4_1>=1))||((Insert_Source_B_1_2>=1)||(Insert_Source_B_2_2>=1)))||(((Insert_Sourc...361
Detected timeout of ITS tools.
[2024-05-28 16:28:44] [INFO ] Flatten gal took : 55 ms
[2024-05-28 16:28:44] [INFO ] Applying decomposition
[2024-05-28 16:28:44] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6065187714652070349.txt' '-o' '/tmp/graph6065187714652070349.bin' '-w' '/tmp/graph6065187714652070349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6065187714652070349.bin' '-l' '-1' '-v' '-w' '/tmp/graph6065187714652070349.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:28:44] [INFO ] Decomposing Gal with order
[2024-05-28 16:28:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:28:44] [INFO ] Removed a total of 642 redundant transitions.
[2024-05-28 16:28:44] [INFO ] Flatten gal took : 107 ms
[2024-05-28 16:28:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 24 ms.
[2024-05-28 16:28:44] [INFO ] Time to serialize gal into /tmp/LTL17385148717979476884.gal : 11 ms
[2024-05-28 16:28:44] [INFO ] Time to serialize properties into /tmp/LTL13471497702953954591.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17385148717979476884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13471497702953954591.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((i4.u11.Insert_Source_B_6_1>=1)||(i7.u43.Insert_Source_B_4_1>=1))||((i3.u31.Insert_Source_B_1_2>=1)||(i10.u20.Insert_Sou...454
Formula 0 simplified : XXG!"(((((i4.u11.Insert_Source_B_6_1>=1)||(i7.u43.Insert_Source_B_4_1>=1))||((i3.u31.Insert_Source_B_1_2>=1)||(i10.u20.Insert_Source...446
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-06 finished in 398029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 31 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 812/812 transitions.
Applied a total of 0 rules in 4 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:28:59] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2024-05-28 16:28:59] [INFO ] Computed 39 invariants in 7 ms
[2024-05-28 16:28:59] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:29:05] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:29:05] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:29:05] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-28 16:29:05] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:29:06] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:29:06] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:29:06] [INFO ] Deduced a trap composed of 130 places in 199 ms of which 4 ms to minimize.
[2024-05-28 16:29:06] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:29:07] [INFO ] Deduced a trap composed of 237 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:29:07] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 2 ms to minimize.
[2024-05-28 16:29:07] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:29:07] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:29:07] [INFO ] Deduced a trap composed of 222 places in 251 ms of which 4 ms to minimize.
[2024-05-28 16:29:08] [INFO ] Deduced a trap composed of 253 places in 287 ms of which 4 ms to minimize.
[2024-05-28 16:29:09] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:29:11] [INFO ] Deduced a trap composed of 219 places in 222 ms of which 3 ms to minimize.
[2024-05-28 16:29:11] [INFO ] Deduced a trap composed of 236 places in 205 ms of which 3 ms to minimize.
[2024-05-28 16:29:12] [INFO ] Deduced a trap composed of 298 places in 263 ms of which 3 ms to minimize.
[2024-05-28 16:29:15] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 56 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:29:32] [INFO ] Deduced a trap composed of 255 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:29:34] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 21/21 constraints]
After SMT, in 40685ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40694ms
[2024-05-28 16:29:40] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:29:40] [INFO ] Invariant cache hit.
[2024-05-28 16:29:40] [INFO ] Implicit Places using invariants in 367 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 369 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/457 places, 812/812 transitions.
Applied a total of 0 rules in 4 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41073 ms. Remains : 456/457 places, 812/812 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-07
Product exploration explored 100000 steps with 25000 reset in 285 ms.
Product exploration explored 100000 steps with 25000 reset in 273 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 31 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Applied a total of 0 rules in 7 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:29:42] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 16:29:42] [INFO ] Computed 38 invariants in 11 ms
[2024-05-28 16:29:42] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:29:48] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:29:48] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:29:48] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:29:48] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:29:48] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:29:49] [INFO ] Deduced a trap composed of 127 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:29:49] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:29:49] [INFO ] Deduced a trap composed of 237 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:29:49] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:29:50] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:29:50] [INFO ] Deduced a trap composed of 222 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:29:53] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 3 ms to minimize.
[2024-05-28 16:29:53] [INFO ] Deduced a trap composed of 244 places in 194 ms of which 3 ms to minimize.
[2024-05-28 16:29:53] [INFO ] Deduced a trap composed of 219 places in 205 ms of which 3 ms to minimize.
[2024-05-28 16:29:54] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 3 ms to minimize.
[2024-05-28 16:29:56] [INFO ] Deduced a trap composed of 298 places in 245 ms of which 3 ms to minimize.
[2024-05-28 16:29:57] [INFO ] Deduced a trap composed of 86 places in 223 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:30:01] [INFO ] Deduced a trap composed of 253 places in 149 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:30:20] [INFO ] Deduced a trap composed of 244 places in 246 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints]
After SMT, in 41105ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 41119ms
[2024-05-28 16:30:23] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:30:23] [INFO ] Invariant cache hit.
[2024-05-28 16:30:23] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-28 16:30:23] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:30:23] [INFO ] Invariant cache hit.
[2024-05-28 16:30:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:30:29] [INFO ] Implicit Places using invariants and state equation in 5975 ms returned []
Implicit Place search using SMT with State Equation took 6303 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:30:29] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:30:29] [INFO ] Invariant cache hit.
[2024-05-28 16:30:29] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:30:35] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:30:35] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 4 ms to minimize.
[2024-05-28 16:30:36] [INFO ] Deduced a trap composed of 64 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:30:36] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 4 ms to minimize.
[2024-05-28 16:30:36] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 3 ms to minimize.
[2024-05-28 16:30:36] [INFO ] Deduced a trap composed of 124 places in 222 ms of which 3 ms to minimize.
[2024-05-28 16:30:37] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:30:37] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:30:38] [INFO ] Deduced a trap composed of 225 places in 262 ms of which 3 ms to minimize.
[2024-05-28 16:30:38] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:30:39] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 4 ms to minimize.
[2024-05-28 16:30:40] [INFO ] Deduced a trap composed of 222 places in 225 ms of which 4 ms to minimize.
[2024-05-28 16:30:41] [INFO ] Deduced a trap composed of 217 places in 231 ms of which 4 ms to minimize.
[2024-05-28 16:30:42] [INFO ] Deduced a trap composed of 244 places in 231 ms of which 4 ms to minimize.
[2024-05-28 16:30:42] [INFO ] Deduced a trap composed of 263 places in 233 ms of which 4 ms to minimize.
[2024-05-28 16:30:42] [INFO ] Deduced a trap composed of 266 places in 202 ms of which 3 ms to minimize.
[2024-05-28 16:30:44] [INFO ] Deduced a trap composed of 306 places in 234 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:30:50] [INFO ] Deduced a trap composed of 227 places in 238 ms of which 3 ms to minimize.
[2024-05-28 16:30:52] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:31:22] [INFO ] Deduced a trap composed of 253 places in 247 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 20/20 constraints]
After SMT, in 60863ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60878ms
Finished structural reductions in LTL mode , in 1 iterations and 108314 ms. Remains : 456/456 places, 812/812 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 379 ms.
Product exploration explored 100000 steps with 25000 reset in 391 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 31 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 456 transition count 812
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 38 place count 456 transition count 866
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 90 place count 456 transition count 866
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 102 place count 444 transition count 854
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 114 place count 444 transition count 854
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 126 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 162 place count 444 transition count 854
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 184 place count 422 transition count 832
Deduced a syphon composed of 108 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 206 place count 422 transition count 832
Deduced a syphon composed of 108 places in 1 ms
Applied a total of 206 rules in 63 ms. Remains 422 /456 variables (removed 34) and now considering 832/812 (removed -20) transitions.
Running 830 sub problems to find dead transitions.
[2024-05-28 16:31:32] [INFO ] Flow matrix only has 820 transitions (discarded 12 similar events)
// Phase 1: matrix 820 rows 422 cols
[2024-05-28 16:31:32] [INFO ] Computed 38 invariants in 13 ms
[2024-05-28 16:31:32] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-05-28 16:31:38] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:31:38] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:31:38] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:31:39] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:31:39] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:31:39] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:31:39] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-28 16:31:39] [INFO ] Deduced a trap composed of 108 places in 238 ms of which 4 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
[2024-05-28 16:31:40] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 3 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
[2024-05-28 16:31:41] [INFO ] Deduced a trap composed of 59 places in 229 ms of which 3 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
[2024-05-28 16:31:43] [INFO ] Deduced a trap composed of 116 places in 277 ms of which 5 ms to minimize.
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD533 is UNSAT
[2024-05-28 16:31:44] [INFO ] Deduced a trap composed of 178 places in 218 ms of which 3 ms to minimize.
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD675 is UNSAT
[2024-05-28 16:31:46] [INFO ] Deduced a trap composed of 114 places in 201 ms of which 3 ms to minimize.
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
[2024-05-28 16:31:46] [INFO ] Deduced a trap composed of 129 places in 221 ms of which 2 ms to minimize.
Problem TDEAD684 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD715 is UNSAT
[2024-05-28 16:31:46] [INFO ] Deduced a trap composed of 93 places in 242 ms of which 6 ms to minimize.
Problem TDEAD721 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD743 is UNSAT
[2024-05-28 16:31:47] [INFO ] Deduced a trap composed of 128 places in 199 ms of which 3 ms to minimize.
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 16/52 constraints. Problems are: Problem set: 150 solved, 680 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1242 variables, and 52 constraints, problems are : Problem set: 150 solved, 680 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/21 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 150 solved, 680 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 9/9 constraints. Problems are: Problem set: 150 solved, 680 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 10/19 constraints. Problems are: Problem set: 150 solved, 680 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 16/35 constraints. Problems are: Problem set: 150 solved, 680 unsolved
[2024-05-28 16:31:55] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 1/36 constraints. Problems are: Problem set: 150 solved, 680 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/36 constraints. Problems are: Problem set: 150 solved, 680 unsolved
At refinement iteration 5 (OVERLAPS) 48/372 variables, 8/44 constraints. Problems are: Problem set: 150 solved, 680 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 4/48 constraints. Problems are: Problem set: 150 solved, 680 unsolved
[2024-05-28 16:32:05] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:32:05] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:32:05] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:32:06] [INFO ] Deduced a trap composed of 115 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:32:07] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 1 ms to minimize.
[2024-05-28 16:32:08] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/54 constraints. Problems are: Problem set: 150 solved, 680 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1242 variables, and 54 constraints, problems are : Problem set: 150 solved, 680 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 14/21 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 23/23 constraints]
After SMT, in 41159ms problems are : Problem set: 150 solved, 680 unsolved
Search for dead transitions found 150 dead transitions in 41169ms
Found 150 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 150 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 150 transitions.
[2024-05-28 16:32:13] [INFO ] Redundant transitions in 6 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 422/456 places, 682/812 transitions.
Graph (complete) has 1932 edges and 422 vertex of which 326 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.2 ms
Discarding 96 places :
Also discarding 0 output transitions
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 1 rules in 15 ms. Remains 326 /422 variables (removed 96) and now considering 682/682 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 326/456 places, 682/812 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41268 ms. Remains : 326/456 places, 682/812 transitions.
Built C files in :
/tmp/ltsmin5336111178870386241
[2024-05-28 16:32:14] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5336111178870386241
Running compilation step : cd /tmp/ltsmin5336111178870386241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2043 ms.
Running link step : cd /tmp/ltsmin5336111178870386241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5336111178870386241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1121167159861237802.hoa' '--buchi-type=spotba'
LTSmin run took 690 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-07 finished in 197093 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((X(p0) U (p1 U p2)))))'
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 812/812 transitions.
Applied a total of 0 rules in 10 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:32:16] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2024-05-28 16:32:16] [INFO ] Computed 39 invariants in 9 ms
[2024-05-28 16:32:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:32:23] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:32:23] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:32:23] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:32:23] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:32:24] [INFO ] Deduced a trap composed of 74 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:32:24] [INFO ] Deduced a trap composed of 104 places in 204 ms of which 3 ms to minimize.
[2024-05-28 16:32:24] [INFO ] Deduced a trap composed of 130 places in 214 ms of which 3 ms to minimize.
[2024-05-28 16:32:24] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:32:25] [INFO ] Deduced a trap composed of 237 places in 252 ms of which 5 ms to minimize.
[2024-05-28 16:32:25] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:32:25] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:32:25] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:32:25] [INFO ] Deduced a trap composed of 222 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:32:26] [INFO ] Deduced a trap composed of 253 places in 291 ms of which 4 ms to minimize.
[2024-05-28 16:32:27] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:32:29] [INFO ] Deduced a trap composed of 219 places in 272 ms of which 3 ms to minimize.
[2024-05-28 16:32:30] [INFO ] Deduced a trap composed of 236 places in 238 ms of which 3 ms to minimize.
[2024-05-28 16:32:31] [INFO ] Deduced a trap composed of 298 places in 235 ms of which 4 ms to minimize.
[2024-05-28 16:32:33] [INFO ] Deduced a trap composed of 231 places in 237 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 (/ 3.0 4.0))
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 (/ 3.0 4.0))
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 (/ 3.0 4.0))
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 3.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 (/ 2.0 3.0))
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 (/ 2.0 3.0))
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 (/ 1.0 4.0))
(s334 0.0)
(s335 0.0)
(s336 (/ 21.0 4.0))
(s337 0.0)
(s338 7.0)
(s339 (/ 15.0 2.0))
(s340 0.0)
(s341 (/ 1.0 3.0))
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 56 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:32:48] [INFO ] Deduced a trap composed of 255 places in 240 ms of which 3 ms to minimize.
[2024-05-28 16:32:51] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 21/21 constraints]
After SMT, in 40897ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40908ms
[2024-05-28 16:32:57] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:32:57] [INFO ] Invariant cache hit.
[2024-05-28 16:32:58] [INFO ] Implicit Places using invariants in 337 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 341 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/457 places, 812/812 transitions.
Applied a total of 0 rules in 8 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41269 ms. Remains : 456/457 places, 812/812 transitions.
Stuttering acceptance computed with spot in 389 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-08
Product exploration explored 100000 steps with 263 reset in 393 ms.
Product exploration explored 100000 steps with 251 reset in 379 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 p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 256 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
RANDOM walk for 40000 steps (14 resets) in 711 ms. (56 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (10 resets) in 614 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (12 resets) in 640 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 687 ms. (58 steps per ms) remains 3/3 properties
[2024-05-28 16:33:00] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 16:33:00] [INFO ] Computed 38 invariants in 12 ms
[2024-05-28 16:33:00] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 217/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 67/289 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/293 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 453/1256 variables, and 36 constraints, problems are : Problem set: 3 solved, 0 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (G (OR p2 (NOT p1) p0)), (G (OR p2 p1 p0)), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 252 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), true]
Stuttering acceptance computed with spot in 96 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), true]
Support contains 2 out of 456 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 456 transition count 773
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 417 transition count 773
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 78 place count 417 transition count 724
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 176 place count 368 transition count 724
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 270 place count 321 transition count 677
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 274 place count 317 transition count 673
Iterating global reduction 2 with 4 rules applied. Total rules applied 278 place count 317 transition count 673
Applied a total of 278 rules in 47 ms. Remains 317 /456 variables (removed 139) and now considering 673/812 (removed 139) transitions.
Running 671 sub problems to find dead transitions.
[2024-05-28 16:33:01] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
// Phase 1: matrix 661 rows 317 cols
[2024-05-28 16:33:01] [INFO ] Computed 38 invariants in 9 ms
[2024-05-28 16:33:01] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 16:33:06] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:33:06] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2024-05-28 16:33:06] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:33:06] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:33:06] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:33:07] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:33:07] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:33:07] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:33:08] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 3 ms to minimize.
[2024-05-28 16:33:08] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 2 ms to minimize.
[2024-05-28 16:33:09] [INFO ] Deduced a trap composed of 117 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:33:12] [INFO ] Deduced a trap composed of 110 places in 225 ms of which 3 ms to minimize.
[2024-05-28 16:33:12] [INFO ] Deduced a trap composed of 122 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:33:12] [INFO ] Deduced a trap composed of 112 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:33:12] [INFO ] Deduced a trap composed of 143 places in 143 ms of which 1 ms to minimize.
[2024-05-28 16:33:13] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 16:33:14] [INFO ] Deduced a trap composed of 111 places in 196 ms of which 2 ms to minimize.
[2024-05-28 16:33:19] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:33:19] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 315/978 variables, and 55 constraints, problems are : Problem set: 0 solved, 671 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/317 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 16:33:32] [INFO ] Deduced a trap composed of 176 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:33:32] [INFO ] Deduced a trap composed of 181 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/978 variables, and 57 constraints, problems are : Problem set: 0 solved, 671 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/317 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 21/21 constraints]
After SMT, in 41059ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 41070ms
[2024-05-28 16:33:42] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
[2024-05-28 16:33:42] [INFO ] Invariant cache hit.
[2024-05-28 16:33:43] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-05-28 16:33:43] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
[2024-05-28 16:33:43] [INFO ] Invariant cache hit.
[2024-05-28 16:33:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:33:47] [INFO ] Implicit Places using invariants and state equation in 4108 ms returned []
Implicit Place search using SMT with State Equation took 4636 ms to find 0 implicit places.
[2024-05-28 16:33:47] [INFO ] Redundant transitions in 9 ms returned []
Running 671 sub problems to find dead transitions.
[2024-05-28 16:33:47] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
[2024-05-28 16:33:47] [INFO ] Invariant cache hit.
[2024-05-28 16:33:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 16:33:51] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:33:51] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:33:51] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:33:51] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:33:52] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 2 ms to minimize.
[2024-05-28 16:33:52] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:33:52] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:33:52] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:33:52] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:33:53] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 7 ms to minimize.
[2024-05-28 16:33:54] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 4 ms to minimize.
[2024-05-28 16:33:54] [INFO ] Deduced a trap composed of 106 places in 210 ms of which 2 ms to minimize.
[2024-05-28 16:33:56] [INFO ] Deduced a trap composed of 142 places in 236 ms of which 3 ms to minimize.
[2024-05-28 16:33:57] [INFO ] Deduced a trap composed of 114 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:33:58] [INFO ] Deduced a trap composed of 95 places in 226 ms of which 3 ms to minimize.
[2024-05-28 16:33:58] [INFO ] Deduced a trap composed of 130 places in 210 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 16:34:04] [INFO ] Deduced a trap composed of 111 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 16:34:13] [INFO ] Deduced a trap composed of 175 places in 186 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 315/978 variables, and 54 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/317 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 16:34:24] [INFO ] Deduced a trap composed of 181 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/317 variables, 2/57 constraints. Problems are: Problem set: 66 solved, 605 unsolved
[2024-05-28 16:34:48] [INFO ] Deduced a trap composed of 108 places in 212 ms of which 3 ms to minimize.
SMT process timed out in 60870ms, After SMT, problems are : Problem set: 66 solved, 605 unsolved
Search for dead transitions found 66 dead transitions in 60879ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 317/456 places, 607/812 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 303 transition count 583
Applied a total of 12 rules in 41 ms. Remains 303 /317 variables (removed 14) and now considering 583/607 (removed 24) transitions.
[2024-05-28 16:34:48] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
// Phase 1: matrix 571 rows 303 cols
[2024-05-28 16:34:48] [INFO ] Computed 38 invariants in 14 ms
[2024-05-28 16:34:48] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-28 16:34:48] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:34:48] [INFO ] Invariant cache hit.
[2024-05-28 16:34:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:34:50] [INFO ] Implicit Places using invariants and state equation in 2312 ms returned []
Implicit Place search using SMT with State Equation took 2710 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 303/456 places, 583/812 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 109403 ms. Remains : 303/456 places, 583/812 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 p2 p0), (X p2), (X (NOT (AND (NOT p2) p0))), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 160 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), true]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (20 resets) in 399 ms. (100 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (12 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
[2024-05-28 16:34:51] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:34:51] [INFO ] Invariant cache hit.
[2024-05-28 16:34:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 263/874 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 4/13 constraints, Generalized P Invariants (flows): 9/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0), (X p2), (X (NOT (AND (NOT p2) p0))), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (G (OR p0 p2)), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p2))), (F (NOT p2))]
Knowledge based reduction with 13 factoid took 298 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), true]
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), true]
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), true]
Product exploration explored 100000 steps with 330 reset in 409 ms.
Product exploration explored 100000 steps with 348 reset in 415 ms.
Built C files in :
/tmp/ltsmin2403207803558173412
[2024-05-28 16:34:53] [INFO ] Computing symmetric may disable matrix : 583 transitions.
[2024-05-28 16:34:53] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:34:53] [INFO ] Computing symmetric may enable matrix : 583 transitions.
[2024-05-28 16:34:53] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:34:53] [INFO ] Computing Do-Not-Accords matrix : 583 transitions.
[2024-05-28 16:34:53] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:34:53] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2403207803558173412
Running compilation step : cd /tmp/ltsmin2403207803558173412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2263 ms.
Running link step : cd /tmp/ltsmin2403207803558173412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin2403207803558173412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10099970940383464281.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 583/583 transitions.
Applied a total of 0 rules in 21 ms. Remains 303 /303 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Running 581 sub problems to find dead transitions.
[2024-05-28 16:35:08] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:35:08] [INFO ] Invariant cache hit.
[2024-05-28 16:35:08] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:35:12] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 9 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 147 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:35:14] [INFO ] Deduced a trap composed of 101 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:35:14] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:35:14] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:35:15] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:35:15] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 2 ms to minimize.
[2024-05-28 16:35:15] [INFO ] Deduced a trap composed of 151 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:35:15] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:35:15] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:35:15] [INFO ] Deduced a trap composed of 146 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:35:16] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 2 ms to minimize.
[2024-05-28 16:35:16] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:35:16] [INFO ] Deduced a trap composed of 117 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:35:17] [INFO ] Deduced a trap composed of 146 places in 184 ms of which 2 ms to minimize.
[2024-05-28 16:35:18] [INFO ] Deduced a trap composed of 89 places in 182 ms of which 2 ms to minimize.
[2024-05-28 16:35:18] [INFO ] Deduced a trap composed of 149 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:35:18] [INFO ] Deduced a trap composed of 99 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:35:19] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:35:19] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:35:19] [INFO ] Deduced a trap composed of 122 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:35:20] [INFO ] Deduced a trap composed of 147 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:35:20] [INFO ] Deduced a trap composed of 155 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:35:20] [INFO ] Deduced a trap composed of 150 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:35:20] [INFO ] Deduced a trap composed of 162 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:35:20] [INFO ] Deduced a trap composed of 165 places in 138 ms of which 6 ms to minimize.
[2024-05-28 16:35:21] [INFO ] Deduced a trap composed of 143 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:35:21] [INFO ] Deduced a trap composed of 115 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:35:21] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:35:21] [INFO ] Deduced a trap composed of 157 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:35:22] [INFO ] Deduced a trap composed of 144 places in 184 ms of which 3 ms to minimize.
[2024-05-28 16:35:22] [INFO ] Deduced a trap composed of 124 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:35:22] [INFO ] Deduced a trap composed of 158 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:35:22] [INFO ] Deduced a trap composed of 130 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:35:26] [INFO ] Deduced a trap composed of 143 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:35:26] [INFO ] Deduced a trap composed of 139 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:35:27] [INFO ] Deduced a trap composed of 152 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:35:27] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:35:27] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:35:28] [INFO ] Deduced a trap composed of 135 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:35:28] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:35:28] [INFO ] Deduced a trap composed of 133 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:35:28] [INFO ] Deduced a trap composed of 120 places in 152 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/874 variables, and 85 constraints, problems are : Problem set: 0 solved, 581 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 49/85 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:35:31] [INFO ] Deduced a trap composed of 97 places in 196 ms of which 2 ms to minimize.
[2024-05-28 16:35:33] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:35:35] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:35:35] [INFO ] Deduced a trap composed of 167 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:35:36] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:35:36] [INFO ] Deduced a trap composed of 133 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:35:36] [INFO ] Deduced a trap composed of 136 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:35:36] [INFO ] Deduced a trap composed of 140 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:35:37] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:35:37] [INFO ] Deduced a trap composed of 124 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:35:37] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:35:37] [INFO ] Deduced a trap composed of 150 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:35:37] [INFO ] Deduced a trap composed of 124 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:35:37] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:35:37] [INFO ] Deduced a trap composed of 127 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:35:38] [INFO ] Deduced a trap composed of 139 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:35:38] [INFO ] Deduced a trap composed of 133 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:35:38] [INFO ] Deduced a trap composed of 119 places in 122 ms of which 1 ms to minimize.
[2024-05-28 16:35:38] [INFO ] Deduced a trap composed of 139 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:35:38] [INFO ] Deduced a trap composed of 149 places in 121 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:35:42] [INFO ] Deduced a trap composed of 123 places in 199 ms of which 3 ms to minimize.
[2024-05-28 16:35:42] [INFO ] Deduced a trap composed of 145 places in 181 ms of which 3 ms to minimize.
[2024-05-28 16:35:46] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:35:46] [INFO ] Deduced a trap composed of 121 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:35:46] [INFO ] Deduced a trap composed of 143 places in 180 ms of which 2 ms to minimize.
[2024-05-28 16:35:47] [INFO ] Deduced a trap composed of 150 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:35:47] [INFO ] Deduced a trap composed of 118 places in 190 ms of which 2 ms to minimize.
[2024-05-28 16:35:48] [INFO ] Deduced a trap composed of 121 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:35:48] [INFO ] Deduced a trap composed of 128 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:35:48] [INFO ] Deduced a trap composed of 146 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:35:48] [INFO ] Deduced a trap composed of 152 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:35:48] [INFO ] Deduced a trap composed of 142 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:35:48] [INFO ] Deduced a trap composed of 150 places in 159 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/874 variables, and 118 constraints, problems are : Problem set: 0 solved, 581 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/581 constraints, Known Traps: 82/82 constraints]
After SMT, in 40691ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 40701ms
[2024-05-28 16:35:48] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:35:48] [INFO ] Invariant cache hit.
[2024-05-28 16:35:49] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-28 16:35:49] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:35:49] [INFO ] Invariant cache hit.
[2024-05-28 16:35:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:35:51] [INFO ] Implicit Places using invariants and state equation in 2347 ms returned []
Implicit Place search using SMT with State Equation took 2630 ms to find 0 implicit places.
[2024-05-28 16:35:51] [INFO ] Redundant transitions in 5 ms returned []
Running 581 sub problems to find dead transitions.
[2024-05-28 16:35:51] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:35:51] [INFO ] Invariant cache hit.
[2024-05-28 16:35:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:35:54] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:35:54] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:35:55] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:35:55] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:35:55] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:35:55] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 2 ms to minimize.
[2024-05-28 16:35:55] [INFO ] Deduced a trap composed of 153 places in 166 ms of which 5 ms to minimize.
[2024-05-28 16:35:55] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:35:55] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:35:56] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:35:56] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:35:56] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:35:57] [INFO ] Deduced a trap composed of 143 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:35:57] [INFO ] Deduced a trap composed of 151 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:35:57] [INFO ] Deduced a trap composed of 132 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:35:57] [INFO ] Deduced a trap composed of 123 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:35:57] [INFO ] Deduced a trap composed of 146 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:35:58] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:35:58] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:35:58] [INFO ] Deduced a trap composed of 117 places in 140 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:35:59] [INFO ] Deduced a trap composed of 146 places in 138 ms of which 5 ms to minimize.
[2024-05-28 16:35:59] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:35:59] [INFO ] Deduced a trap composed of 149 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:36:00] [INFO ] Deduced a trap composed of 99 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:36:00] [INFO ] Deduced a trap composed of 114 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:36:00] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:36:01] [INFO ] Deduced a trap composed of 122 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:36:01] [INFO ] Deduced a trap composed of 147 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:36:01] [INFO ] Deduced a trap composed of 155 places in 144 ms of which 1 ms to minimize.
[2024-05-28 16:36:01] [INFO ] Deduced a trap composed of 150 places in 197 ms of which 3 ms to minimize.
[2024-05-28 16:36:01] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:36:02] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:36:02] [INFO ] Deduced a trap composed of 143 places in 191 ms of which 4 ms to minimize.
[2024-05-28 16:36:02] [INFO ] Deduced a trap composed of 115 places in 142 ms of which 1 ms to minimize.
[2024-05-28 16:36:03] [INFO ] Deduced a trap composed of 144 places in 180 ms of which 2 ms to minimize.
[2024-05-28 16:36:03] [INFO ] Deduced a trap composed of 157 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:36:03] [INFO ] Deduced a trap composed of 144 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:36:03] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:36:04] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:36:04] [INFO ] Deduced a trap composed of 130 places in 124 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:36:07] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:36:07] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:36:07] [INFO ] Deduced a trap composed of 152 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:36:08] [INFO ] Deduced a trap composed of 144 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:36:08] [INFO ] Deduced a trap composed of 148 places in 192 ms of which 2 ms to minimize.
[2024-05-28 16:36:08] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:36:09] [INFO ] Deduced a trap composed of 119 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:36:09] [INFO ] Deduced a trap composed of 133 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:36:09] [INFO ] Deduced a trap composed of 120 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:36:10] [INFO ] Deduced a trap composed of 147 places in 183 ms of which 2 ms to minimize.
[2024-05-28 16:36:10] [INFO ] Deduced a trap composed of 142 places in 188 ms of which 2 ms to minimize.
[2024-05-28 16:36:11] [INFO ] Deduced a trap composed of 110 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:36:12] [INFO ] Deduced a trap composed of 110 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:36:12] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:36:12] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:36:12] [INFO ] Deduced a trap composed of 101 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:36:13] [INFO ] Deduced a trap composed of 151 places in 176 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:36:14] [INFO ] Deduced a trap composed of 147 places in 181 ms of which 2 ms to minimize.
[2024-05-28 16:36:14] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:36:14] [INFO ] Deduced a trap composed of 150 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:36:14] [INFO ] Deduced a trap composed of 148 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:36:15] [INFO ] Deduced a trap composed of 135 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:36:15] [INFO ] Deduced a trap composed of 126 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:36:15] [INFO ] Deduced a trap composed of 115 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:36:15] [INFO ] Deduced a trap composed of 130 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:36:16] [INFO ] Deduced a trap composed of 126 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:36:16] [INFO ] Deduced a trap composed of 123 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:36:16] [INFO ] Deduced a trap composed of 146 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:36:16] [INFO ] Deduced a trap composed of 130 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:36:16] [INFO ] Deduced a trap composed of 130 places in 135 ms of which 3 ms to minimize.
[2024-05-28 16:36:16] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:36:17] [INFO ] Deduced a trap composed of 127 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:36:18] [INFO ] Deduced a trap composed of 151 places in 184 ms of which 3 ms to minimize.
[2024-05-28 16:36:18] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 2 ms to minimize.
[2024-05-28 16:36:18] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:36:19] [INFO ] Deduced a trap composed of 114 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:36:19] [INFO ] Deduced a trap composed of 124 places in 175 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:36:20] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:36:20] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:36:20] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:36:20] [INFO ] Deduced a trap composed of 114 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:36:21] [INFO ] Deduced a trap composed of 150 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/874 variables, and 118 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 82/118 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:36:25] [INFO ] Deduced a trap composed of 97 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:36:32] [INFO ] Deduced a trap composed of 167 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:36:34] [INFO ] Deduced a trap composed of 126 places in 194 ms of which 3 ms to minimize.
[2024-05-28 16:36:34] [INFO ] Deduced a trap composed of 108 places in 189 ms of which 2 ms to minimize.
[2024-05-28 16:36:39] [INFO ] Deduced a trap composed of 124 places in 185 ms of which 2 ms to minimize.
[2024-05-28 16:36:41] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 3 ms to minimize.
[2024-05-28 16:36:41] [INFO ] Deduced a trap composed of 129 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:36:41] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:36:42] [INFO ] Deduced a trap composed of 149 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:36:42] [INFO ] Deduced a trap composed of 148 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:36:42] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:36:42] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 12/130 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:36:51] [INFO ] Deduced a trap composed of 139 places in 188 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/874 variables, and 131 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/581 constraints, Known Traps: 95/95 constraints]
After SMT, in 60562ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60570ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 103943 ms. Remains : 303/303 places, 583/583 transitions.
Built C files in :
/tmp/ltsmin18435921597623070374
[2024-05-28 16:36:52] [INFO ] Computing symmetric may disable matrix : 583 transitions.
[2024-05-28 16:36:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:36:52] [INFO ] Computing symmetric may enable matrix : 583 transitions.
[2024-05-28 16:36:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:36:52] [INFO ] Computing Do-Not-Accords matrix : 583 transitions.
[2024-05-28 16:36:52] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:36:52] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18435921597623070374
Running compilation step : cd /tmp/ltsmin18435921597623070374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1949 ms.
Running link step : cd /tmp/ltsmin18435921597623070374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin18435921597623070374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16842845705912549752.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 16:37:07] [INFO ] Flatten gal took : 20 ms
[2024-05-28 16:37:07] [INFO ] Flatten gal took : 20 ms
[2024-05-28 16:37:07] [INFO ] Time to serialize gal into /tmp/LTL18424532732177163946.gal : 5 ms
[2024-05-28 16:37:07] [INFO ] Time to serialize properties into /tmp/LTL8323206057592508550.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18424532732177163946.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1694362647823630491.hoa' '-atoms' '/tmp/LTL8323206057592508550.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8323206057592508550.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1694362647823630491.hoa
Detected timeout of ITS tools.
[2024-05-28 16:37:22] [INFO ] Flatten gal took : 34 ms
[2024-05-28 16:37:22] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:37:22] [INFO ] Time to serialize gal into /tmp/LTL10940271181057963299.gal : 6 ms
[2024-05-28 16:37:22] [INFO ] Time to serialize properties into /tmp/LTL15996134523539614668.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10940271181057963299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15996134523539614668.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G((X("(nyo_2<1)"))U(("(((P_1617_4>=1)&&(cIdleTasks>=1))&&(cJobCnt>=10))")U("(Insert_Source_E_2<1)"))))))
Formula 0 simplified : XF(X!"(nyo_2<1)" R (!"(((P_1617_4>=1)&&(cIdleTasks>=1))&&(cJobCnt>=10))" R !"(Insert_Source_E_2<1)"))
Detected timeout of ITS tools.
[2024-05-28 16:37:37] [INFO ] Flatten gal took : 40 ms
[2024-05-28 16:37:37] [INFO ] Applying decomposition
[2024-05-28 16:37:37] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9837659503894094651.txt' '-o' '/tmp/graph9837659503894094651.bin' '-w' '/tmp/graph9837659503894094651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9837659503894094651.bin' '-l' '-1' '-v' '-w' '/tmp/graph9837659503894094651.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:37:37] [INFO ] Decomposing Gal with order
[2024-05-28 16:37:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:37:37] [INFO ] Removed a total of 580 redundant transitions.
[2024-05-28 16:37:37] [INFO ] Flatten gal took : 67 ms
[2024-05-28 16:37:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 15 ms.
[2024-05-28 16:37:37] [INFO ] Time to serialize gal into /tmp/LTL12452441367420143155.gal : 8 ms
[2024-05-28 16:37:37] [INFO ] Time to serialize properties into /tmp/LTL3615533598040416161.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12452441367420143155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3615533598040416161.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X("(i4.u23.nyo_2<1)"))U(("(((i1.u18.P_1617_4>=1)&&(i3.u22.cIdleTasks>=1))&&(i2.u14.cJobCnt>=10))")U("(i1.u19.Insert_Source_E_2...165
Formula 0 simplified : XF(X!"(i4.u23.nyo_2<1)" R (!"(((i1.u18.P_1617_4>=1)&&(i3.u22.cIdleTasks>=1))&&(i2.u14.cJobCnt>=10))" R !"(i1.u19.Insert_Source_E_2<1...159
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-08 finished in 336081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 812/812 transitions.
Applied a total of 0 rules in 11 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:37:52] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2024-05-28 16:37:52] [INFO ] Computed 39 invariants in 20 ms
[2024-05-28 16:37:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:37:59] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 3 ms to minimize.
[2024-05-28 16:37:59] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:37:59] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:37:59] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:37:59] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:38:00] [INFO ] Deduced a trap composed of 104 places in 218 ms of which 3 ms to minimize.
[2024-05-28 16:38:00] [INFO ] Deduced a trap composed of 130 places in 174 ms of which 4 ms to minimize.
[2024-05-28 16:38:00] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:38:00] [INFO ] Deduced a trap composed of 237 places in 273 ms of which 4 ms to minimize.
[2024-05-28 16:38:01] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:38:01] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:38:01] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:38:01] [INFO ] Deduced a trap composed of 222 places in 239 ms of which 3 ms to minimize.
[2024-05-28 16:38:02] [INFO ] Deduced a trap composed of 253 places in 214 ms of which 3 ms to minimize.
[2024-05-28 16:38:02] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:38:05] [INFO ] Deduced a trap composed of 219 places in 249 ms of which 4 ms to minimize.
[2024-05-28 16:38:05] [INFO ] Deduced a trap composed of 236 places in 200 ms of which 3 ms to minimize.
[2024-05-28 16:38:06] [INFO ] Deduced a trap composed of 298 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:38:08] [INFO ] Deduced a trap composed of 231 places in 223 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 56 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:38:24] [INFO ] Deduced a trap composed of 255 places in 204 ms of which 3 ms to minimize.
[2024-05-28 16:38:26] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 10)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 10)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 3)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 21/21 constraints]
After SMT, in 40843ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40858ms
[2024-05-28 16:38:33] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:38:33] [INFO ] Invariant cache hit.
[2024-05-28 16:38:34] [INFO ] Implicit Places using invariants in 429 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 431 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/457 places, 812/812 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41309 ms. Remains : 456/457 places, 812/812 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-10 finished in 41464 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||X(p1))))'
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 812/812 transitions.
Applied a total of 0 rules in 4 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:38:34] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:38:34] [INFO ] Invariant cache hit.
[2024-05-28 16:38:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:38:40] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:38:41] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:38:41] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:38:41] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:38:41] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:38:42] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 3 ms to minimize.
[2024-05-28 16:38:42] [INFO ] Deduced a trap composed of 127 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:38:42] [INFO ] Deduced a trap composed of 229 places in 234 ms of which 7 ms to minimize.
[2024-05-28 16:38:43] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:38:43] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-05-28 16:38:43] [INFO ] Deduced a trap composed of 222 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:38:44] [INFO ] Deduced a trap composed of 218 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:38:46] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:38:46] [INFO ] Deduced a trap composed of 252 places in 198 ms of which 4 ms to minimize.
[2024-05-28 16:38:46] [INFO ] Deduced a trap composed of 229 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:38:46] [INFO ] Deduced a trap composed of 230 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:38:47] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 3 ms to minimize.
[2024-05-28 16:38:50] [INFO ] Deduced a trap composed of 264 places in 212 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:39:10] [INFO ] Deduced a trap composed of 249 places in 263 ms of which 4 ms to minimize.
[2024-05-28 16:39:13] [INFO ] Deduced a trap composed of 306 places in 239 ms of which 3 ms to minimize.
[2024-05-28 16:39:13] [INFO ] Deduced a trap composed of 86 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:39:14] [INFO ] Deduced a trap composed of 205 places in 237 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 9)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 3)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 59 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 22/22 constraints]
After SMT, in 40787ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40796ms
[2024-05-28 16:39:15] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:39:15] [INFO ] Invariant cache hit.
[2024-05-28 16:39:15] [INFO ] Implicit Places using invariants in 411 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 413 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/457 places, 812/812 transitions.
Applied a total of 0 rules in 6 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41221 ms. Remains : 456/457 places, 812/812 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-11 finished in 41340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 812/812 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 457 transition count 770
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 415 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 415 transition count 722
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 367 transition count 722
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 276 place count 319 transition count 674
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 280 place count 315 transition count 670
Iterating global reduction 2 with 4 rules applied. Total rules applied 284 place count 315 transition count 670
Applied a total of 284 rules in 46 ms. Remains 315 /457 variables (removed 142) and now considering 670/812 (removed 142) transitions.
Running 668 sub problems to find dead transitions.
[2024-05-28 16:39:15] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
// Phase 1: matrix 658 rows 315 cols
[2024-05-28 16:39:15] [INFO ] Computed 39 invariants in 16 ms
[2024-05-28 16:39:15] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-05-28 16:39:19] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:39:20] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:39:20] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:39:20] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:39:20] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:39:20] [INFO ] Deduced a trap composed of 108 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:39:20] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:39:20] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:39:21] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:39:22] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:39:22] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:39:23] [INFO ] Deduced a trap composed of 103 places in 184 ms of which 2 ms to minimize.
[2024-05-28 16:39:25] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/315 variables, 8/52 constraints. Problems are: Problem set: 66 solved, 602 unsolved
[2024-05-28 16:39:35] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:39:35] [INFO ] Deduced a trap composed of 167 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:39:35] [INFO ] Deduced a trap composed of 111 places in 176 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 315/973 variables, and 55 constraints, problems are : Problem set: 66 solved, 602 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/315 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 66 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 12/12 constraints. Problems are: Problem set: 66 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 19/31 constraints. Problems are: Problem set: 66 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 13/44 constraints. Problems are: Problem set: 66 solved, 602 unsolved
[2024-05-28 16:39:38] [INFO ] Deduced a trap composed of 140 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:39:38] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:39:39] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:39:39] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:39:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:39:39] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 1 ms to minimize.
[2024-05-28 16:39:39] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:39:39] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:39:39] [INFO ] Deduced a trap composed of 163 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:39:40] [INFO ] Deduced a trap composed of 161 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:39:40] [INFO ] Deduced a trap composed of 155 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:39:40] [INFO ] Deduced a trap composed of 155 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:39:40] [INFO ] Deduced a trap composed of 159 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:39:40] [INFO ] Deduced a trap composed of 181 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:39:40] [INFO ] Deduced a trap composed of 171 places in 185 ms of which 2 ms to minimize.
[2024-05-28 16:39:41] [INFO ] Deduced a trap composed of 171 places in 183 ms of which 2 ms to minimize.
[2024-05-28 16:39:41] [INFO ] Deduced a trap composed of 108 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:39:42] [INFO ] Deduced a trap composed of 119 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:39:43] [INFO ] Deduced a trap composed of 136 places in 234 ms of which 5 ms to minimize.
[2024-05-28 16:39:44] [INFO ] Deduced a trap composed of 157 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 20/64 constraints. Problems are: Problem set: 66 solved, 602 unsolved
[2024-05-28 16:39:46] [INFO ] Deduced a trap composed of 153 places in 203 ms of which 2 ms to minimize.
[2024-05-28 16:39:46] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:39:46] [INFO ] Deduced a trap composed of 152 places in 197 ms of which 2 ms to minimize.
[2024-05-28 16:39:47] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:39:47] [INFO ] Deduced a trap composed of 136 places in 237 ms of which 6 ms to minimize.
[2024-05-28 16:39:47] [INFO ] Deduced a trap composed of 179 places in 184 ms of which 3 ms to minimize.
[2024-05-28 16:39:48] [INFO ] Deduced a trap composed of 153 places in 228 ms of which 5 ms to minimize.
[2024-05-28 16:39:49] [INFO ] Deduced a trap composed of 169 places in 212 ms of which 5 ms to minimize.
[2024-05-28 16:39:49] [INFO ] Deduced a trap composed of 175 places in 213 ms of which 5 ms to minimize.
[2024-05-28 16:39:50] [INFO ] Deduced a trap composed of 175 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:39:52] [INFO ] Deduced a trap composed of 178 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:39:53] [INFO ] Deduced a trap composed of 188 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:39:53] [INFO ] Deduced a trap composed of 116 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:39:55] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 14/78 constraints. Problems are: Problem set: 66 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/973 variables, and 78 constraints, problems are : Problem set: 66 solved, 602 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/315 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/668 constraints, Known Traps: 47/50 constraints]
After SMT, in 41009ms problems are : Problem set: 66 solved, 602 unsolved
Search for dead transitions found 66 dead transitions in 41018ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-05-28 16:39:56] [INFO ] Flow matrix only has 592 transitions (discarded 12 similar events)
// Phase 1: matrix 592 rows 315 cols
[2024-05-28 16:39:56] [INFO ] Computed 39 invariants in 12 ms
[2024-05-28 16:39:57] [INFO ] Implicit Places using invariants in 384 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 399 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 314/457 places, 604/812 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 300 transition count 580
Applied a total of 12 rules in 17 ms. Remains 300 /314 variables (removed 14) and now considering 580/604 (removed 24) transitions.
[2024-05-28 16:39:57] [INFO ] Flow matrix only has 568 transitions (discarded 12 similar events)
// Phase 1: matrix 568 rows 300 cols
[2024-05-28 16:39:57] [INFO ] Computed 38 invariants in 10 ms
[2024-05-28 16:39:57] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-28 16:39:57] [INFO ] Flow matrix only has 568 transitions (discarded 12 similar events)
[2024-05-28 16:39:57] [INFO ] Invariant cache hit.
[2024-05-28 16:39:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:40:00] [INFO ] Implicit Places using invariants and state equation in 2388 ms returned []
Implicit Place search using SMT with State Equation took 2824 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 300/457 places, 580/812 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44311 ms. Remains : 300/457 places, 580/812 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-12
Stuttering criterion allowed to conclude after 1223 steps with 5 reset in 9 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-12 finished in 44432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((p0&&X(p1))))||G(p2))))'
Support contains 10 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 812/812 transitions.
Applied a total of 0 rules in 6 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:40:00] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2024-05-28 16:40:00] [INFO ] Computed 39 invariants in 17 ms
[2024-05-28 16:40:00] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:40:07] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:40:07] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 1 ms to minimize.
[2024-05-28 16:40:07] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:40:07] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:40:08] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 4 ms to minimize.
[2024-05-28 16:40:08] [INFO ] Deduced a trap composed of 104 places in 215 ms of which 3 ms to minimize.
[2024-05-28 16:40:08] [INFO ] Deduced a trap composed of 130 places in 209 ms of which 3 ms to minimize.
[2024-05-28 16:40:08] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:40:09] [INFO ] Deduced a trap composed of 237 places in 310 ms of which 3 ms to minimize.
[2024-05-28 16:40:09] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:40:09] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 2 ms to minimize.
[2024-05-28 16:40:09] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:40:10] [INFO ] Deduced a trap composed of 222 places in 264 ms of which 4 ms to minimize.
[2024-05-28 16:40:10] [INFO ] Deduced a trap composed of 253 places in 287 ms of which 4 ms to minimize.
[2024-05-28 16:40:11] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 2 ms to minimize.
[2024-05-28 16:40:13] [INFO ] Deduced a trap composed of 219 places in 237 ms of which 3 ms to minimize.
[2024-05-28 16:40:13] [INFO ] Deduced a trap composed of 236 places in 229 ms of which 4 ms to minimize.
[2024-05-28 16:40:15] [INFO ] Deduced a trap composed of 298 places in 253 ms of which 3 ms to minimize.
[2024-05-28 16:40:17] [INFO ] Deduced a trap composed of 231 places in 260 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 56 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:40:33] [INFO ] Deduced a trap composed of 255 places in 208 ms of which 2 ms to minimize.
[2024-05-28 16:40:35] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 21/21 constraints]
After SMT, in 40977ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40990ms
[2024-05-28 16:40:41] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:40:41] [INFO ] Invariant cache hit.
[2024-05-28 16:40:41] [INFO ] Implicit Places using invariants in 365 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 366 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/457 places, 812/812 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41370 ms. Remains : 456/457 places, 812/812 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-13
Product exploration explored 100000 steps with 33347 reset in 535 ms.
Product exploration explored 100000 steps with 33276 reset in 316 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 168 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (10 resets) in 447 ms. (89 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 498 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 438 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 634 ms. (62 steps per ms) remains 4/4 properties
[2024-05-28 16:40:43] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 16:40:43] [INFO ] Computed 38 invariants in 9 ms
[2024-05-28 16:40:43] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 232/242 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 51/293 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/295 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 452/1256 variables, and 35 constraints, problems are : Problem set: 4 solved, 0 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 211ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p2))), (G (OR p0 p2 p1)), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2))), (F p2), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 27 factoid took 470 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Support contains 10 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 812/812 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 456 transition count 782
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 426 transition count 776
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 420 transition count 776
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 72 place count 420 transition count 722
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 180 place count 366 transition count 722
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 238 place count 337 transition count 693
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 242 place count 333 transition count 689
Iterating global reduction 3 with 4 rules applied. Total rules applied 246 place count 333 transition count 689
Applied a total of 246 rules in 70 ms. Remains 333 /456 variables (removed 123) and now considering 689/812 (removed 123) transitions.
Running 687 sub problems to find dead transitions.
[2024-05-28 16:40:45] [INFO ] Flow matrix only has 677 transitions (discarded 12 similar events)
// Phase 1: matrix 677 rows 333 cols
[2024-05-28 16:40:45] [INFO ] Computed 38 invariants in 16 ms
[2024-05-28 16:40:45] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2024-05-28 16:40:50] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:40:50] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2024-05-28 16:40:50] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:40:50] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:40:50] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:40:51] [INFO ] Deduced a trap composed of 120 places in 187 ms of which 2 ms to minimize.
[2024-05-28 16:40:52] [INFO ] Deduced a trap composed of 134 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:40:52] [INFO ] Deduced a trap composed of 115 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:40:53] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:40:53] [INFO ] Deduced a trap composed of 67 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:40:53] [INFO ] Deduced a trap composed of 128 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:40:56] [INFO ] Deduced a trap composed of 205 places in 182 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-05-28 16:41:01] [INFO ] Deduced a trap composed of 204 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:41:01] [INFO ] Deduced a trap composed of 197 places in 173 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 331/1010 variables, and 53 constraints, problems are : Problem set: 0 solved, 687 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/333 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 687/687 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-05-28 16:41:09] [INFO ] Deduced a trap composed of 151 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:41:09] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:41:14] [INFO ] Deduced a trap composed of 153 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:41:15] [INFO ] Deduced a trap composed of 166 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:41:15] [INFO ] Deduced a trap composed of 152 places in 167 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/1010 variables, and 58 constraints, problems are : Problem set: 0 solved, 687 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/333 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/687 constraints, Known Traps: 22/22 constraints]
After SMT, in 40920ms problems are : Problem set: 0 solved, 687 unsolved
Search for dead transitions found 0 dead transitions in 40941ms
[2024-05-28 16:41:26] [INFO ] Flow matrix only has 677 transitions (discarded 12 similar events)
[2024-05-28 16:41:26] [INFO ] Invariant cache hit.
[2024-05-28 16:41:26] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-28 16:41:26] [INFO ] Flow matrix only has 677 transitions (discarded 12 similar events)
[2024-05-28 16:41:26] [INFO ] Invariant cache hit.
[2024-05-28 16:41:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:41:31] [INFO ] Implicit Places using invariants and state equation in 5032 ms returned []
Implicit Place search using SMT with State Equation took 5399 ms to find 0 implicit places.
[2024-05-28 16:41:31] [INFO ] Redundant transitions in 11 ms returned []
Running 687 sub problems to find dead transitions.
[2024-05-28 16:41:31] [INFO ] Flow matrix only has 677 transitions (discarded 12 similar events)
[2024-05-28 16:41:31] [INFO ] Invariant cache hit.
[2024-05-28 16:41:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-05-28 16:41:35] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:41:35] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:41:36] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:41:36] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:41:36] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:41:36] [INFO ] Deduced a trap composed of 120 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:41:36] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:41:36] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:41:36] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 205 places in 222 ms of which 3 ms to minimize.
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 128 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 134 places in 129 ms of which 1 ms to minimize.
[2024-05-28 16:41:39] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:41:40] [INFO ] Deduced a trap composed of 126 places in 160 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-05-28 16:41:43] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 687 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/333 variables, 2/54 constraints. Problems are: Problem set: 66 solved, 621 unsolved
[2024-05-28 16:41:56] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:41:57] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:41:57] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:42:00] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 2 ms to minimize.
[2024-05-28 16:42:00] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 5/59 constraints. Problems are: Problem set: 66 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/1010 variables, and 59 constraints, problems are : Problem set: 66 solved, 621 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/333 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 687/687 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 66 solved, 621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 13/13 constraints. Problems are: Problem set: 66 solved, 621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 23/36 constraints. Problems are: Problem set: 66 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 16/52 constraints. Problems are: Problem set: 66 solved, 621 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/52 constraints. Problems are: Problem set: 66 solved, 621 unsolved
At refinement iteration 4 (OVERLAPS) 2/333 variables, 2/54 constraints. Problems are: Problem set: 66 solved, 621 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 5/59 constraints. Problems are: Problem set: 66 solved, 621 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/59 constraints. Problems are: Problem set: 66 solved, 621 unsolved
At refinement iteration 7 (OVERLAPS) 677/1010 variables, 333/392 constraints. Problems are: Problem set: 66 solved, 621 unsolved
SMT process timed out in 60798ms, After SMT, problems are : Problem set: 66 solved, 621 unsolved
Search for dead transitions found 66 dead transitions in 60806ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 333/456 places, 623/812 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 319 transition count 599
Applied a total of 12 rules in 17 ms. Remains 319 /333 variables (removed 14) and now considering 599/623 (removed 24) transitions.
[2024-05-28 16:42:32] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
// Phase 1: matrix 587 rows 319 cols
[2024-05-28 16:42:32] [INFO ] Computed 38 invariants in 11 ms
[2024-05-28 16:42:32] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-28 16:42:32] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:42:32] [INFO ] Invariant cache hit.
[2024-05-28 16:42:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:42:35] [INFO ] Implicit Places using invariants and state equation in 2845 ms returned []
Implicit Place search using SMT with State Equation took 3120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 319/456 places, 599/812 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110380 ms. Remains : 319/456 places, 599/812 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 p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X p0), (X (AND p0 (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p2 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 217 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
RANDOM walk for 10676 steps (3 resets) in 254 ms. (41 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X p0), (X (AND p0 (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p2 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 (NOT p2) p0))), (F p2), (F (NOT (AND (NOT p2) p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 556 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Product exploration explored 100000 steps with 33335 reset in 301 ms.
Product exploration explored 100000 steps with 33366 reset in 272 ms.
Built C files in :
/tmp/ltsmin10006598113499069916
[2024-05-28 16:42:38] [INFO ] Computing symmetric may disable matrix : 599 transitions.
[2024-05-28 16:42:38] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:42:38] [INFO ] Computing symmetric may enable matrix : 599 transitions.
[2024-05-28 16:42:38] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:42:38] [INFO ] Computing Do-Not-Accords matrix : 599 transitions.
[2024-05-28 16:42:38] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:42:38] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10006598113499069916
Running compilation step : cd /tmp/ltsmin10006598113499069916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2121 ms.
Running link step : cd /tmp/ltsmin10006598113499069916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin10006598113499069916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3363988603075704647.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 599/599 transitions.
Applied a total of 0 rules in 18 ms. Remains 319 /319 variables (removed 0) and now considering 599/599 (removed 0) transitions.
Running 597 sub problems to find dead transitions.
[2024-05-28 16:42:53] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:42:53] [INFO ] Invariant cache hit.
[2024-05-28 16:42:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:42:56] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:42:56] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:42:57] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2024-05-28 16:42:57] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:42:57] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:42:57] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:42:57] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:42:57] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:42:57] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:42:57] [INFO ] Deduced a trap composed of 134 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:42:57] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 1 ms to minimize.
[2024-05-28 16:42:58] [INFO ] Deduced a trap composed of 124 places in 192 ms of which 2 ms to minimize.
[2024-05-28 16:42:58] [INFO ] Deduced a trap composed of 112 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:42:58] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:42:58] [INFO ] Deduced a trap composed of 109 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:42:58] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:42:58] [INFO ] Deduced a trap composed of 110 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:42:59] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:42:59] [INFO ] Deduced a trap composed of 159 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:42:59] [INFO ] Deduced a trap composed of 119 places in 167 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:43:00] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:43:00] [INFO ] Deduced a trap composed of 149 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:43:01] [INFO ] Deduced a trap composed of 126 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:43:01] [INFO ] Deduced a trap composed of 156 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:43:01] [INFO ] Deduced a trap composed of 145 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:43:01] [INFO ] Deduced a trap composed of 149 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:43:01] [INFO ] Deduced a trap composed of 197 places in 106 ms of which 1 ms to minimize.
[2024-05-28 16:43:01] [INFO ] Deduced a trap composed of 183 places in 184 ms of which 2 ms to minimize.
[2024-05-28 16:43:02] [INFO ] Deduced a trap composed of 131 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:43:02] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:43:02] [INFO ] Deduced a trap composed of 121 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:43:02] [INFO ] Deduced a trap composed of 146 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:43:03] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:43:03] [INFO ] Deduced a trap composed of 158 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:43:03] [INFO ] Deduced a trap composed of 158 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:43:03] [INFO ] Deduced a trap composed of 120 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:43:04] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:43:04] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:43:04] [INFO ] Deduced a trap composed of 166 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:43:04] [INFO ] Deduced a trap composed of 129 places in 164 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 99 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 140 places in 132 ms of which 1 ms to minimize.
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 134 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:43:10] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:43:10] [INFO ] Deduced a trap composed of 135 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:43:10] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 155 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 99 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 153 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:43:12] [INFO ] Deduced a trap composed of 145 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:43:12] [INFO ] Deduced a trap composed of 200 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:43:12] [INFO ] Deduced a trap composed of 203 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:43:12] [INFO ] Deduced a trap composed of 206 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:43:12] [INFO ] Deduced a trap composed of 134 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:43:13] [INFO ] Deduced a trap composed of 155 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:43:13] [INFO ] Deduced a trap composed of 155 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:43:13] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:43:13] [INFO ] Deduced a trap composed of 157 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/906 variables, and 96 constraints, problems are : Problem set: 0 solved, 597 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/319 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 597/597 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 597 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:43:16] [INFO ] Deduced a trap composed of 123 places in 194 ms of which 2 ms to minimize.
[2024-05-28 16:43:16] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 2 ms to minimize.
[2024-05-28 16:43:17] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:43:18] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:43:18] [INFO ] Deduced a trap composed of 153 places in 209 ms of which 2 ms to minimize.
[2024-05-28 16:43:20] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:43:26] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:43:26] [INFO ] Deduced a trap composed of 150 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:43:27] [INFO ] Deduced a trap composed of 139 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:43:27] [INFO ] Deduced a trap composed of 148 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:43:27] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:43:27] [INFO ] Deduced a trap composed of 129 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:43:27] [INFO ] Deduced a trap composed of 161 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:43:27] [INFO ] Deduced a trap composed of 161 places in 152 ms of which 6 ms to minimize.
[2024-05-28 16:43:28] [INFO ] Deduced a trap composed of 150 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:43:28] [INFO ] Deduced a trap composed of 150 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:43:28] [INFO ] Deduced a trap composed of 158 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:43:28] [INFO ] Deduced a trap composed of 171 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:43:28] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:43:28] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:43:29] [INFO ] Deduced a trap composed of 153 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:43:29] [INFO ] Deduced a trap composed of 159 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:43:29] [INFO ] Deduced a trap composed of 155 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:43:32] [INFO ] Deduced a trap composed of 150 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:43:33] [INFO ] Deduced a trap composed of 130 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:43:33] [INFO ] Deduced a trap composed of 139 places in 142 ms of which 2 ms to minimize.
SMT process timed out in 40540ms, After SMT, problems are : Problem set: 0 solved, 597 unsolved
Search for dead transitions found 0 dead transitions in 40550ms
[2024-05-28 16:43:33] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:43:33] [INFO ] Invariant cache hit.
[2024-05-28 16:43:33] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-28 16:43:33] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:43:33] [INFO ] Invariant cache hit.
[2024-05-28 16:43:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:43:36] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 2491 ms to find 0 implicit places.
[2024-05-28 16:43:36] [INFO ] Redundant transitions in 5 ms returned []
Running 597 sub problems to find dead transitions.
[2024-05-28 16:43:36] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:43:36] [INFO ] Invariant cache hit.
[2024-05-28 16:43:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:43:39] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2024-05-28 16:43:39] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 1 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 134 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:43:41] [INFO ] Deduced a trap composed of 124 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:43:41] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:43:41] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:43:41] [INFO ] Deduced a trap composed of 109 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:43:41] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:43:41] [INFO ] Deduced a trap composed of 110 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:43:42] [INFO ] Deduced a trap composed of 133 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:43:42] [INFO ] Deduced a trap composed of 159 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:43:42] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:43:42] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 1 ms to minimize.
[2024-05-28 16:43:43] [INFO ] Deduced a trap composed of 149 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:43:43] [INFO ] Deduced a trap composed of 126 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:43:43] [INFO ] Deduced a trap composed of 156 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:43:44] [INFO ] Deduced a trap composed of 145 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:43:44] [INFO ] Deduced a trap composed of 149 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:43:44] [INFO ] Deduced a trap composed of 197 places in 125 ms of which 1 ms to minimize.
[2024-05-28 16:43:44] [INFO ] Deduced a trap composed of 183 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:43:44] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:43:44] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:43:45] [INFO ] Deduced a trap composed of 121 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:43:45] [INFO ] Deduced a trap composed of 146 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:43:45] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 1 ms to minimize.
[2024-05-28 16:43:45] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 1 ms to minimize.
[2024-05-28 16:43:45] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:43:46] [INFO ] Deduced a trap composed of 120 places in 148 ms of which 1 ms to minimize.
[2024-05-28 16:43:46] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:43:46] [INFO ] Deduced a trap composed of 137 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:43:46] [INFO ] Deduced a trap composed of 166 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:43:46] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:43:50] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:43:50] [INFO ] Deduced a trap composed of 140 places in 114 ms of which 1 ms to minimize.
[2024-05-28 16:43:51] [INFO ] Deduced a trap composed of 134 places in 195 ms of which 2 ms to minimize.
[2024-05-28 16:43:51] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:43:51] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:43:51] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:43:52] [INFO ] Deduced a trap composed of 133 places in 107 ms of which 1 ms to minimize.
[2024-05-28 16:43:52] [INFO ] Deduced a trap composed of 155 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:43:52] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 1 ms to minimize.
[2024-05-28 16:43:52] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:43:52] [INFO ] Deduced a trap composed of 153 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:43:53] [INFO ] Deduced a trap composed of 145 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:43:53] [INFO ] Deduced a trap composed of 200 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:43:53] [INFO ] Deduced a trap composed of 203 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:43:53] [INFO ] Deduced a trap composed of 206 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:43:53] [INFO ] Deduced a trap composed of 134 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:43:54] [INFO ] Deduced a trap composed of 155 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:43:54] [INFO ] Deduced a trap composed of 155 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:43:54] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:43:54] [INFO ] Deduced a trap composed of 157 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:43:55] [INFO ] Deduced a trap composed of 148 places in 129 ms of which 1 ms to minimize.
[2024-05-28 16:43:55] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:43:55] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:43:56] [INFO ] Deduced a trap composed of 162 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:43:56] [INFO ] Deduced a trap composed of 175 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:43:56] [INFO ] Deduced a trap composed of 151 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:43:56] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:43:57] [INFO ] Deduced a trap composed of 170 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:43:57] [INFO ] Deduced a trap composed of 162 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:43:57] [INFO ] Deduced a trap composed of 199 places in 102 ms of which 1 ms to minimize.
[2024-05-28 16:43:57] [INFO ] Deduced a trap composed of 160 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:43:57] [INFO ] Deduced a trap composed of 159 places in 136 ms of which 3 ms to minimize.
[2024-05-28 16:43:57] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:43:57] [INFO ] Deduced a trap composed of 162 places in 132 ms of which 1 ms to minimize.
[2024-05-28 16:43:58] [INFO ] Deduced a trap composed of 160 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:43:58] [INFO ] Deduced a trap composed of 142 places in 130 ms of which 1 ms to minimize.
[2024-05-28 16:43:58] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 1 ms to minimize.
[2024-05-28 16:43:58] [INFO ] Deduced a trap composed of 89 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:43:59] [INFO ] Deduced a trap composed of 174 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:43:59] [INFO ] Deduced a trap composed of 166 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:44:00] [INFO ] Deduced a trap composed of 121 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:44:00] [INFO ] Deduced a trap composed of 155 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:44:00] [INFO ] Deduced a trap composed of 155 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:44:00] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:44:01] [INFO ] Deduced a trap composed of 143 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:44:01] [INFO ] Deduced a trap composed of 120 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:44:01] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:44:02] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:44:02] [INFO ] Deduced a trap composed of 143 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:44:02] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:44:02] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:44:02] [INFO ] Deduced a trap composed of 159 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:44:02] [INFO ] Deduced a trap composed of 165 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:44:03] [INFO ] Deduced a trap composed of 162 places in 121 ms of which 1 ms to minimize.
[2024-05-28 16:44:03] [INFO ] Deduced a trap composed of 153 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:44:03] [INFO ] Deduced a trap composed of 150 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:44:03] [INFO ] Deduced a trap composed of 162 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:44:03] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:44:03] [INFO ] Deduced a trap composed of 163 places in 122 ms of which 1 ms to minimize.
[2024-05-28 16:44:04] [INFO ] Deduced a trap composed of 163 places in 115 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/906 variables, and 136 constraints, problems are : Problem set: 0 solved, 597 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/319 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 597/597 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 597 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 100/136 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:44:09] [INFO ] Deduced a trap composed of 154 places in 182 ms of which 2 ms to minimize.
[2024-05-28 16:44:10] [INFO ] Deduced a trap composed of 155 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:44:10] [INFO ] Deduced a trap composed of 124 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:44:10] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:44:10] [INFO ] Deduced a trap composed of 143 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:44:10] [INFO ] Deduced a trap composed of 129 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:44:11] [INFO ] Deduced a trap composed of 136 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:44:14] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:44:14] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:44:14] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:44:15] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:44:15] [INFO ] Deduced a trap composed of 153 places in 148 ms of which 1 ms to minimize.
[2024-05-28 16:44:15] [INFO ] Deduced a trap composed of 155 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:44:16] [INFO ] Deduced a trap composed of 161 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 14/150 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:44:25] [INFO ] Deduced a trap composed of 163 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:44:26] [INFO ] Deduced a trap composed of 146 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:44:26] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:44:26] [INFO ] Deduced a trap composed of 135 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:44:26] [INFO ] Deduced a trap composed of 152 places in 176 ms of which 2 ms to minimize.
[2024-05-28 16:44:26] [INFO ] Deduced a trap composed of 121 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:44:27] [INFO ] Deduced a trap composed of 159 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:44:27] [INFO ] Deduced a trap composed of 145 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:44:27] [INFO ] Deduced a trap composed of 134 places in 188 ms of which 2 ms to minimize.
[2024-05-28 16:44:27] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:44:28] [INFO ] Deduced a trap composed of 160 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:44:28] [INFO ] Deduced a trap composed of 146 places in 142 ms of which 1 ms to minimize.
[2024-05-28 16:44:28] [INFO ] Deduced a trap composed of 147 places in 136 ms of which 3 ms to minimize.
[2024-05-28 16:44:28] [INFO ] Deduced a trap composed of 152 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:44:30] [INFO ] Deduced a trap composed of 153 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:44:31] [INFO ] Deduced a trap composed of 122 places in 173 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 16/166 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/906 variables, and 166 constraints, problems are : Problem set: 0 solved, 597 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/319 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/597 constraints, Known Traps: 130/130 constraints]
After SMT, in 60582ms problems are : Problem set: 0 solved, 597 unsolved
Search for dead transitions found 0 dead transitions in 60587ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 103666 ms. Remains : 319/319 places, 599/599 transitions.
Built C files in :
/tmp/ltsmin9900200612124061346
[2024-05-28 16:44:36] [INFO ] Computing symmetric may disable matrix : 599 transitions.
[2024-05-28 16:44:36] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:44:36] [INFO ] Computing symmetric may enable matrix : 599 transitions.
[2024-05-28 16:44:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:44:36] [INFO ] Computing Do-Not-Accords matrix : 599 transitions.
[2024-05-28 16:44:36] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:44:36] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9900200612124061346
Running compilation step : cd /tmp/ltsmin9900200612124061346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1901 ms.
Running link step : cd /tmp/ltsmin9900200612124061346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin9900200612124061346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12832808548109710241.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 16:44:52] [INFO ] Flatten gal took : 34 ms
[2024-05-28 16:44:52] [INFO ] Flatten gal took : 26 ms
[2024-05-28 16:44:52] [INFO ] Time to serialize gal into /tmp/LTL3635706520370187249.gal : 13 ms
[2024-05-28 16:44:52] [INFO ] Time to serialize properties into /tmp/LTL953073229710868790.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3635706520370187249.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8186814672234227897.hoa' '-atoms' '/tmp/LTL953073229710868790.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL953073229710868790.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8186814672234227897.hoa
Detected timeout of ITS tools.
[2024-05-28 16:45:07] [INFO ] Flatten gal took : 32 ms
[2024-05-28 16:45:07] [INFO ] Flatten gal took : 28 ms
[2024-05-28 16:45:07] [INFO ] Time to serialize gal into /tmp/LTL3558339971093087731.gal : 8 ms
[2024-05-28 16:45:07] [INFO ] Time to serialize properties into /tmp/LTL3329222269237365096.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3558339971093087731.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3329222269237365096.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("((((cBlockedTasks<10)||(ORB_Lock<1))||((AbourtToModifySrc_1<1)||(Abort_Check_Sources_E_5<1)))||(PollingAbort<1))")&&(X("((...262
Formula 0 simplified : G(FG(!"((((cBlockedTasks<10)||(ORB_Lock<1))||((AbourtToModifySrc_1<1)||(Abort_Check_Sources_E_5<1)))||(PollingAbort<1))" | X!"((TryA...250
Detected timeout of ITS tools.
[2024-05-28 16:45:22] [INFO ] Flatten gal took : 15 ms
[2024-05-28 16:45:22] [INFO ] Applying decomposition
[2024-05-28 16:45:22] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7843350564940897119.txt' '-o' '/tmp/graph7843350564940897119.bin' '-w' '/tmp/graph7843350564940897119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7843350564940897119.bin' '-l' '-1' '-v' '-w' '/tmp/graph7843350564940897119.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:45:22] [INFO ] Decomposing Gal with order
[2024-05-28 16:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:45:22] [INFO ] Removed a total of 480 redundant transitions.
[2024-05-28 16:45:22] [INFO ] Flatten gal took : 65 ms
[2024-05-28 16:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 339 labels/synchronizations in 20 ms.
[2024-05-28 16:45:22] [INFO ] Time to serialize gal into /tmp/LTL10401202506732517089.gal : 4 ms
[2024-05-28 16:45:22] [INFO ] Time to serialize properties into /tmp/LTL13209077245673872339.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10401202506732517089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13209077245673872339.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("((((i0.u0.cBlockedTasks<10)||(i0.u0.ORB_Lock<1))||((i0.u0.AbourtToModifySrc_1<1)||(i0.u0.Abort_Check_Sources_E_5<1)))||(i0...323
Formula 0 simplified : G(FG(!"((((i0.u0.cBlockedTasks<10)||(i0.u0.ORB_Lock<1))||((i0.u0.AbourtToModifySrc_1<1)||(i0.u0.Abort_Check_Sources_E_5<1)))||(i0.u0...311
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-13 finished in 337399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 812/812 transitions.
Applied a total of 0 rules in 41 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 16:45:37] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2024-05-28 16:45:37] [INFO ] Computed 39 invariants in 13 ms
[2024-05-28 16:45:37] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:45:43] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:45:43] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:45:43] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:45:43] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:45:44] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:45:44] [INFO ] Deduced a trap composed of 104 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:45:44] [INFO ] Deduced a trap composed of 130 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:45:44] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:45:45] [INFO ] Deduced a trap composed of 237 places in 232 ms of which 3 ms to minimize.
[2024-05-28 16:45:45] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:45:45] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:45:45] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2024-05-28 16:45:45] [INFO ] Deduced a trap composed of 222 places in 200 ms of which 2 ms to minimize.
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 253 places in 236 ms of which 4 ms to minimize.
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:45:48] [INFO ] Deduced a trap composed of 219 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:45:48] [INFO ] Deduced a trap composed of 236 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:45:49] [INFO ] Deduced a trap composed of 298 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:45:51] [INFO ] Deduced a trap composed of 231 places in 251 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 16:45:57] [INFO ] Deduced a trap composed of 42 places in 286 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 10.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 20/20 constraints]
After SMT, in 41014ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 41024ms
[2024-05-28 16:46:18] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 16:46:18] [INFO ] Invariant cache hit.
[2024-05-28 16:46:18] [INFO ] Implicit Places using invariants in 376 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 378 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/457 places, 812/812 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41453 ms. Remains : 456/457 places, 812/812 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-15 finished in 41634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J04T06-LTLFireability-06
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 457 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 457/457 places, 812/812 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 457 transition count 770
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 415 transition count 770
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 84 place count 415 transition count 734
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 156 place count 379 transition count 734
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 252 place count 331 transition count 686
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 256 place count 327 transition count 682
Iterating global reduction 2 with 4 rules applied. Total rules applied 260 place count 327 transition count 682
Applied a total of 260 rules in 37 ms. Remains 327 /457 variables (removed 130) and now considering 682/812 (removed 130) transitions.
Running 680 sub problems to find dead transitions.
[2024-05-28 16:46:19] [INFO ] Flow matrix only has 670 transitions (discarded 12 similar events)
// Phase 1: matrix 670 rows 327 cols
[2024-05-28 16:46:19] [INFO ] Computed 39 invariants in 6 ms
[2024-05-28 16:46:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 680 unsolved
[2024-05-28 16:46:23] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:46:23] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:46:24] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 680 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/327 variables, 7/42 constraints. Problems are: Problem set: 66 solved, 614 unsolved
[2024-05-28 16:46:33] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2024-05-28 16:46:33] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:46:33] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:46:33] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:46:34] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:46:34] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:46:34] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:46:34] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:46:35] [INFO ] Deduced a trap composed of 120 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:46:35] [INFO ] Deduced a trap composed of 119 places in 201 ms of which 2 ms to minimize.
[2024-05-28 16:46:36] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:46:36] [INFO ] Deduced a trap composed of 135 places in 211 ms of which 3 ms to minimize.
[2024-05-28 16:46:37] [INFO ] Deduced a trap composed of 133 places in 227 ms of which 3 ms to minimize.
[2024-05-28 16:46:37] [INFO ] Deduced a trap composed of 128 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:46:39] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:46:39] [INFO ] Deduced a trap composed of 126 places in 187 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 327/997 variables, and 58 constraints, problems are : Problem set: 66 solved, 614 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/327 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 66 solved, 614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 16/16 constraints. Problems are: Problem set: 66 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 16/32 constraints. Problems are: Problem set: 66 solved, 614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 16/48 constraints. Problems are: Problem set: 66 solved, 614 unsolved
[2024-05-28 16:46:41] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 1/49 constraints. Problems are: Problem set: 66 solved, 614 unsolved
[2024-05-28 16:46:47] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 1/50 constraints. Problems are: Problem set: 66 solved, 614 unsolved
[2024-05-28 16:46:48] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 1 ms to minimize.
[2024-05-28 16:46:49] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 2/52 constraints. Problems are: Problem set: 66 solved, 614 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/52 constraints. Problems are: Problem set: 66 solved, 614 unsolved
At refinement iteration 7 (OVERLAPS) 2/327 variables, 7/59 constraints. Problems are: Problem set: 66 solved, 614 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 3/62 constraints. Problems are: Problem set: 66 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/997 variables, and 62 constraints, problems are : Problem set: 66 solved, 614 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/327 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/680 constraints, Known Traps: 23/23 constraints]
After SMT, in 40829ms problems are : Problem set: 66 solved, 614 unsolved
Search for dead transitions found 66 dead transitions in 40840ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-05-28 16:47:00] [INFO ] Flow matrix only has 604 transitions (discarded 12 similar events)
// Phase 1: matrix 604 rows 327 cols
[2024-05-28 16:47:00] [INFO ] Computed 39 invariants in 19 ms
[2024-05-28 16:47:00] [INFO ] Implicit Places using invariants in 438 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 440 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 326/457 places, 616/812 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 312 transition count 592
Applied a total of 12 rules in 12 ms. Remains 312 /326 variables (removed 14) and now considering 592/616 (removed 24) transitions.
[2024-05-28 16:47:00] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
// Phase 1: matrix 580 rows 312 cols
[2024-05-28 16:47:00] [INFO ] Computed 38 invariants in 9 ms
[2024-05-28 16:47:01] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-28 16:47:01] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
[2024-05-28 16:47:01] [INFO ] Invariant cache hit.
[2024-05-28 16:47:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:47:02] [INFO ] Implicit Places using invariants and state equation in 1779 ms returned []
Implicit Place search using SMT with State Equation took 2113 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 312/457 places, 592/812 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 43446 ms. Remains : 312/457 places, 592/812 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-06
Product exploration explored 100000 steps with 3972 reset in 311 ms.
Product exploration explored 100000 steps with 3944 reset in 326 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 80 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 16:47:04] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
[2024-05-28 16:47:04] [INFO ] Invariant cache hit.
[2024-05-28 16:47:04] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-28 16:47:04] [INFO ] [Real]Absence check using 13 positive and 25 generalized place invariants in 36 ms returned sat
[2024-05-28 16:47:04] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2024-05-28 16:47:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:47:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-28 16:47:05] [INFO ] [Nat]Absence check using 13 positive and 25 generalized place invariants in 36 ms returned sat
[2024-05-28 16:47:05] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2024-05-28 16:47:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:47:06] [INFO ] [Nat]Added 72 Read/Feed constraints in 168 ms returned sat
[2024-05-28 16:47:06] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:47:06] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:47:06] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 2 ms to minimize.
[2024-05-28 16:47:06] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:47:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 817 ms
[2024-05-28 16:47:06] [INFO ] Computed and/alt/rep : 368/1631/362 causal constraints (skipped 216 transitions) in 61 ms.
[2024-05-28 16:47:10] [INFO ] Added : 340 causal constraints over 69 iterations in 4006 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 592/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 592/592 (removed 0) transitions.
Running 590 sub problems to find dead transitions.
[2024-05-28 16:47:10] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
[2024-05-28 16:47:10] [INFO ] Invariant cache hit.
[2024-05-28 16:47:10] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:47:14] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:47:14] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:47:14] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 140 places in 135 ms of which 3 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 129 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 134 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 167 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 177 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 130 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 130 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 185 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:47:17] [INFO ] Deduced a trap composed of 178 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:47:17] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:47:17] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:47:17] [INFO ] Deduced a trap composed of 130 places in 176 ms of which 2 ms to minimize.
[2024-05-28 16:47:18] [INFO ] Deduced a trap composed of 128 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:47:18] [INFO ] Deduced a trap composed of 132 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:47:18] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:47:18] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:47:18] [INFO ] Deduced a trap composed of 140 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:47:18] [INFO ] Deduced a trap composed of 142 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:47:19] [INFO ] Deduced a trap composed of 139 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:47:19] [INFO ] Deduced a trap composed of 163 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:47:19] [INFO ] Deduced a trap composed of 121 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:47:20] [INFO ] Deduced a trap composed of 163 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:47:20] [INFO ] Deduced a trap composed of 132 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:47:20] [INFO ] Deduced a trap composed of 167 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:47:20] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:47:21] [INFO ] Deduced a trap composed of 140 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:47:21] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:47:21] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:47:21] [INFO ] Deduced a trap composed of 155 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:47:22] [INFO ] Deduced a trap composed of 166 places in 177 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:47:26] [INFO ] Deduced a trap composed of 146 places in 181 ms of which 4 ms to minimize.
[2024-05-28 16:47:26] [INFO ] Deduced a trap composed of 173 places in 171 ms of which 4 ms to minimize.
[2024-05-28 16:47:26] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:47:26] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:47:26] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:47:26] [INFO ] Deduced a trap composed of 140 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:47:27] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:47:27] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:47:27] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 1 ms to minimize.
[2024-05-28 16:47:28] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:47:28] [INFO ] Deduced a trap composed of 142 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:47:28] [INFO ] Deduced a trap composed of 147 places in 181 ms of which 2 ms to minimize.
[2024-05-28 16:47:28] [INFO ] Deduced a trap composed of 148 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:47:29] [INFO ] Deduced a trap composed of 140 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:47:29] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:47:30] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:47:30] [INFO ] Deduced a trap composed of 88 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:47:30] [INFO ] Deduced a trap composed of 170 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:47:30] [INFO ] Deduced a trap composed of 168 places in 188 ms of which 5 ms to minimize.
[2024-05-28 16:47:31] [INFO ] Deduced a trap composed of 170 places in 164 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/892 variables, and 88 constraints, problems are : Problem set: 0 solved, 590 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 15/25 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 60/88 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:47:33] [INFO ] Deduced a trap composed of 147 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:47:34] [INFO ] Deduced a trap composed of 136 places in 602 ms of which 2 ms to minimize.
[2024-05-28 16:47:37] [INFO ] Deduced a trap composed of 114 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:47:40] [INFO ] Deduced a trap composed of 127 places in 170 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:47:44] [INFO ] Deduced a trap composed of 175 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:47:45] [INFO ] Deduced a trap composed of 163 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:47:45] [INFO ] Deduced a trap composed of 177 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:47:45] [INFO ] Deduced a trap composed of 181 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:47:45] [INFO ] Deduced a trap composed of 171 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:47:45] [INFO ] Deduced a trap composed of 157 places in 145 ms of which 1 ms to minimize.
[2024-05-28 16:47:45] [INFO ] Deduced a trap composed of 177 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:47:46] [INFO ] Deduced a trap composed of 172 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:47:46] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 2 ms to minimize.
[2024-05-28 16:47:46] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 1 ms to minimize.
[2024-05-28 16:47:46] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:47:46] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 1 ms to minimize.
[2024-05-28 16:47:47] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:47:47] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:47:47] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:47:47] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:47:47] [INFO ] Deduced a trap composed of 172 places in 184 ms of which 2 ms to minimize.
[2024-05-28 16:47:47] [INFO ] Deduced a trap composed of 152 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:47:48] [INFO ] Deduced a trap composed of 147 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:47:48] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 590 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 310/892 variables, and 112 constraints, problems are : Problem set: 0 solved, 590 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 15/25 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 84/84 constraints]
After SMT, in 40651ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 40663ms
[2024-05-28 16:47:51] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
[2024-05-28 16:47:51] [INFO ] Invariant cache hit.
[2024-05-28 16:47:51] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-28 16:47:51] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
[2024-05-28 16:47:51] [INFO ] Invariant cache hit.
[2024-05-28 16:47:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:47:53] [INFO ] Implicit Places using invariants and state equation in 1696 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-05-28 16:47:53] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
[2024-05-28 16:47:53] [INFO ] Invariant cache hit.
[2024-05-28 16:47:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:47:57] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:47:57] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 2 ms to minimize.
[2024-05-28 16:47:57] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:47:58] [INFO ] Deduced a trap composed of 140 places in 148 ms of which 1 ms to minimize.
[2024-05-28 16:47:58] [INFO ] Deduced a trap composed of 129 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:47:58] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:47:58] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2024-05-28 16:47:58] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 1 ms to minimize.
[2024-05-28 16:47:58] [INFO ] Deduced a trap composed of 167 places in 126 ms of which 1 ms to minimize.
[2024-05-28 16:47:58] [INFO ] Deduced a trap composed of 177 places in 148 ms of which 1 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 130 places in 108 ms of which 1 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 2 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 130 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 185 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 178 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:48:00] [INFO ] Deduced a trap composed of 132 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:48:00] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2024-05-28 16:48:00] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:48:00] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:48:01] [INFO ] Deduced a trap composed of 132 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:48:01] [INFO ] Deduced a trap composed of 148 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:48:01] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:48:01] [INFO ] Deduced a trap composed of 140 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:48:01] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:48:02] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:48:02] [INFO ] Deduced a trap composed of 163 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:48:02] [INFO ] Deduced a trap composed of 121 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:48:02] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:48:03] [INFO ] Deduced a trap composed of 132 places in 133 ms of which 3 ms to minimize.
[2024-05-28 16:48:03] [INFO ] Deduced a trap composed of 167 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:48:03] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:48:04] [INFO ] Deduced a trap composed of 140 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:48:04] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:48:04] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:48:04] [INFO ] Deduced a trap composed of 155 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:48:04] [INFO ] Deduced a trap composed of 166 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:48:08] [INFO ] Deduced a trap composed of 146 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:48:08] [INFO ] Deduced a trap composed of 173 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:48:08] [INFO ] Deduced a trap composed of 164 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:48:09] [INFO ] Deduced a trap composed of 133 places in 112 ms of which 1 ms to minimize.
[2024-05-28 16:48:09] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:48:09] [INFO ] Deduced a trap composed of 140 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:48:09] [INFO ] Deduced a trap composed of 137 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:48:09] [INFO ] Deduced a trap composed of 168 places in 94 ms of which 1 ms to minimize.
[2024-05-28 16:48:09] [INFO ] Deduced a trap composed of 135 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:48:10] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:48:10] [INFO ] Deduced a trap composed of 142 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:48:11] [INFO ] Deduced a trap composed of 147 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:48:11] [INFO ] Deduced a trap composed of 148 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:48:11] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:48:12] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:48:12] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:48:12] [INFO ] Deduced a trap composed of 88 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:48:13] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:48:13] [INFO ] Deduced a trap composed of 168 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:48:13] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:48:14] [INFO ] Deduced a trap composed of 154 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:48:14] [INFO ] Deduced a trap composed of 137 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:48:14] [INFO ] Deduced a trap composed of 173 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:48:14] [INFO ] Deduced a trap composed of 155 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:48:14] [INFO ] Deduced a trap composed of 137 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:48:15] [INFO ] Deduced a trap composed of 129 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:48:16] [INFO ] Deduced a trap composed of 131 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:48:16] [INFO ] Deduced a trap composed of 175 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:48:16] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:48:17] [INFO ] Deduced a trap composed of 141 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 88 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 4 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 163 places in 133 ms of which 3 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 183 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 184 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:48:20] [INFO ] Deduced a trap composed of 151 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:48:20] [INFO ] Deduced a trap composed of 136 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:48:21] [INFO ] Deduced a trap composed of 173 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 18/106 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:48:22] [INFO ] Deduced a trap composed of 175 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:48:23] [INFO ] Deduced a trap composed of 144 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:48:23] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:48:24] [INFO ] Deduced a trap composed of 145 places in 151 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 9.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.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 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/892 variables, and 110 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 15/25 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 82/110 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:48:32] [INFO ] Deduced a trap composed of 127 places in 107 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:48:36] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:48:36] [INFO ] Deduced a trap composed of 175 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:48:36] [INFO ] Deduced a trap composed of 177 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:48:36] [INFO ] Deduced a trap composed of 145 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:48:37] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:48:37] [INFO ] Deduced a trap composed of 173 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:48:37] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 2 ms to minimize.
[2024-05-28 16:48:37] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:48:37] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:48:38] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 2 ms to minimize.
[2024-05-28 16:48:38] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:48:38] [INFO ] Deduced a trap composed of 155 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:48:38] [INFO ] Deduced a trap composed of 133 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:48:38] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:48:38] [INFO ] Deduced a trap composed of 167 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:48:39] [INFO ] Deduced a trap composed of 174 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:48:39] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:48:39] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:48:39] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:48:39] [INFO ] Deduced a trap composed of 141 places in 167 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:48:43] [INFO ] Deduced a trap composed of 166 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:48:43] [INFO ] Deduced a trap composed of 151 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:48:44] [INFO ] Deduced a trap composed of 136 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:48:44] [INFO ] Deduced a trap composed of 143 places in 125 ms of which 1 ms to minimize.
[2024-05-28 16:48:44] [INFO ] Deduced a trap composed of 140 places in 176 ms of which 2 ms to minimize.
[2024-05-28 16:48:44] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:48:44] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:48:45] [INFO ] Deduced a trap composed of 144 places in 181 ms of which 3 ms to minimize.
[2024-05-28 16:48:45] [INFO ] Deduced a trap composed of 145 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:48:45] [INFO ] Deduced a trap composed of 130 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:48:45] [INFO ] Deduced a trap composed of 146 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:48:45] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:48:45] [INFO ] Deduced a trap composed of 158 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:48:46] [INFO ] Deduced a trap composed of 146 places in 181 ms of which 2 ms to minimize.
[2024-05-28 16:48:46] [INFO ] Deduced a trap composed of 120 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:48:46] [INFO ] Deduced a trap composed of 140 places in 191 ms of which 2 ms to minimize.
[2024-05-28 16:48:46] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:48:47] [INFO ] Deduced a trap composed of 129 places in 179 ms of which 2 ms to minimize.
[2024-05-28 16:48:47] [INFO ] Deduced a trap composed of 159 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:48:47] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:48:51] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 4 ms to minimize.
[2024-05-28 16:48:51] [INFO ] Deduced a trap composed of 167 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:48:52] [INFO ] Deduced a trap composed of 169 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:48:52] [INFO ] Deduced a trap composed of 157 places in 180 ms of which 2 ms to minimize.
[2024-05-28 16:48:52] [INFO ] Deduced a trap composed of 175 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:48:52] [INFO ] Deduced a trap composed of 178 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:48:52] [INFO ] Deduced a trap composed of 175 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:48:53] [INFO ] Deduced a trap composed of 177 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:48:53] [INFO ] Deduced a trap composed of 169 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:48:53] [INFO ] Deduced a trap composed of 173 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:48:53] [INFO ] Deduced a trap composed of 177 places in 139 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/892 variables, and 162 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 15/25 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 134/134 constraints]
After SMT, in 60707ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60719ms
Finished structural reductions in LTL mode , in 1 iterations and 103384 ms. Remains : 312/312 places, 592/592 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 102 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 16:48:54] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
[2024-05-28 16:48:54] [INFO ] Invariant cache hit.
[2024-05-28 16:48:55] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-28 16:48:55] [INFO ] [Real]Absence check using 13 positive and 25 generalized place invariants in 52 ms returned sat
[2024-05-28 16:48:56] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2024-05-28 16:48:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:48:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 16:48:56] [INFO ] [Nat]Absence check using 13 positive and 25 generalized place invariants in 37 ms returned sat
[2024-05-28 16:48:57] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2024-05-28 16:48:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:48:57] [INFO ] [Nat]Added 72 Read/Feed constraints in 178 ms returned sat
[2024-05-28 16:48:57] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:48:57] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:48:58] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:48:58] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:48:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 874 ms
[2024-05-28 16:48:58] [INFO ] Computed and/alt/rep : 368/1631/362 causal constraints (skipped 216 transitions) in 55 ms.
[2024-05-28 16:49:02] [INFO ] Added : 340 causal constraints over 69 iterations in 4305 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3958 reset in 370 ms.
Product exploration explored 100000 steps with 3942 reset in 292 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 592/592 transitions.
Applied a total of 0 rules in 16 ms. Remains 312 /312 variables (removed 0) and now considering 592/592 (removed 0) transitions.
Running 590 sub problems to find dead transitions.
[2024-05-28 16:49:03] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
[2024-05-28 16:49:03] [INFO ] Invariant cache hit.
[2024-05-28 16:49:03] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:49:07] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:49:07] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:49:07] [INFO ] Deduced a trap composed of 126 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:49:07] [INFO ] Deduced a trap composed of 140 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:49:07] [INFO ] Deduced a trap composed of 129 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:49:08] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:49:08] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:49:08] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:49:08] [INFO ] Deduced a trap composed of 167 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:49:08] [INFO ] Deduced a trap composed of 177 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:49:08] [INFO ] Deduced a trap composed of 130 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:49:08] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:49:08] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:49:08] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:49:09] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:49:09] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:49:09] [INFO ] Deduced a trap composed of 130 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:49:09] [INFO ] Deduced a trap composed of 185 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:49:09] [INFO ] Deduced a trap composed of 178 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:49:09] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:49:10] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2024-05-28 16:49:10] [INFO ] Deduced a trap composed of 130 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:49:10] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:49:10] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:49:11] [INFO ] Deduced a trap composed of 148 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:49:11] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:49:11] [INFO ] Deduced a trap composed of 140 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:49:11] [INFO ] Deduced a trap composed of 142 places in 119 ms of which 4 ms to minimize.
[2024-05-28 16:49:11] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:49:12] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:49:12] [INFO ] Deduced a trap composed of 121 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:49:12] [INFO ] Deduced a trap composed of 163 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:49:12] [INFO ] Deduced a trap composed of 132 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:49:13] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:49:13] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:49:13] [INFO ] Deduced a trap composed of 140 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:49:14] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:49:14] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:49:14] [INFO ] Deduced a trap composed of 155 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:49:14] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:49:18] [INFO ] Deduced a trap composed of 146 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:49:18] [INFO ] Deduced a trap composed of 173 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:49:18] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:49:18] [INFO ] Deduced a trap composed of 133 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:49:19] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:49:19] [INFO ] Deduced a trap composed of 140 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:49:19] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:49:19] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:49:19] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:49:20] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:49:20] [INFO ] Deduced a trap composed of 142 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:49:21] [INFO ] Deduced a trap composed of 147 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:49:21] [INFO ] Deduced a trap composed of 148 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:49:21] [INFO ] Deduced a trap composed of 140 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:49:22] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:49:22] [INFO ] Deduced a trap composed of 88 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:49:23] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:49:23] [INFO ] Deduced a trap composed of 170 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:49:23] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:49:23] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/892 variables, and 88 constraints, problems are : Problem set: 0 solved, 590 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 15/25 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 60/88 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:49:26] [INFO ] Deduced a trap composed of 147 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:49:27] [INFO ] Deduced a trap composed of 136 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:49:29] [INFO ] Deduced a trap composed of 114 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:49:32] [INFO ] Deduced a trap composed of 127 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:49:36] [INFO ] Deduced a trap composed of 175 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:49:37] [INFO ] Deduced a trap composed of 163 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:49:37] [INFO ] Deduced a trap composed of 177 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:49:37] [INFO ] Deduced a trap composed of 181 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:49:37] [INFO ] Deduced a trap composed of 171 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:49:37] [INFO ] Deduced a trap composed of 157 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:49:37] [INFO ] Deduced a trap composed of 177 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:49:37] [INFO ] Deduced a trap composed of 172 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:49:38] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:49:38] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:49:38] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:49:38] [INFO ] Deduced a trap composed of 153 places in 121 ms of which 1 ms to minimize.
[2024-05-28 16:49:38] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2024-05-28 16:49:38] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:49:38] [INFO ] Deduced a trap composed of 164 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:49:39] [INFO ] Deduced a trap composed of 153 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:49:39] [INFO ] Deduced a trap composed of 172 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:49:39] [INFO ] Deduced a trap composed of 152 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:49:39] [INFO ] Deduced a trap composed of 147 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:49:39] [INFO ] Deduced a trap composed of 152 places in 162 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 590 unsolved
(s86 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 9)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 1)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/892 variables, and 112 constraints, problems are : Problem set: 0 solved, 590 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 15/25 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 84/84 constraints]
After SMT, in 40608ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 40617ms
[2024-05-28 16:49:44] [INFO ] Redundant transitions in 6 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-28 16:49:44] [INFO ] Flow matrix only has 580 transitions (discarded 12 similar events)
[2024-05-28 16:49:44] [INFO ] Invariant cache hit.
[2024-05-28 16:49:44] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:49:48] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:49:48] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:49:48] [INFO ] Deduced a trap composed of 126 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:49:48] [INFO ] Deduced a trap composed of 140 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:49:48] [INFO ] Deduced a trap composed of 129 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:49:48] [INFO ] Deduced a trap composed of 88 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 167 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 177 places in 176 ms of which 2 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:49:50] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:49:50] [INFO ] Deduced a trap composed of 130 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:49:50] [INFO ] Deduced a trap composed of 185 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:49:50] [INFO ] Deduced a trap composed of 178 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:49:50] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:49:51] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:49:51] [INFO ] Deduced a trap composed of 130 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:49:51] [INFO ] Deduced a trap composed of 128 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:49:51] [INFO ] Deduced a trap composed of 132 places in 207 ms of which 2 ms to minimize.
[2024-05-28 16:49:52] [INFO ] Deduced a trap composed of 148 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:49:52] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:49:52] [INFO ] Deduced a trap composed of 140 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:49:52] [INFO ] Deduced a trap composed of 142 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:49:52] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:49:53] [INFO ] Deduced a trap composed of 163 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:49:53] [INFO ] Deduced a trap composed of 121 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:49:53] [INFO ] Deduced a trap composed of 163 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:49:53] [INFO ] Deduced a trap composed of 132 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:49:53] [INFO ] Deduced a trap composed of 167 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:49:54] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:49:54] [INFO ] Deduced a trap composed of 140 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:49:55] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:49:55] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:49:55] [INFO ] Deduced a trap composed of 155 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:49:55] [INFO ] Deduced a trap composed of 166 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:49:59] [INFO ] Deduced a trap composed of 146 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:49:59] [INFO ] Deduced a trap composed of 173 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:49:59] [INFO ] Deduced a trap composed of 164 places in 139 ms of which 1 ms to minimize.
[2024-05-28 16:49:59] [INFO ] Deduced a trap composed of 133 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:49:59] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 140 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 137 places in 112 ms of which 1 ms to minimize.
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 168 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 135 places in 103 ms of which 1 ms to minimize.
[2024-05-28 16:50:01] [INFO ] Deduced a trap composed of 135 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:50:01] [INFO ] Deduced a trap composed of 142 places in 125 ms of which 3 ms to minimize.
[2024-05-28 16:50:01] [INFO ] Deduced a trap composed of 147 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:50:01] [INFO ] Deduced a trap composed of 148 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:50:02] [INFO ] Deduced a trap composed of 140 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:50:03] [INFO ] Deduced a trap composed of 162 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:50:03] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:50:03] [INFO ] Deduced a trap composed of 88 places in 190 ms of which 2 ms to minimize.
[2024-05-28 16:50:04] [INFO ] Deduced a trap composed of 170 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:50:04] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:50:04] [INFO ] Deduced a trap composed of 170 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:50:05] [INFO ] Deduced a trap composed of 154 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:50:05] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:50:05] [INFO ] Deduced a trap composed of 173 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:50:05] [INFO ] Deduced a trap composed of 155 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:50:05] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:50:06] [INFO ] Deduced a trap composed of 129 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:50:06] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:50:07] [INFO ] Deduced a trap composed of 175 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:50:07] [INFO ] Deduced a trap composed of 141 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:50:07] [INFO ] Deduced a trap composed of 141 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:50:08] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:50:09] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:50:09] [INFO ] Deduced a trap composed of 163 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:50:09] [INFO ] Deduced a trap composed of 183 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:50:09] [INFO ] Deduced a trap composed of 184 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:50:11] [INFO ] Deduced a trap composed of 151 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:50:11] [INFO ] Deduced a trap composed of 136 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:50:11] [INFO ] Deduced a trap composed of 173 places in 174 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 18/106 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-28 16:50:12] [INFO ] Deduced a trap composed of 175 places in 153 ms of which 1 ms to minimize.
[2024-05-28 16:50:14] [INFO ] Deduced a trap composed of 144 places in 189 ms of which 2 ms to minimize.
[2024-05-28 16:50:14] [INFO ] Deduced a trap composed of 143 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:50:14] [INFO ] Deduced a trap composed of 145 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:50:15] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 2 ms to minimize.
SMT process timed out in 30761ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 30767ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71421 ms. Remains : 312/312 places, 592/592 transitions.
Built C files in :
/tmp/ltsmin13744642586506378076
[2024-05-28 16:50:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13744642586506378076
Running compilation step : cd /tmp/ltsmin13744642586506378076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1219 ms.
Running link step : cd /tmp/ltsmin13744642586506378076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13744642586506378076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12383453425843212636.hoa' '--buchi-type=spotba'
LTSmin run took 6842 ms.
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-06 finished in 244146 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-06 TRUE TECHNIQUES SHORTENING_INSENSITIVE
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((X(p0) U (p1 U p2)))))'
Found a Lengthening insensitive property : PolyORBLF-PT-S02J04T06-LTLFireability-08
Stuttering acceptance computed with spot in 308 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 457/457 places, 812/812 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 457 transition count 773
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 418 transition count 773
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 78 place count 418 transition count 724
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 176 place count 369 transition count 724
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 270 place count 322 transition count 677
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 274 place count 318 transition count 673
Iterating global reduction 2 with 4 rules applied. Total rules applied 278 place count 318 transition count 673
Applied a total of 278 rules in 55 ms. Remains 318 /457 variables (removed 139) and now considering 673/812 (removed 139) transitions.
Running 671 sub problems to find dead transitions.
[2024-05-28 16:50:23] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
// Phase 1: matrix 661 rows 318 cols
[2024-05-28 16:50:23] [INFO ] Computed 39 invariants in 17 ms
[2024-05-28 16:50:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 16:50:28] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:50:28] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:50:28] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:50:28] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:50:28] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:50:28] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:50:29] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:50:29] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:50:29] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:50:30] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 2 ms to minimize.
[2024-05-28 16:50:30] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:50:31] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:50:31] [INFO ] Deduced a trap composed of 116 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:50:31] [INFO ] Deduced a trap composed of 141 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:50:33] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 1 ms to minimize.
[2024-05-28 16:50:34] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 2 ms to minimize.
[2024-05-28 16:50:34] [INFO ] Deduced a trap composed of 145 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 16:50:38] [INFO ] Deduced a trap composed of 125 places in 180 ms of which 3 ms to minimize.
[2024-05-28 16:50:39] [INFO ] Deduced a trap composed of 181 places in 178 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/979 variables, and 56 constraints, problems are : Problem set: 0 solved, 671 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/318 variables, 2/58 constraints. Problems are: Problem set: 66 solved, 605 unsolved
[2024-05-28 16:51:00] [INFO ] Deduced a trap composed of 108 places in 221 ms of which 3 ms to minimize.
[2024-05-28 16:51:01] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:51:02] [INFO ] Deduced a trap composed of 107 places in 199 ms of which 2 ms to minimize.
[2024-05-28 16:51:03] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/979 variables, and 62 constraints, problems are : Problem set: 66 solved, 605 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 23/23 constraints]
After SMT, in 40962ms problems are : Problem set: 66 solved, 605 unsolved
Search for dead transitions found 66 dead transitions in 40974ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-05-28 16:51:04] [INFO ] Flow matrix only has 595 transitions (discarded 12 similar events)
// Phase 1: matrix 595 rows 318 cols
[2024-05-28 16:51:04] [INFO ] Computed 39 invariants in 8 ms
[2024-05-28 16:51:05] [INFO ] Implicit Places using invariants in 367 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 369 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 317/457 places, 607/812 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 303 transition count 583
Applied a total of 12 rules in 11 ms. Remains 303 /317 variables (removed 14) and now considering 583/607 (removed 24) transitions.
[2024-05-28 16:51:05] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
// Phase 1: matrix 571 rows 303 cols
[2024-05-28 16:51:05] [INFO ] Computed 38 invariants in 6 ms
[2024-05-28 16:51:05] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-28 16:51:05] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:51:05] [INFO ] Invariant cache hit.
[2024-05-28 16:51:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:51:07] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 303/457 places, 583/812 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 43523 ms. Remains : 303/457 places, 583/812 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-08
Product exploration explored 100000 steps with 419 reset in 423 ms.
Product exploration explored 100000 steps with 450 reset in 396 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 p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 199 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
RANDOM walk for 40000 steps (22 resets) in 338 ms. (117 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40001 steps (12 resets) in 580 ms. (68 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (14 resets) in 656 ms. (60 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 671 ms. (59 steps per ms) remains 3/3 properties
[2024-05-28 16:51:09] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:51:09] [INFO ] Invariant cache hit.
[2024-05-28 16:51:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 3 (OVERLAPS) 210/265 variables, 10/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/274 variables, 7/22 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Real declared 301/874 variables, and 37 constraints, problems are : Problem set: 3 solved, 0 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (G (OR p2 (NOT p1) p0)), (G (OR p2 p1 p0)), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 358 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), true]
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), true]
Support contains 2 out of 303 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 583/583 transitions.
Applied a total of 0 rules in 11 ms. Remains 303 /303 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Running 581 sub problems to find dead transitions.
[2024-05-28 16:51:10] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:51:10] [INFO ] Invariant cache hit.
[2024-05-28 16:51:10] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:51:13] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-05-28 16:51:13] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:51:13] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:51:13] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:51:13] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:51:13] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:51:14] [INFO ] Deduced a trap composed of 153 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:51:14] [INFO ] Deduced a trap composed of 147 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:51:14] [INFO ] Deduced a trap composed of 101 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:51:14] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:51:15] [INFO ] Deduced a trap composed of 139 places in 181 ms of which 3 ms to minimize.
[2024-05-28 16:51:15] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:51:15] [INFO ] Deduced a trap composed of 143 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:51:15] [INFO ] Deduced a trap composed of 151 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:51:15] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:51:16] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:51:16] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 3 ms to minimize.
[2024-05-28 16:51:16] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:51:16] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:51:17] [INFO ] Deduced a trap composed of 117 places in 191 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:51:17] [INFO ] Deduced a trap composed of 146 places in 204 ms of which 3 ms to minimize.
[2024-05-28 16:51:18] [INFO ] Deduced a trap composed of 89 places in 179 ms of which 2 ms to minimize.
[2024-05-28 16:51:18] [INFO ] Deduced a trap composed of 149 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:51:18] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:51:19] [INFO ] Deduced a trap composed of 114 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:51:19] [INFO ] Deduced a trap composed of 122 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:51:19] [INFO ] Deduced a trap composed of 122 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:51:20] [INFO ] Deduced a trap composed of 147 places in 182 ms of which 2 ms to minimize.
[2024-05-28 16:51:20] [INFO ] Deduced a trap composed of 155 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:51:20] [INFO ] Deduced a trap composed of 150 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:51:20] [INFO ] Deduced a trap composed of 162 places in 180 ms of which 2 ms to minimize.
[2024-05-28 16:51:20] [INFO ] Deduced a trap composed of 165 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:51:21] [INFO ] Deduced a trap composed of 143 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:51:21] [INFO ] Deduced a trap composed of 115 places in 192 ms of which 2 ms to minimize.
[2024-05-28 16:51:21] [INFO ] Deduced a trap composed of 144 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:51:22] [INFO ] Deduced a trap composed of 157 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:51:22] [INFO ] Deduced a trap composed of 144 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:51:22] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:51:23] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 3 ms to minimize.
[2024-05-28 16:51:23] [INFO ] Deduced a trap composed of 130 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:51:26] [INFO ] Deduced a trap composed of 143 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:51:26] [INFO ] Deduced a trap composed of 139 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:51:26] [INFO ] Deduced a trap composed of 152 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:51:26] [INFO ] Deduced a trap composed of 144 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:51:27] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:51:27] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:51:27] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:51:28] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:51:28] [INFO ] Deduced a trap composed of 120 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:51:28] [INFO ] Deduced a trap composed of 147 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:51:29] [INFO ] Deduced a trap composed of 142 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:51:30] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:51:30] [INFO ] Deduced a trap composed of 110 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:51:30] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/874 variables, and 90 constraints, problems are : Problem set: 0 solved, 581 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 54/90 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 97 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 172 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:51:35] [INFO ] Deduced a trap composed of 129 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:51:35] [INFO ] Deduced a trap composed of 107 places in 184 ms of which 2 ms to minimize.
[2024-05-28 16:51:35] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:51:36] [INFO ] Deduced a trap composed of 110 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:51:36] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:51:36] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 140 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 130 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 141 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 147 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 142 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 148 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 150 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 147 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 145 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 157 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 150 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:51:39] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:51:43] [INFO ] Deduced a trap composed of 150 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:51:43] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:51:43] [INFO ] Deduced a trap composed of 145 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:51:43] [INFO ] Deduced a trap composed of 127 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 140 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 147 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 122 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:51:45] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:51:45] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:51:45] [INFO ] Deduced a trap composed of 150 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:51:46] [INFO ] Deduced a trap composed of 128 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:51:46] [INFO ] Deduced a trap composed of 125 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:51:47] [INFO ] Deduced a trap composed of 139 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:51:47] [INFO ] Deduced a trap composed of 129 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:51:48] [INFO ] Deduced a trap composed of 127 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:51:48] [INFO ] Deduced a trap composed of 124 places in 182 ms of which 2 ms to minimize.
[2024-05-28 16:51:48] [INFO ] Deduced a trap composed of 128 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:51:48] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:51:49] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/874 variables, and 130 constraints, problems are : Problem set: 0 solved, 581 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/581 constraints, Known Traps: 94/94 constraints]
After SMT, in 40673ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 40682ms
[2024-05-28 16:51:50] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:51:50] [INFO ] Invariant cache hit.
[2024-05-28 16:51:51] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-28 16:51:51] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:51:51] [INFO ] Invariant cache hit.
[2024-05-28 16:51:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:51:52] [INFO ] Implicit Places using invariants and state equation in 1852 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
[2024-05-28 16:51:53] [INFO ] Redundant transitions in 6 ms returned []
Running 581 sub problems to find dead transitions.
[2024-05-28 16:51:53] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:51:53] [INFO ] Invariant cache hit.
[2024-05-28 16:51:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:51:56] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:51:56] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:51:56] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:51:56] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:51:56] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:51:56] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:51:57] [INFO ] Deduced a trap composed of 153 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:51:57] [INFO ] Deduced a trap composed of 147 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:51:57] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:51:57] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:51:58] [INFO ] Deduced a trap composed of 139 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:51:58] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:51:58] [INFO ] Deduced a trap composed of 143 places in 186 ms of which 2 ms to minimize.
[2024-05-28 16:51:58] [INFO ] Deduced a trap composed of 151 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:51:58] [INFO ] Deduced a trap composed of 132 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:51:59] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:51:59] [INFO ] Deduced a trap composed of 146 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:51:59] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:51:59] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:52:00] [INFO ] Deduced a trap composed of 117 places in 183 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:52:00] [INFO ] Deduced a trap composed of 146 places in 186 ms of which 2 ms to minimize.
[2024-05-28 16:52:01] [INFO ] Deduced a trap composed of 89 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:52:01] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:52:01] [INFO ] Deduced a trap composed of 99 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:52:02] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:52:02] [INFO ] Deduced a trap composed of 122 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:52:02] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:52:03] [INFO ] Deduced a trap composed of 147 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:52:03] [INFO ] Deduced a trap composed of 155 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:52:03] [INFO ] Deduced a trap composed of 150 places in 127 ms of which 3 ms to minimize.
[2024-05-28 16:52:03] [INFO ] Deduced a trap composed of 162 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:52:03] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:52:04] [INFO ] Deduced a trap composed of 143 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:52:04] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:52:04] [INFO ] Deduced a trap composed of 144 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:52:04] [INFO ] Deduced a trap composed of 157 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:52:04] [INFO ] Deduced a trap composed of 144 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:52:05] [INFO ] Deduced a trap composed of 124 places in 104 ms of which 1 ms to minimize.
[2024-05-28 16:52:05] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:52:05] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:52:09] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:52:09] [INFO ] Deduced a trap composed of 139 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:52:09] [INFO ] Deduced a trap composed of 152 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:52:09] [INFO ] Deduced a trap composed of 144 places in 201 ms of which 3 ms to minimize.
[2024-05-28 16:52:10] [INFO ] Deduced a trap composed of 148 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:52:10] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:52:10] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:52:10] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:52:11] [INFO ] Deduced a trap composed of 120 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:52:11] [INFO ] Deduced a trap composed of 147 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:52:12] [INFO ] Deduced a trap composed of 142 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:52:13] [INFO ] Deduced a trap composed of 110 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:52:13] [INFO ] Deduced a trap composed of 110 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:52:13] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:52:14] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:52:14] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:52:14] [INFO ] Deduced a trap composed of 151 places in 174 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:52:15] [INFO ] Deduced a trap composed of 147 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:52:15] [INFO ] Deduced a trap composed of 167 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:52:16] [INFO ] Deduced a trap composed of 150 places in 180 ms of which 2 ms to minimize.
[2024-05-28 16:52:16] [INFO ] Deduced a trap composed of 148 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:52:16] [INFO ] Deduced a trap composed of 135 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:52:16] [INFO ] Deduced a trap composed of 126 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:52:17] [INFO ] Deduced a trap composed of 115 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:52:17] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:52:17] [INFO ] Deduced a trap composed of 126 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:52:17] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:52:17] [INFO ] Deduced a trap composed of 146 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:52:18] [INFO ] Deduced a trap composed of 130 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:52:18] [INFO ] Deduced a trap composed of 130 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:52:18] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:52:18] [INFO ] Deduced a trap composed of 127 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:52:19] [INFO ] Deduced a trap composed of 151 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:52:19] [INFO ] Deduced a trap composed of 158 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:52:20] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:52:20] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:52:20] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:52:21] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:52:21] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:52:21] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:52:22] [INFO ] Deduced a trap composed of 114 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:52:22] [INFO ] Deduced a trap composed of 150 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:52:23] [INFO ] Deduced a trap composed of 133 places in 156 ms of which 2 ms to minimize.
SMT process timed out in 30671ms, After SMT, problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 30680ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73558 ms. Remains : 303/303 places, 583/583 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 p2 p0), (X p2), (X (NOT (AND (NOT p2) p0))), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 170 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), true]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (20 resets) in 297 ms. (134 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (13 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
[2024-05-28 16:52:24] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:52:24] [INFO ] Invariant cache hit.
[2024-05-28 16:52:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 263/874 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 4/13 constraints, Generalized P Invariants (flows): 9/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0), (X p2), (X (NOT (AND (NOT p2) p0))), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (G (OR p0 p2)), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p2))), (F (NOT p2))]
Knowledge based reduction with 13 factoid took 250 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), true]
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), true]
Stuttering acceptance computed with spot in 94 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), true]
Product exploration explored 100000 steps with 326 reset in 327 ms.
Product exploration explored 100000 steps with 338 reset in 294 ms.
Built C files in :
/tmp/ltsmin3526486405810555289
[2024-05-28 16:52:25] [INFO ] Computing symmetric may disable matrix : 583 transitions.
[2024-05-28 16:52:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:52:25] [INFO ] Computing symmetric may enable matrix : 583 transitions.
[2024-05-28 16:52:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:52:25] [INFO ] Computing Do-Not-Accords matrix : 583 transitions.
[2024-05-28 16:52:25] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:52:25] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3526486405810555289
Running compilation step : cd /tmp/ltsmin3526486405810555289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1888 ms.
Running link step : cd /tmp/ltsmin3526486405810555289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin3526486405810555289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6812893026051523522.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 583/583 transitions.
Applied a total of 0 rules in 9 ms. Remains 303 /303 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Running 581 sub problems to find dead transitions.
[2024-05-28 16:52:40] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:52:40] [INFO ] Invariant cache hit.
[2024-05-28 16:52:40] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:52:44] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:52:44] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:52:44] [INFO ] Deduced a trap composed of 153 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:52:44] [INFO ] Deduced a trap composed of 147 places in 135 ms of which 3 ms to minimize.
[2024-05-28 16:52:44] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:52:44] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:52:45] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:52:45] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:52:45] [INFO ] Deduced a trap composed of 143 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:52:45] [INFO ] Deduced a trap composed of 151 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:52:46] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:52:46] [INFO ] Deduced a trap composed of 123 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:52:46] [INFO ] Deduced a trap composed of 146 places in 183 ms of which 2 ms to minimize.
[2024-05-28 16:52:46] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:52:46] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:52:47] [INFO ] Deduced a trap composed of 117 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:52:47] [INFO ] Deduced a trap composed of 146 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:52:48] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:52:48] [INFO ] Deduced a trap composed of 149 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:52:48] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:52:49] [INFO ] Deduced a trap composed of 114 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:52:49] [INFO ] Deduced a trap composed of 122 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:52:49] [INFO ] Deduced a trap composed of 122 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:52:50] [INFO ] Deduced a trap composed of 147 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:52:50] [INFO ] Deduced a trap composed of 155 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:52:50] [INFO ] Deduced a trap composed of 150 places in 113 ms of which 1 ms to minimize.
[2024-05-28 16:52:50] [INFO ] Deduced a trap composed of 162 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:52:50] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:52:51] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:52:51] [INFO ] Deduced a trap composed of 115 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:52:51] [INFO ] Deduced a trap composed of 144 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:52:51] [INFO ] Deduced a trap composed of 157 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:52:51] [INFO ] Deduced a trap composed of 144 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:52:52] [INFO ] Deduced a trap composed of 124 places in 124 ms of which 1 ms to minimize.
[2024-05-28 16:52:52] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:52:52] [INFO ] Deduced a trap composed of 130 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:52:56] [INFO ] Deduced a trap composed of 143 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:52:56] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:52:56] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:52:56] [INFO ] Deduced a trap composed of 144 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:52:57] [INFO ] Deduced a trap composed of 148 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:52:57] [INFO ] Deduced a trap composed of 135 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:52:57] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:52:57] [INFO ] Deduced a trap composed of 133 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:52:58] [INFO ] Deduced a trap composed of 120 places in 195 ms of which 2 ms to minimize.
[2024-05-28 16:52:58] [INFO ] Deduced a trap composed of 147 places in 180 ms of which 2 ms to minimize.
[2024-05-28 16:52:59] [INFO ] Deduced a trap composed of 142 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:53:00] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:53:00] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:53:00] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:53:01] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 2 ms to minimize.
SMT process timed out in 20583ms, After SMT, problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 20589ms
[2024-05-28 16:53:01] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:53:01] [INFO ] Invariant cache hit.
[2024-05-28 16:53:01] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-28 16:53:01] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:53:01] [INFO ] Invariant cache hit.
[2024-05-28 16:53:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:53:03] [INFO ] Implicit Places using invariants and state equation in 2125 ms returned []
Implicit Place search using SMT with State Equation took 2446 ms to find 0 implicit places.
[2024-05-28 16:53:03] [INFO ] Redundant transitions in 4 ms returned []
Running 581 sub problems to find dead transitions.
[2024-05-28 16:53:03] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 16:53:03] [INFO ] Invariant cache hit.
[2024-05-28 16:53:03] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:53:06] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:53:06] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-28 16:53:06] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:53:07] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:53:07] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:53:07] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2024-05-28 16:53:07] [INFO ] Deduced a trap composed of 153 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:53:07] [INFO ] Deduced a trap composed of 147 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:53:07] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 1 ms to minimize.
[2024-05-28 16:53:07] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:53:08] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:53:08] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:53:08] [INFO ] Deduced a trap composed of 143 places in 122 ms of which 1 ms to minimize.
[2024-05-28 16:53:08] [INFO ] Deduced a trap composed of 151 places in 121 ms of which 1 ms to minimize.
[2024-05-28 16:53:08] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:53:09] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:53:09] [INFO ] Deduced a trap composed of 146 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:53:09] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:53:09] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 1 ms to minimize.
[2024-05-28 16:53:09] [INFO ] Deduced a trap composed of 117 places in 168 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:53:10] [INFO ] Deduced a trap composed of 146 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:53:10] [INFO ] Deduced a trap composed of 89 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:53:10] [INFO ] Deduced a trap composed of 149 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:53:11] [INFO ] Deduced a trap composed of 99 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:53:11] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:53:12] [INFO ] Deduced a trap composed of 122 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:53:12] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:53:12] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:53:12] [INFO ] Deduced a trap composed of 155 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:53:12] [INFO ] Deduced a trap composed of 150 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:53:12] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:53:12] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:53:13] [INFO ] Deduced a trap composed of 143 places in 127 ms of which 1 ms to minimize.
[2024-05-28 16:53:13] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:53:13] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:53:13] [INFO ] Deduced a trap composed of 157 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:53:14] [INFO ] Deduced a trap composed of 144 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:53:14] [INFO ] Deduced a trap composed of 124 places in 118 ms of which 1 ms to minimize.
[2024-05-28 16:53:14] [INFO ] Deduced a trap composed of 158 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:53:14] [INFO ] Deduced a trap composed of 130 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:53:17] [INFO ] Deduced a trap composed of 143 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:53:17] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:53:17] [INFO ] Deduced a trap composed of 152 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:53:17] [INFO ] Deduced a trap composed of 144 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:53:18] [INFO ] Deduced a trap composed of 148 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:53:18] [INFO ] Deduced a trap composed of 135 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:53:18] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 1 ms to minimize.
[2024-05-28 16:53:18] [INFO ] Deduced a trap composed of 133 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:53:18] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:53:19] [INFO ] Deduced a trap composed of 147 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:53:19] [INFO ] Deduced a trap composed of 142 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:53:20] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:53:20] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 1 ms to minimize.
[2024-05-28 16:53:21] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:53:21] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:53:21] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:53:21] [INFO ] Deduced a trap composed of 151 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 147 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 167 places in 114 ms of which 1 ms to minimize.
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 150 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 148 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:53:23] [INFO ] Deduced a trap composed of 135 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:53:23] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:53:23] [INFO ] Deduced a trap composed of 115 places in 135 ms of which 1 ms to minimize.
[2024-05-28 16:53:23] [INFO ] Deduced a trap composed of 130 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:53:23] [INFO ] Deduced a trap composed of 126 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:53:23] [INFO ] Deduced a trap composed of 123 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:53:24] [INFO ] Deduced a trap composed of 146 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:53:24] [INFO ] Deduced a trap composed of 130 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:53:24] [INFO ] Deduced a trap composed of 130 places in 92 ms of which 1 ms to minimize.
[2024-05-28 16:53:24] [INFO ] Deduced a trap composed of 133 places in 103 ms of which 1 ms to minimize.
[2024-05-28 16:53:24] [INFO ] Deduced a trap composed of 127 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:53:25] [INFO ] Deduced a trap composed of 151 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:53:25] [INFO ] Deduced a trap composed of 158 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:53:25] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:53:26] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:53:26] [INFO ] Deduced a trap composed of 124 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:53:27] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 1 ms to minimize.
[2024-05-28 16:53:27] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:53:27] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:53:27] [INFO ] Deduced a trap composed of 114 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:53:28] [INFO ] Deduced a trap composed of 150 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:53:28] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 1 ms to minimize.
[2024-05-28 16:53:29] [INFO ] Deduced a trap composed of 137 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:53:29] [INFO ] Deduced a trap composed of 151 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:53:30] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:53:30] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:53:30] [INFO ] Deduced a trap composed of 132 places in 187 ms of which 4 ms to minimize.
[2024-05-28 16:53:31] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:53:31] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:53:31] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:53:31] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:53:32] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:53:33] [INFO ] Deduced a trap composed of 97 places in 164 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/874 variables, and 130 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 94/130 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:53:37] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:53:40] [INFO ] Deduced a trap composed of 150 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:53:40] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:53:42] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:53:42] [INFO ] Deduced a trap composed of 179 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:53:42] [INFO ] Deduced a trap composed of 189 places in 167 ms of which 1 ms to minimize.
[2024-05-28 16:53:42] [INFO ] Deduced a trap composed of 169 places in 134 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:53:50] [INFO ] Deduced a trap composed of 142 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:53:50] [INFO ] Deduced a trap composed of 145 places in 129 ms of which 3 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Deduced a trap composed of 148 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Deduced a trap composed of 132 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Deduced a trap composed of 143 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 1 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 132 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 150 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 150 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:53:55] [INFO ] Deduced a trap composed of 125 places in 99 ms of which 1 ms to minimize.
[2024-05-28 16:53:55] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:53:55] [INFO ] Deduced a trap composed of 125 places in 101 ms of which 1 ms to minimize.
[2024-05-28 16:53:55] [INFO ] Deduced a trap composed of 126 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:53:55] [INFO ] Deduced a trap composed of 130 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:53:55] [INFO ] Deduced a trap composed of 127 places in 110 ms of which 1 ms to minimize.
[2024-05-28 16:53:55] [INFO ] Deduced a trap composed of 145 places in 110 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-28 16:54:01] [INFO ] Deduced a trap composed of 153 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:54:01] [INFO ] Deduced a trap composed of 147 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:54:01] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:54:01] [INFO ] Deduced a trap composed of 151 places in 154 ms of which 1 ms to minimize.
[2024-05-28 16:54:02] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:54:02] [INFO ] Deduced a trap composed of 143 places in 110 ms of which 1 ms to minimize.
[2024-05-28 16:54:02] [INFO ] Deduced a trap composed of 147 places in 115 ms of which 1 ms to minimize.
[2024-05-28 16:54:02] [INFO ] Deduced a trap composed of 141 places in 115 ms of which 1 ms to minimize.
[2024-05-28 16:54:02] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 16 ms to minimize.
[2024-05-28 16:54:02] [INFO ] Deduced a trap composed of 141 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:54:03] [INFO ] Deduced a trap composed of 144 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:54:03] [INFO ] Deduced a trap composed of 156 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:54:03] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:54:03] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:54:03] [INFO ] Deduced a trap composed of 151 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:54:04] [INFO ] Deduced a trap composed of 147 places in 110 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/874 variables, and 173 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/581 constraints, Known Traps: 137/137 constraints]
After SMT, in 60600ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60605ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83660 ms. Remains : 303/303 places, 583/583 transitions.
Built C files in :
/tmp/ltsmin10619743752255104568
[2024-05-28 16:54:04] [INFO ] Computing symmetric may disable matrix : 583 transitions.
[2024-05-28 16:54:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:54:04] [INFO ] Computing symmetric may enable matrix : 583 transitions.
[2024-05-28 16:54:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:54:04] [INFO ] Computing Do-Not-Accords matrix : 583 transitions.
[2024-05-28 16:54:04] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:54:04] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10619743752255104568
Running compilation step : cd /tmp/ltsmin10619743752255104568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1543 ms.
Running link step : cd /tmp/ltsmin10619743752255104568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin10619743752255104568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3101815824851194800.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 16:54:19] [INFO ] Flatten gal took : 29 ms
[2024-05-28 16:54:19] [INFO ] Flatten gal took : 26 ms
[2024-05-28 16:54:19] [INFO ] Time to serialize gal into /tmp/LTL7771029115390504857.gal : 4 ms
[2024-05-28 16:54:19] [INFO ] Time to serialize properties into /tmp/LTL3287033113384188118.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7771029115390504857.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10482242310805975948.hoa' '-atoms' '/tmp/LTL3287033113384188118.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3287033113384188118.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10482242310805975948.hoa
Detected timeout of ITS tools.
[2024-05-28 16:54:34] [INFO ] Flatten gal took : 24 ms
[2024-05-28 16:54:34] [INFO ] Flatten gal took : 22 ms
[2024-05-28 16:54:34] [INFO ] Time to serialize gal into /tmp/LTL87491597465488957.gal : 4 ms
[2024-05-28 16:54:34] [INFO ] Time to serialize properties into /tmp/LTL11413688503161951405.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL87491597465488957.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11413688503161951405.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G((X("(nyo_2<1)"))U(("(((P_1617_4>=1)&&(cIdleTasks>=1))&&(cJobCnt>=10))")U("(Insert_Source_E_2<1)"))))))
Formula 0 simplified : XF(X!"(nyo_2<1)" R (!"(((P_1617_4>=1)&&(cIdleTasks>=1))&&(cJobCnt>=10))" R !"(Insert_Source_E_2<1)"))
Detected timeout of ITS tools.
[2024-05-28 16:54:49] [INFO ] Flatten gal took : 39 ms
[2024-05-28 16:54:49] [INFO ] Applying decomposition
[2024-05-28 16:54:49] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18299911483999942046.txt' '-o' '/tmp/graph18299911483999942046.bin' '-w' '/tmp/graph18299911483999942046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18299911483999942046.bin' '-l' '-1' '-v' '-w' '/tmp/graph18299911483999942046.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:54:49] [INFO ] Decomposing Gal with order
[2024-05-28 16:54:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:54:49] [INFO ] Removed a total of 555 redundant transitions.
[2024-05-28 16:54:49] [INFO ] Flatten gal took : 106 ms
[2024-05-28 16:54:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 212 labels/synchronizations in 26 ms.
[2024-05-28 16:54:49] [INFO ] Time to serialize gal into /tmp/LTL17093918962387782796.gal : 19 ms
[2024-05-28 16:54:49] [INFO ] Time to serialize properties into /tmp/LTL14090464135843509639.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17093918962387782796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14090464135843509639.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G((X("(i2.u23.nyo_2<1)"))U(("(((i0.i1.u24.P_1617_4>=1)&&(i3.u19.cIdleTasks>=1))&&(i4.u14.cJobCnt>=10))")U("(i0.i1.u18.Insert_Sour...171
Formula 0 simplified : XF(X!"(i2.u23.nyo_2<1)" R (!"(((i0.i1.u24.P_1617_4>=1)&&(i3.u19.cIdleTasks>=1))&&(i4.u14.cJobCnt>=10))" R !"(i0.i1.u18.Insert_Source...165
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-08 finished in 281692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((p0&&X(p1))))||G(p2))))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J04T06-LTLFireability-13
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 10 out of 457 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 457/457 places, 812/812 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 457 transition count 782
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 427 transition count 776
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 421 transition count 776
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 72 place count 421 transition count 722
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 180 place count 367 transition count 722
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 238 place count 338 transition count 693
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 242 place count 334 transition count 689
Iterating global reduction 3 with 4 rules applied. Total rules applied 246 place count 334 transition count 689
Applied a total of 246 rules in 39 ms. Remains 334 /457 variables (removed 123) and now considering 689/812 (removed 123) transitions.
Running 687 sub problems to find dead transitions.
[2024-05-28 16:55:05] [INFO ] Flow matrix only has 677 transitions (discarded 12 similar events)
// Phase 1: matrix 677 rows 334 cols
[2024-05-28 16:55:05] [INFO ] Computed 39 invariants in 13 ms
[2024-05-28 16:55:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-05-28 16:55:09] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-28 16:55:09] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 0 ms to minimize.
[2024-05-28 16:55:09] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:55:09] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:55:09] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:55:09] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:55:09] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-28 16:55:10] [INFO ] Deduced a trap composed of 120 places in 204 ms of which 2 ms to minimize.
[2024-05-28 16:55:10] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:55:11] [INFO ] Deduced a trap composed of 197 places in 180 ms of which 3 ms to minimize.
[2024-05-28 16:55:11] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 3 ms to minimize.
[2024-05-28 16:55:12] [INFO ] Deduced a trap composed of 129 places in 211 ms of which 3 ms to minimize.
[2024-05-28 16:55:13] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:55:13] [INFO ] Deduced a trap composed of 128 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:55:14] [INFO ] Deduced a trap composed of 177 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:55:15] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 687 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/334 variables, 3/55 constraints. Problems are: Problem set: 66 solved, 621 unsolved
[2024-05-28 16:55:24] [INFO ] Deduced a trap composed of 181 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:55:24] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:55:24] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:55:25] [INFO ] Deduced a trap composed of 147 places in 165 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 334/1011 variables, and 59 constraints, problems are : Problem set: 66 solved, 621 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/334 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 687/687 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 66 solved, 621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 14/14 constraints. Problems are: Problem set: 66 solved, 621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 22/36 constraints. Problems are: Problem set: 66 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 17/53 constraints. Problems are: Problem set: 66 solved, 621 unsolved
[2024-05-28 16:55:28] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 1/54 constraints. Problems are: Problem set: 66 solved, 621 unsolved
[2024-05-28 16:55:38] [INFO ] Deduced a trap composed of 142 places in 206 ms of which 2 ms to minimize.
[2024-05-28 16:55:38] [INFO ] Deduced a trap composed of 151 places in 159 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 2/56 constraints. Problems are: Problem set: 66 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/1011 variables, and 56 constraints, problems are : Problem set: 66 solved, 621 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/334 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/687 constraints, Known Traps: 20/23 constraints]
After SMT, in 40930ms problems are : Problem set: 66 solved, 621 unsolved
Search for dead transitions found 66 dead transitions in 40939ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-05-28 16:55:46] [INFO ] Flow matrix only has 611 transitions (discarded 12 similar events)
// Phase 1: matrix 611 rows 334 cols
[2024-05-28 16:55:46] [INFO ] Computed 39 invariants in 8 ms
[2024-05-28 16:55:46] [INFO ] Implicit Places using invariants in 314 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 330 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 333/457 places, 623/812 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 319 transition count 599
Applied a total of 12 rules in 22 ms. Remains 319 /333 variables (removed 14) and now considering 599/623 (removed 24) transitions.
[2024-05-28 16:55:46] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
// Phase 1: matrix 587 rows 319 cols
[2024-05-28 16:55:46] [INFO ] Computed 38 invariants in 6 ms
[2024-05-28 16:55:46] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-28 16:55:46] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:55:46] [INFO ] Invariant cache hit.
[2024-05-28 16:55:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:55:49] [INFO ] Implicit Places using invariants and state equation in 2518 ms returned []
Implicit Place search using SMT with State Equation took 2942 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 319/457 places, 599/812 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 44275 ms. Remains : 319/457 places, 599/812 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-13
Product exploration explored 100000 steps with 33175 reset in 238 ms.
Product exploration explored 100000 steps with 33321 reset in 265 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 157 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (19 resets) in 999 ms. (40 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 712 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (13 resets) in 734 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 497 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 631 ms. (63 steps per ms) remains 4/4 properties
[2024-05-28 16:55:51] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:55:51] [INFO ] Invariant cache hit.
[2024-05-28 16:55:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/95 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 5 (OVERLAPS) 209/304 variables, 18/26 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/309 variables, 5/31 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/31 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 317/906 variables, and 37 constraints, problems are : Problem set: 4 solved, 0 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/319 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p2))), (G (OR p0 p2 p1)), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2))), (F p2), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 27 factoid took 383 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Support contains 10 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 599/599 transitions.
Applied a total of 0 rules in 11 ms. Remains 319 /319 variables (removed 0) and now considering 599/599 (removed 0) transitions.
Running 597 sub problems to find dead transitions.
[2024-05-28 16:55:52] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:55:52] [INFO ] Invariant cache hit.
[2024-05-28 16:55:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:55:57] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:55:57] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:55:57] [INFO ] Deduced a trap composed of 124 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:55:57] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:55:57] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:55:57] [INFO ] Deduced a trap composed of 109 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:55:58] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:55:58] [INFO ] Deduced a trap composed of 110 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:55:58] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:55:58] [INFO ] Deduced a trap composed of 159 places in 115 ms of which 1 ms to minimize.
[2024-05-28 16:55:58] [INFO ] Deduced a trap composed of 119 places in 175 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:55:59] [INFO ] Deduced a trap composed of 110 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:55:59] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:55:59] [INFO ] Deduced a trap composed of 126 places in 96 ms of which 1 ms to minimize.
[2024-05-28 16:56:00] [INFO ] Deduced a trap composed of 156 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:56:00] [INFO ] Deduced a trap composed of 145 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:56:00] [INFO ] Deduced a trap composed of 149 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:56:00] [INFO ] Deduced a trap composed of 197 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:56:00] [INFO ] Deduced a trap composed of 183 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:56:01] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:56:01] [INFO ] Deduced a trap composed of 138 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:56:01] [INFO ] Deduced a trap composed of 121 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:56:01] [INFO ] Deduced a trap composed of 146 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:56:01] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:56:01] [INFO ] Deduced a trap composed of 158 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:56:02] [INFO ] Deduced a trap composed of 158 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:56:02] [INFO ] Deduced a trap composed of 120 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:56:02] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 1 ms to minimize.
[2024-05-28 16:56:02] [INFO ] Deduced a trap composed of 137 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:56:02] [INFO ] Deduced a trap composed of 166 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:56:02] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:56:08] [INFO ] Deduced a trap composed of 99 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:56:08] [INFO ] Deduced a trap composed of 140 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:56:08] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:56:09] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:56:09] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:56:09] [INFO ] Deduced a trap composed of 135 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:56:09] [INFO ] Deduced a trap composed of 133 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:56:09] [INFO ] Deduced a trap composed of 155 places in 104 ms of which 1 ms to minimize.
[2024-05-28 16:56:10] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:56:10] [INFO ] Deduced a trap composed of 139 places in 103 ms of which 1 ms to minimize.
[2024-05-28 16:56:10] [INFO ] Deduced a trap composed of 153 places in 110 ms of which 1 ms to minimize.
[2024-05-28 16:56:10] [INFO ] Deduced a trap composed of 145 places in 109 ms of which 1 ms to minimize.
[2024-05-28 16:56:10] [INFO ] Deduced a trap composed of 200 places in 114 ms of which 1 ms to minimize.
[2024-05-28 16:56:10] [INFO ] Deduced a trap composed of 203 places in 97 ms of which 1 ms to minimize.
[2024-05-28 16:56:10] [INFO ] Deduced a trap composed of 206 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:56:11] [INFO ] Deduced a trap composed of 134 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:56:11] [INFO ] Deduced a trap composed of 155 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:56:11] [INFO ] Deduced a trap composed of 155 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:56:11] [INFO ] Deduced a trap composed of 134 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:56:11] [INFO ] Deduced a trap composed of 157 places in 135 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:56:12] [INFO ] Deduced a trap composed of 148 places in 127 ms of which 3 ms to minimize.
[2024-05-28 16:56:12] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:56:13] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 3 ms to minimize.
SMT process timed out in 20666ms, After SMT, problems are : Problem set: 0 solved, 597 unsolved
Search for dead transitions found 0 dead transitions in 20673ms
[2024-05-28 16:56:13] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:56:13] [INFO ] Invariant cache hit.
[2024-05-28 16:56:13] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-28 16:56:13] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:56:13] [INFO ] Invariant cache hit.
[2024-05-28 16:56:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:56:15] [INFO ] Implicit Places using invariants and state equation in 2049 ms returned []
Implicit Place search using SMT with State Equation took 2268 ms to find 0 implicit places.
[2024-05-28 16:56:15] [INFO ] Redundant transitions in 9 ms returned []
Running 597 sub problems to find dead transitions.
[2024-05-28 16:56:15] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:56:15] [INFO ] Invariant cache hit.
[2024-05-28 16:56:15] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:56:18] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2024-05-28 16:56:18] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:56:19] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:56:19] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:56:19] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:56:19] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:56:19] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:56:19] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 1 ms to minimize.
[2024-05-28 16:56:19] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2024-05-28 16:56:19] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:56:20] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:56:20] [INFO ] Deduced a trap composed of 124 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:56:20] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:56:20] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:56:20] [INFO ] Deduced a trap composed of 109 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:56:20] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:56:20] [INFO ] Deduced a trap composed of 110 places in 104 ms of which 1 ms to minimize.
[2024-05-28 16:56:20] [INFO ] Deduced a trap composed of 133 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:56:21] [INFO ] Deduced a trap composed of 159 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:56:21] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:56:21] [INFO ] Deduced a trap composed of 110 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:56:21] [INFO ] Deduced a trap composed of 149 places in 114 ms of which 1 ms to minimize.
[2024-05-28 16:56:22] [INFO ] Deduced a trap composed of 126 places in 96 ms of which 1 ms to minimize.
[2024-05-28 16:56:22] [INFO ] Deduced a trap composed of 156 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:56:22] [INFO ] Deduced a trap composed of 145 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:56:22] [INFO ] Deduced a trap composed of 149 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:56:22] [INFO ] Deduced a trap composed of 197 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:56:23] [INFO ] Deduced a trap composed of 183 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:56:23] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:56:23] [INFO ] Deduced a trap composed of 138 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:56:23] [INFO ] Deduced a trap composed of 121 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:56:23] [INFO ] Deduced a trap composed of 146 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:56:24] [INFO ] Deduced a trap composed of 135 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:56:24] [INFO ] Deduced a trap composed of 158 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:56:24] [INFO ] Deduced a trap composed of 158 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:56:24] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 1 ms to minimize.
[2024-05-28 16:56:24] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 1 ms to minimize.
[2024-05-28 16:56:25] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:56:25] [INFO ] Deduced a trap composed of 166 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:56:25] [INFO ] Deduced a trap composed of 129 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:56:29] [INFO ] Deduced a trap composed of 99 places in 189 ms of which 2 ms to minimize.
[2024-05-28 16:56:29] [INFO ] Deduced a trap composed of 140 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:56:29] [INFO ] Deduced a trap composed of 134 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:56:30] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:56:30] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:56:30] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:56:31] [INFO ] Deduced a trap composed of 133 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:56:31] [INFO ] Deduced a trap composed of 155 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:56:31] [INFO ] Deduced a trap composed of 99 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:56:31] [INFO ] Deduced a trap composed of 139 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:56:32] [INFO ] Deduced a trap composed of 153 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:56:32] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:56:32] [INFO ] Deduced a trap composed of 200 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:56:32] [INFO ] Deduced a trap composed of 203 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:56:32] [INFO ] Deduced a trap composed of 206 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:56:32] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:56:33] [INFO ] Deduced a trap composed of 155 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:56:33] [INFO ] Deduced a trap composed of 155 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:56:33] [INFO ] Deduced a trap composed of 134 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:56:33] [INFO ] Deduced a trap composed of 157 places in 153 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:56:35] [INFO ] Deduced a trap composed of 148 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:56:35] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 1 ms to minimize.
[2024-05-28 16:56:35] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:56:35] [INFO ] Deduced a trap composed of 162 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:56:35] [INFO ] Deduced a trap composed of 175 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:56:35] [INFO ] Deduced a trap composed of 151 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:56:36] [INFO ] Deduced a trap composed of 165 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:56:36] [INFO ] Deduced a trap composed of 170 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:56:36] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:56:36] [INFO ] Deduced a trap composed of 199 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:56:36] [INFO ] Deduced a trap composed of 160 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:56:36] [INFO ] Deduced a trap composed of 159 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:56:37] [INFO ] Deduced a trap composed of 165 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:56:37] [INFO ] Deduced a trap composed of 162 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:56:37] [INFO ] Deduced a trap composed of 160 places in 136 ms of which 3 ms to minimize.
[2024-05-28 16:56:37] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:56:37] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:56:38] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:56:38] [INFO ] Deduced a trap composed of 174 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:56:38] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:56:39] [INFO ] Deduced a trap composed of 121 places in 123 ms of which 3 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 155 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 155 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 143 places in 106 ms of which 1 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 1 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:56:41] [INFO ] Deduced a trap composed of 141 places in 140 ms of which 1 ms to minimize.
[2024-05-28 16:56:41] [INFO ] Deduced a trap composed of 143 places in 160 ms of which 1 ms to minimize.
[2024-05-28 16:56:41] [INFO ] Deduced a trap composed of 137 places in 244 ms of which 6 ms to minimize.
[2024-05-28 16:56:42] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:56:42] [INFO ] Deduced a trap composed of 159 places in 190 ms of which 2 ms to minimize.
[2024-05-28 16:56:42] [INFO ] Deduced a trap composed of 165 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:56:42] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 5 ms to minimize.
[2024-05-28 16:56:43] [INFO ] Deduced a trap composed of 153 places in 188 ms of which 2 ms to minimize.
[2024-05-28 16:56:43] [INFO ] Deduced a trap composed of 150 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:56:43] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:56:43] [INFO ] Deduced a trap composed of 163 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:56:43] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:56:43] [INFO ] Deduced a trap composed of 163 places in 144 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/906 variables, and 136 constraints, problems are : Problem set: 0 solved, 597 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/319 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 597/597 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 597 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 100/136 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:56:49] [INFO ] Deduced a trap composed of 154 places in 107 ms of which 1 ms to minimize.
[2024-05-28 16:56:49] [INFO ] Deduced a trap composed of 155 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:56:49] [INFO ] Deduced a trap composed of 124 places in 120 ms of which 1 ms to minimize.
[2024-05-28 16:56:49] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:56:50] [INFO ] Deduced a trap composed of 143 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:56:50] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:56:50] [INFO ] Deduced a trap composed of 136 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:56:53] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:56:53] [INFO ] Deduced a trap composed of 156 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:56:53] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:56:53] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:56:54] [INFO ] Deduced a trap composed of 153 places in 110 ms of which 1 ms to minimize.
[2024-05-28 16:56:54] [INFO ] Deduced a trap composed of 155 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:56:54] [INFO ] Deduced a trap composed of 161 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 14/150 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:57:03] [INFO ] Deduced a trap composed of 163 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:57:04] [INFO ] Deduced a trap composed of 146 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:57:04] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:57:04] [INFO ] Deduced a trap composed of 135 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:57:04] [INFO ] Deduced a trap composed of 152 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:57:05] [INFO ] Deduced a trap composed of 121 places in 135 ms of which 1 ms to minimize.
[2024-05-28 16:57:05] [INFO ] Deduced a trap composed of 159 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:57:05] [INFO ] Deduced a trap composed of 145 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:57:05] [INFO ] Deduced a trap composed of 134 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:57:05] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:57:05] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 2 ms to minimize.
[2024-05-28 16:57:06] [INFO ] Deduced a trap composed of 146 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:57:06] [INFO ] Deduced a trap composed of 147 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:57:06] [INFO ] Deduced a trap composed of 152 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:57:08] [INFO ] Deduced a trap composed of 153 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:57:08] [INFO ] Deduced a trap composed of 122 places in 169 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 16/166 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/906 variables, and 166 constraints, problems are : Problem set: 0 solved, 597 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/319 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/597 constraints, Known Traps: 130/130 constraints]
After SMT, in 60602ms problems are : Problem set: 0 solved, 597 unsolved
Search for dead transitions found 0 dead transitions in 60610ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83579 ms. Remains : 319/319 places, 599/599 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 p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X p0), (X (AND p0 (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p2 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 188 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
RANDOM walk for 5547 steps (2 resets) in 168 ms. (32 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X p0), (X (AND p0 (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p2 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 (NOT p2) p0))), (F p2), (F (NOT (AND (NOT p2) p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 612 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Product exploration explored 100000 steps with 33397 reset in 260 ms.
Product exploration explored 100000 steps with 33366 reset in 252 ms.
Built C files in :
/tmp/ltsmin8640849200331723971
[2024-05-28 16:57:18] [INFO ] Computing symmetric may disable matrix : 599 transitions.
[2024-05-28 16:57:18] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:57:18] [INFO ] Computing symmetric may enable matrix : 599 transitions.
[2024-05-28 16:57:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:57:18] [INFO ] Computing Do-Not-Accords matrix : 599 transitions.
[2024-05-28 16:57:18] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:57:18] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8640849200331723971
Running compilation step : cd /tmp/ltsmin8640849200331723971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1919 ms.
Running link step : cd /tmp/ltsmin8640849200331723971;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin8640849200331723971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10276732817042061535.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 599/599 transitions.
Applied a total of 0 rules in 15 ms. Remains 319 /319 variables (removed 0) and now considering 599/599 (removed 0) transitions.
Running 597 sub problems to find dead transitions.
[2024-05-28 16:57:33] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:57:33] [INFO ] Invariant cache hit.
[2024-05-28 16:57:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:57:37] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:57:37] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:57:37] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2024-05-28 16:57:37] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:57:37] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:57:37] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:57:37] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:57:37] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:57:37] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:57:37] [INFO ] Deduced a trap composed of 134 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:57:38] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 1 ms to minimize.
[2024-05-28 16:57:38] [INFO ] Deduced a trap composed of 124 places in 114 ms of which 1 ms to minimize.
[2024-05-28 16:57:38] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 1 ms to minimize.
[2024-05-28 16:57:38] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 1 ms to minimize.
[2024-05-28 16:57:38] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 1 ms to minimize.
[2024-05-28 16:57:38] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 1 ms to minimize.
[2024-05-28 16:57:38] [INFO ] Deduced a trap composed of 110 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:57:38] [INFO ] Deduced a trap composed of 133 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:57:39] [INFO ] Deduced a trap composed of 159 places in 99 ms of which 1 ms to minimize.
[2024-05-28 16:57:39] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:57:39] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:57:39] [INFO ] Deduced a trap composed of 149 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:57:40] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:57:40] [INFO ] Deduced a trap composed of 156 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:57:40] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 1 ms to minimize.
[2024-05-28 16:57:40] [INFO ] Deduced a trap composed of 149 places in 194 ms of which 2 ms to minimize.
[2024-05-28 16:57:41] [INFO ] Deduced a trap composed of 197 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:57:41] [INFO ] Deduced a trap composed of 183 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:57:41] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:57:42] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:57:42] [INFO ] Deduced a trap composed of 121 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:57:42] [INFO ] Deduced a trap composed of 146 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:57:42] [INFO ] Deduced a trap composed of 135 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:57:43] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:57:43] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:57:43] [INFO ] Deduced a trap composed of 120 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:57:43] [INFO ] Deduced a trap composed of 99 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:57:44] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:57:44] [INFO ] Deduced a trap composed of 166 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:57:44] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:57:49] [INFO ] Deduced a trap composed of 99 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:57:49] [INFO ] Deduced a trap composed of 140 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:57:49] [INFO ] Deduced a trap composed of 134 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:57:49] [INFO ] Deduced a trap composed of 131 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:57:50] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 1 ms to minimize.
[2024-05-28 16:57:50] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:57:50] [INFO ] Deduced a trap composed of 133 places in 131 ms of which 1 ms to minimize.
[2024-05-28 16:57:51] [INFO ] Deduced a trap composed of 155 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:57:51] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:57:51] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:57:51] [INFO ] Deduced a trap composed of 153 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:57:52] [INFO ] Deduced a trap composed of 145 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:57:52] [INFO ] Deduced a trap composed of 200 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:57:52] [INFO ] Deduced a trap composed of 203 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:57:52] [INFO ] Deduced a trap composed of 206 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:57:52] [INFO ] Deduced a trap composed of 134 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:57:53] [INFO ] Deduced a trap composed of 155 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:57:53] [INFO ] Deduced a trap composed of 155 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:57:53] [INFO ] Deduced a trap composed of 134 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:57:54] [INFO ] Deduced a trap composed of 157 places in 158 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/906 variables, and 96 constraints, problems are : Problem set: 0 solved, 597 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/319 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 597/597 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 597 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:57:57] [INFO ] Deduced a trap composed of 123 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:57:57] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:57:58] [INFO ] Deduced a trap composed of 136 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:57:58] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:57:59] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:58:00] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:58:06] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:58:06] [INFO ] Deduced a trap composed of 150 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:58:06] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:58:06] [INFO ] Deduced a trap composed of 148 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:58:07] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:58:07] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:58:07] [INFO ] Deduced a trap composed of 161 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:58:07] [INFO ] Deduced a trap composed of 161 places in 112 ms of which 1 ms to minimize.
[2024-05-28 16:58:07] [INFO ] Deduced a trap composed of 150 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:58:07] [INFO ] Deduced a trap composed of 150 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:58:07] [INFO ] Deduced a trap composed of 158 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:58:08] [INFO ] Deduced a trap composed of 171 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:58:08] [INFO ] Deduced a trap composed of 170 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:58:08] [INFO ] Deduced a trap composed of 153 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:58:08] [INFO ] Deduced a trap composed of 153 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:58:08] [INFO ] Deduced a trap composed of 159 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:58:08] [INFO ] Deduced a trap composed of 155 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:58:11] [INFO ] Deduced a trap composed of 150 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:58:12] [INFO ] Deduced a trap composed of 130 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:58:12] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/906 variables, and 122 constraints, problems are : Problem set: 0 solved, 597 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/319 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/597 constraints, Known Traps: 86/86 constraints]
After SMT, in 40548ms problems are : Problem set: 0 solved, 597 unsolved
Search for dead transitions found 0 dead transitions in 40558ms
[2024-05-28 16:58:14] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:58:14] [INFO ] Invariant cache hit.
[2024-05-28 16:58:14] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-28 16:58:14] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:58:14] [INFO ] Invariant cache hit.
[2024-05-28 16:58:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:58:16] [INFO ] Implicit Places using invariants and state equation in 2272 ms returned []
Implicit Place search using SMT with State Equation took 2602 ms to find 0 implicit places.
[2024-05-28 16:58:16] [INFO ] Redundant transitions in 12 ms returned []
Running 597 sub problems to find dead transitions.
[2024-05-28 16:58:17] [INFO ] Flow matrix only has 587 transitions (discarded 12 similar events)
[2024-05-28 16:58:17] [INFO ] Invariant cache hit.
[2024-05-28 16:58:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:58:20] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:58:20] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:58:20] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:58:21] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:58:21] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:58:21] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:58:21] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:58:21] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:58:21] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:58:21] [INFO ] Deduced a trap composed of 134 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:58:21] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:58:22] [INFO ] Deduced a trap composed of 124 places in 170 ms of which 4 ms to minimize.
[2024-05-28 16:58:22] [INFO ] Deduced a trap composed of 112 places in 124 ms of which 1 ms to minimize.
[2024-05-28 16:58:22] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:58:22] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:58:22] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:58:22] [INFO ] Deduced a trap composed of 110 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:58:23] [INFO ] Deduced a trap composed of 133 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:58:23] [INFO ] Deduced a trap composed of 159 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:58:23] [INFO ] Deduced a trap composed of 119 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:58:24] [INFO ] Deduced a trap composed of 110 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:58:24] [INFO ] Deduced a trap composed of 149 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:58:25] [INFO ] Deduced a trap composed of 126 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:58:25] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:58:25] [INFO ] Deduced a trap composed of 145 places in 129 ms of which 3 ms to minimize.
[2024-05-28 16:58:25] [INFO ] Deduced a trap composed of 149 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:58:25] [INFO ] Deduced a trap composed of 197 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:58:26] [INFO ] Deduced a trap composed of 183 places in 181 ms of which 2 ms to minimize.
[2024-05-28 16:58:26] [INFO ] Deduced a trap composed of 131 places in 183 ms of which 2 ms to minimize.
[2024-05-28 16:58:26] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:58:26] [INFO ] Deduced a trap composed of 121 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:58:27] [INFO ] Deduced a trap composed of 146 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:58:27] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:58:27] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:58:27] [INFO ] Deduced a trap composed of 158 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:58:28] [INFO ] Deduced a trap composed of 120 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:58:28] [INFO ] Deduced a trap composed of 99 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:58:28] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:58:28] [INFO ] Deduced a trap composed of 166 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 129 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:58:33] [INFO ] Deduced a trap composed of 99 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:58:33] [INFO ] Deduced a trap composed of 140 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:58:33] [INFO ] Deduced a trap composed of 134 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:58:33] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:58:33] [INFO ] Deduced a trap composed of 132 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:58:34] [INFO ] Deduced a trap composed of 135 places in 182 ms of which 2 ms to minimize.
[2024-05-28 16:58:34] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:58:34] [INFO ] Deduced a trap composed of 155 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:58:35] [INFO ] Deduced a trap composed of 99 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:58:35] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:58:35] [INFO ] Deduced a trap composed of 153 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:58:35] [INFO ] Deduced a trap composed of 145 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:58:36] [INFO ] Deduced a trap composed of 200 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:58:36] [INFO ] Deduced a trap composed of 203 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:58:36] [INFO ] Deduced a trap composed of 206 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:58:36] [INFO ] Deduced a trap composed of 134 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:58:37] [INFO ] Deduced a trap composed of 155 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:58:37] [INFO ] Deduced a trap composed of 155 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:58:37] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:58:37] [INFO ] Deduced a trap composed of 157 places in 161 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:58:39] [INFO ] Deduced a trap composed of 148 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:58:39] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 1 ms to minimize.
[2024-05-28 16:58:39] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:58:39] [INFO ] Deduced a trap composed of 162 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:58:39] [INFO ] Deduced a trap composed of 175 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:58:40] [INFO ] Deduced a trap composed of 151 places in 182 ms of which 2 ms to minimize.
[2024-05-28 16:58:40] [INFO ] Deduced a trap composed of 165 places in 183 ms of which 2 ms to minimize.
[2024-05-28 16:58:40] [INFO ] Deduced a trap composed of 170 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:58:41] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:58:41] [INFO ] Deduced a trap composed of 199 places in 179 ms of which 2 ms to minimize.
[2024-05-28 16:58:41] [INFO ] Deduced a trap composed of 160 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:58:41] [INFO ] Deduced a trap composed of 159 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:58:41] [INFO ] Deduced a trap composed of 165 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:58:42] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:58:42] [INFO ] Deduced a trap composed of 160 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:58:42] [INFO ] Deduced a trap composed of 142 places in 183 ms of which 2 ms to minimize.
[2024-05-28 16:58:42] [INFO ] Deduced a trap composed of 144 places in 193 ms of which 2 ms to minimize.
[2024-05-28 16:58:43] [INFO ] Deduced a trap composed of 89 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:58:43] [INFO ] Deduced a trap composed of 174 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:58:43] [INFO ] Deduced a trap composed of 166 places in 137 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2024-05-28 16:58:44] [INFO ] Deduced a trap composed of 121 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:58:45] [INFO ] Deduced a trap composed of 155 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:58:45] [INFO ] Deduced a trap composed of 155 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:58:45] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:58:45] [INFO ] Deduced a trap composed of 143 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:58:45] [INFO ] Deduced a trap composed of 120 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:58:45] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:58:46] [INFO ] Deduced a trap composed of 141 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:58:46] [INFO ] Deduced a trap composed of 143 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:58:47] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:58:47] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 2 ms to minimize.
[2024-05-28 16:58:47] [INFO ] Deduced a trap composed of 159 places in 174 ms of which 3 ms to minimize.
SMT process timed out in 30609ms, After SMT, problems are : Problem set: 0 solved, 597 unsolved
Search for dead transitions found 0 dead transitions in 30619ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73822 ms. Remains : 319/319 places, 599/599 transitions.
Built C files in :
/tmp/ltsmin13935819575025993555
[2024-05-28 16:58:47] [INFO ] Computing symmetric may disable matrix : 599 transitions.
[2024-05-28 16:58:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:58:47] [INFO ] Computing symmetric may enable matrix : 599 transitions.
[2024-05-28 16:58:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:58:47] [INFO ] Computing Do-Not-Accords matrix : 599 transitions.
[2024-05-28 16:58:47] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:58:47] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13935819575025993555
Running compilation step : cd /tmp/ltsmin13935819575025993555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1940 ms.
Running link step : cd /tmp/ltsmin13935819575025993555;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin13935819575025993555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3936259179641534841.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 16:59:02] [INFO ] Flatten gal took : 43 ms
[2024-05-28 16:59:02] [INFO ] Flatten gal took : 20 ms
[2024-05-28 16:59:02] [INFO ] Time to serialize gal into /tmp/LTL4839610763245059195.gal : 3 ms
[2024-05-28 16:59:02] [INFO ] Time to serialize properties into /tmp/LTL4802744850062418859.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4839610763245059195.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6394452731870747539.hoa' '-atoms' '/tmp/LTL4802744850062418859.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4802744850062418859.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6394452731870747539.hoa
Detected timeout of ITS tools.
[2024-05-28 16:59:17] [INFO ] Flatten gal took : 31 ms
[2024-05-28 16:59:17] [INFO ] Flatten gal took : 26 ms
[2024-05-28 16:59:17] [INFO ] Time to serialize gal into /tmp/LTL1315243672030570423.gal : 6 ms
[2024-05-28 16:59:17] [INFO ] Time to serialize properties into /tmp/LTL17947493746337131844.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1315243672030570423.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17947493746337131844.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("((((cBlockedTasks<10)||(ORB_Lock<1))||((AbourtToModifySrc_1<1)||(Abort_Check_Sources_E_5<1)))||(PollingAbort<1))")&&(X("((...262
Formula 0 simplified : G(FG(!"((((cBlockedTasks<10)||(ORB_Lock<1))||((AbourtToModifySrc_1<1)||(Abort_Check_Sources_E_5<1)))||(PollingAbort<1))" | X!"((TryA...250
Detected timeout of ITS tools.
[2024-05-28 16:59:33] [INFO ] Flatten gal took : 17 ms
[2024-05-28 16:59:33] [INFO ] Applying decomposition
[2024-05-28 16:59:33] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17838274494036445907.txt' '-o' '/tmp/graph17838274494036445907.bin' '-w' '/tmp/graph17838274494036445907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17838274494036445907.bin' '-l' '-1' '-v' '-w' '/tmp/graph17838274494036445907.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:59:33] [INFO ] Decomposing Gal with order
[2024-05-28 16:59:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:59:33] [INFO ] Removed a total of 504 redundant transitions.
[2024-05-28 16:59:33] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:59:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 339 labels/synchronizations in 8 ms.
[2024-05-28 16:59:33] [INFO ] Time to serialize gal into /tmp/LTL13152826018367117722.gal : 5 ms
[2024-05-28 16:59:33] [INFO ] Time to serialize properties into /tmp/LTL12438535099659363209.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13152826018367117722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12438535099659363209.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("((((i0.u0.cBlockedTasks<10)||(i0.u0.ORB_Lock<1))||((i0.u0.AbourtToModifySrc_1<1)||(i0.u0.Abort_Check_Sources_E_5<1)))||(i0...324
Formula 0 simplified : G(FG(!"((((i0.u0.cBlockedTasks<10)||(i0.u0.ORB_Lock<1))||((i0.u0.AbourtToModifySrc_1<1)||(i0.u0.Abort_Check_Sources_E_5<1)))||(i0.u0...312
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-13 finished in 283243 ms.
[2024-05-28 16:59:48] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16153437914610315940
[2024-05-28 16:59:48] [INFO ] Computing symmetric may disable matrix : 812 transitions.
[2024-05-28 16:59:48] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:59:48] [INFO ] Applying decomposition
[2024-05-28 16:59:48] [INFO ] Computing symmetric may enable matrix : 812 transitions.
[2024-05-28 16:59:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:59:48] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17060428952742170982.txt' '-o' '/tmp/graph17060428952742170982.bin' '-w' '/tmp/graph17060428952742170982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17060428952742170982.bin' '-l' '-1' '-v' '-w' '/tmp/graph17060428952742170982.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:59:48] [INFO ] Decomposing Gal with order
[2024-05-28 16:59:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:59:48] [INFO ] Computing Do-Not-Accords matrix : 812 transitions.
[2024-05-28 16:59:48] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:59:48] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16153437914610315940
Running compilation step : cd /tmp/ltsmin16153437914610315940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 16:59:48] [INFO ] Removed a total of 609 redundant transitions.
[2024-05-28 16:59:48] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:59:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 184 labels/synchronizations in 9 ms.
[2024-05-28 16:59:48] [INFO ] Time to serialize gal into /tmp/LTLFireability1764896734969527599.gal : 7 ms
[2024-05-28 16:59:48] [INFO ] Time to serialize properties into /tmp/LTLFireability16292555742290238443.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1764896734969527599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16292555742290238443.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(G((X("(u70.nyo_2<1)"))U(("(((i7.u37.P_1617_4>=1)&&(i4.u56.cIdleTasks>=1))&&(i11.u65.cJobCnt>=10))")U("(i2.i2.u25.Insert_Source_E_...166
Formula 0 simplified : XF(X!"(u70.nyo_2<1)" R (!"(((i7.u37.P_1617_4>=1)&&(i4.u56.cIdleTasks>=1))&&(i11.u65.cJobCnt>=10))" R !"(i2.i2.u25.Insert_Source_E_2<...160
Compilation finished in 2648 ms.
Running link step : cd /tmp/ltsmin16153437914610315940;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin16153437914610315940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true)) U ((LTLAPp2==true) U (LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin16153437914610315940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true)) U ((LTLAPp2==true) U (LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16153437914610315940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(((LTLAPp4==true)&&X((LTLAPp5==true)))))||[]((LTLAPp6==true))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-S02J04T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBLF-PT-S02J04T06, 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 r290-tajo-171654446600220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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