fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654446700244
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBLF-PT-S02J06T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4423.951 2066228.00 4290861.00 356.50 FFTFFFTFFTFFFFFF normal

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-171654446700244.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-S02J06T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446700244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K 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.9K 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 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 601K 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-S02J06T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716914819463

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-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 16:47:00] [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:47:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:47:00] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-28 16:47:00] [INFO ] Transformed 536 places.
[2024-05-28 16:47:00] [INFO ] Transformed 1064 transitions.
[2024-05-28 16:47:00] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2024-05-28 16:47:00] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 267 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Applied a total of 2 rules in 48 ms. Remains 534 /536 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 16:47:01] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 534 cols
[2024-05-28 16:47:01] [INFO ] Computed 48 invariants in 81 ms
[2024-05-28 16:47:01] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:47:10] [INFO ] Deduced a trap composed of 74 places in 241 ms of which 24 ms to minimize.
[2024-05-28 16:47:10] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 7 ms to minimize.
[2024-05-28 16:47:10] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 1 ms to minimize.
[2024-05-28 16:47:11] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 3 ms to minimize.
[2024-05-28 16:47:11] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:47:11] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 2 ms to minimize.
[2024-05-28 16:47:11] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 11 ms to minimize.
[2024-05-28 16:47:11] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:47:12] [INFO ] Deduced a trap composed of 258 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:47:12] [INFO ] Deduced a trap composed of 98 places in 219 ms of which 4 ms to minimize.
[2024-05-28 16:47:12] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 266 places in 194 ms of which 3 ms to minimize.
[2024-05-28 16:47:15] [INFO ] Deduced a trap composed of 247 places in 190 ms of which 2 ms to minimize.
[2024-05-28 16:47:16] [INFO ] Deduced a trap composed of 267 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:47:17] [INFO ] Deduced a trap composed of 270 places in 255 ms of which 4 ms to minimize.
[2024-05-28 16:47:17] [INFO ] Deduced a trap composed of 236 places in 232 ms of which 3 ms to minimize.
[2024-05-28 16:47:18] [INFO ] Deduced a trap composed of 289 places in 208 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1490 variables, and 63 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:47:37] [INFO ] Deduced a trap composed of 282 places in 266 ms of which 4 ms to minimize.
[2024-05-28 16:47:38] [INFO ] Deduced a trap composed of 357 places in 278 ms of which 4 ms to minimize.
[2024-05-28 16:47:39] [INFO ] Deduced a trap composed of 273 places in 225 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1490 variables, and 66 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 20/20 constraints]
After SMT, in 41378ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41420ms
[2024-05-28 16:47:42] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 16:47:42] [INFO ] Invariant cache hit.
[2024-05-28 16:47:42] [INFO ] Implicit Places using invariants in 311 ms returned [96, 111, 240, 253, 495]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 325 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/536 places, 968/968 transitions.
Applied a total of 0 rules in 14 ms. Remains 529 /529 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41861 ms. Remains : 529/536 places, 968/968 transitions.
Support contains 267 out of 529 places after structural reductions.
[2024-05-28 16:47:43] [INFO ] Flatten gal took : 146 ms
[2024-05-28 16:47:43] [INFO ] Flatten gal took : 85 ms
[2024-05-28 16:47:43] [INFO ] Input system was already deterministic with 968 transitions.
Support contains 266 out of 529 places (down from 267) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 39 to 36
RANDOM walk for 40000 steps (17 resets) in 1822 ms. (21 steps per ms) remains 9/36 properties
BEST_FIRST walk for 40003 steps (20 resets) in 387 ms. (103 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (38 resets) in 295 ms. (135 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (12 resets) in 262 ms. (152 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 349 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (9 resets) in 236 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 245 ms. (162 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (14 resets) in 266 ms. (149 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (10 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
[2024-05-28 16:47:45] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 529 cols
[2024-05-28 16:47:45] [INFO ] Computed 43 invariants in 19 ms
[2024-05-28 16:47:45] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem AtomicPropp32 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 2 (OVERLAPS) 71/151 variables, 5/7 constraints. Problems are: Problem set: 2 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 5 (OVERLAPS) 361/512 variables, 19/27 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/27 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/525 variables, 12/39 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/39 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/529 variables, 4/43 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/43 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 956/1485 variables, 529/572 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1485 variables, 72/644 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1485 variables, 0/644 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1485 variables, 0/644 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1485/1485 variables, and 644 constraints, problems are : Problem set: 6 solved, 3 unsolved in 2952 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 529/529 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/56 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 341/397 variables, 5/7 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/460 variables, 15/22 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 66/526 variables, 19/41 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-28 16:47:48] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:47:48] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:47:48] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2024-05-28 16:47:48] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:47:48] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 5/46 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/527 variables, 1/47 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 0/47 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 956/1483 variables, 527/574 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 72/646 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1483 variables, 3/649 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1483 variables, 0/649 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1485 variables, 2/651 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1485 variables, 1/652 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 15 places in 306 ms of which 4 ms to minimize.
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 294 places in 227 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1485 variables, 2/654 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1485 variables, 0/654 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1485 variables, 0/654 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1485/1485 variables, and 654 constraints, problems are : Problem set: 6 solved, 3 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 529/529 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/9 constraints, Known Traps: 7/7 constraints]
After SMT, in 8024ms problems are : Problem set: 6 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 968/968 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 529 transition count 926
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 487 transition count 920
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 481 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 96 place count 481 transition count 860
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 216 place count 421 transition count 860
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 219 place count 418 transition count 857
Iterating global reduction 3 with 3 rules applied. Total rules applied 222 place count 418 transition count 857
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 318 place count 370 transition count 809
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 330 place count 370 transition count 797
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 342 place count 358 transition count 797
Applied a total of 342 rules in 208 ms. Remains 358 /529 variables (removed 171) and now considering 797/968 (removed 171) transitions.
Running 795 sub problems to find dead transitions.
[2024-05-28 16:47:53] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
// Phase 1: matrix 785 rows 358 cols
[2024-05-28 16:47:53] [INFO ] Computed 43 invariants in 19 ms
[2024-05-28 16:47:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 0 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 46 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:48:00] [INFO ] Deduced a trap composed of 114 places in 148 ms of which 5 ms to minimize.
[2024-05-28 16:48:00] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:48:00] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:48:00] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:48:00] [INFO ] Deduced a trap composed of 153 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:48:03] [INFO ] Deduced a trap composed of 167 places in 204 ms of which 3 ms to minimize.
[2024-05-28 16:48:04] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:48:04] [INFO ] Deduced a trap composed of 154 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:48:04] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:48:05] [INFO ] Deduced a trap composed of 134 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:48:05] [INFO ] Deduced a trap composed of 169 places in 188 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 795 unsolved
SMT process timed out in 21342ms, After SMT, problems are : Problem set: 0 solved, 795 unsolved
Search for dead transitions found 0 dead transitions in 21354ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21565 ms. Remains : 358/529 places, 797/968 transitions.
RANDOM walk for 40000 steps (31 resets) in 663 ms. (60 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (11 resets) in 451 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (13 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (12 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 182014 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 3
Probabilistic random walk after 182014 steps, saw 106060 distinct states, run finished after 3005 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-28 16:48:18] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 16:48:18] [INFO ] Invariant cache hit.
[2024-05-28 16:48:18] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 226/264 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 53/317 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 39/356 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 45 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 785/1141 variables, 356/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1141 variables, 72/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1141 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/1143 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1143 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1143 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:48:21] [INFO ] Deduced a trap composed of 143 places in 233 ms of which 3 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/1143 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1143 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1143 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1143/1143 variables, and 478 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3896 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 226/264 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 53/317 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 39/356 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:48:22] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 785/1141 variables, 356/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1141 variables, 72/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1141 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1141 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/1143 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1143 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:48:31] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 2 ms to minimize.
[2024-05-28 16:48:31] [INFO ] Deduced a trap composed of 129 places in 211 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1143 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1143 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1143 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1143/1143 variables, and 484 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9995 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 13900ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1316 ms.
Support contains 19 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 797/797 transitions.
Applied a total of 0 rules in 17 ms. Remains 358 /358 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 358/358 places, 797/797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 797/797 transitions.
Applied a total of 0 rules in 16 ms. Remains 358 /358 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2024-05-28 16:48:33] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 16:48:33] [INFO ] Invariant cache hit.
[2024-05-28 16:48:33] [INFO ] Implicit Places using invariants in 408 ms returned [205]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 412 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/358 places, 797/797 transitions.
Applied a total of 0 rules in 42 ms. Remains 357 /357 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 472 ms. Remains : 357/358 places, 797/797 transitions.
RANDOM walk for 40000 steps (23 resets) in 470 ms. (84 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (13 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (15 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 155966 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 3
Probabilistic random walk after 155966 steps, saw 92014 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-28 16:48:37] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
// Phase 1: matrix 785 rows 357 cols
[2024-05-28 16:48:37] [INFO ] Computed 42 invariants in 25 ms
[2024-05-28 16:48:37] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 222/260 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/280 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 74/354 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:48:37] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:48:37] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:48:37] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:48:37] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 3 ms to minimize.
[2024-05-28 16:48:37] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/355 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 785/1140 variables, 355/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1140 variables, 72/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1140 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/1142 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1142 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1142 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1142 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1142/1142 variables, and 476 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2635 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 357/357 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 222/260 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/280 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 74/354 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:48:40] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/355 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 785/1140 variables, 355/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1140 variables, 72/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1140 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:48:45] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 2 ms to minimize.
[2024-05-28 16:48:46] [INFO ] Deduced a trap composed of 131 places in 193 ms of which 2 ms to minimize.
[2024-05-28 16:48:46] [INFO ] Deduced a trap composed of 143 places in 206 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1140 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1140 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1142 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1142 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1142 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1142 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 483 constraints, problems are : Problem set: 0 solved, 3 unsolved in 13933 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 357/357 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 16617ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 11049 ms.
Support contains 19 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 797/797 transitions.
Applied a total of 0 rules in 14 ms. Remains 357 /357 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 357/357 places, 797/797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 797/797 transitions.
Applied a total of 0 rules in 14 ms. Remains 357 /357 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2024-05-28 16:49:05] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 16:49:05] [INFO ] Invariant cache hit.
[2024-05-28 16:49:05] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-28 16:49:05] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 16:49:05] [INFO ] Invariant cache hit.
[2024-05-28 16:49:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:49:08] [INFO ] Implicit Places using invariants and state equation in 2664 ms returned []
Implicit Place search using SMT with State Equation took 3021 ms to find 0 implicit places.
[2024-05-28 16:49:08] [INFO ] Redundant transitions in 60 ms returned []
Running 795 sub problems to find dead transitions.
[2024-05-28 16:49:08] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 16:49:08] [INFO ] Invariant cache hit.
[2024-05-28 16:49:08] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 16:49:13] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:49:13] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:49:13] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:49:13] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:49:13] [INFO ] Deduced a trap composed of 45 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:49:14] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:49:14] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:49:14] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:49:14] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:49:15] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 3 ms to minimize.
[2024-05-28 16:49:17] [INFO ] Deduced a trap composed of 122 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:49:17] [INFO ] Deduced a trap composed of 220 places in 204 ms of which 2 ms to minimize.
[2024-05-28 16:49:18] [INFO ] Deduced a trap composed of 218 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:49:18] [INFO ] Deduced a trap composed of 114 places in 212 ms of which 3 ms to minimize.
[2024-05-28 16:49:19] [INFO ] Deduced a trap composed of 129 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:49:19] [INFO ] Deduced a trap composed of 143 places in 222 ms of which 2 ms to minimize.
[2024-05-28 16:49:20] [INFO ] Deduced a trap composed of 139 places in 191 ms of which 2 ms to minimize.
[2024-05-28 16:49:20] [INFO ] Deduced a trap composed of 127 places in 218 ms of which 3 ms to minimize.
[2024-05-28 16:49:20] [INFO ] Deduced a trap composed of 171 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:49:20] [INFO ] Deduced a trap composed of 161 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 16:49:25] [INFO ] Deduced a trap composed of 159 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:49:25] [INFO ] Deduced a trap composed of 148 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:49:26] [INFO ] Deduced a trap composed of 154 places in 185 ms of which 2 ms to minimize.
[2024-05-28 16:49:26] [INFO ] Deduced a trap composed of 143 places in 150 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Problem TDEAD708 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/357 variables, 2/66 constraints. Problems are: Problem set: 66 solved, 729 unsolved
[2024-05-28 16:49:37] [INFO ] Deduced a trap composed of 112 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:49:37] [INFO ] Deduced a trap composed of 62 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 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.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 1.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 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/1142 variables, and 68 constraints, problems are : Problem set: 66 solved, 729 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/357 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 66 solved, 729 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 66 solved, 729 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/40 constraints. Problems are: Problem set: 66 solved, 729 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 24/64 constraints. Problems are: Problem set: 66 solved, 729 unsolved
[2024-05-28 16:50:06] [INFO ] Deduced a trap composed of 200 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 1/65 constraints. Problems are: Problem set: 66 solved, 729 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/1142 variables, and 65 constraints, problems are : Problem set: 66 solved, 729 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/357 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/795 constraints, Known Traps: 25/27 constraints]
After SMT, in 61089ms problems are : Problem set: 66 solved, 729 unsolved
Search for dead transitions found 66 dead transitions in 61099ms
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 REACHABILITY mode, iteration 1 : 357/357 places, 731/797 transitions.
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 356 transition count 719
Reduce places removed 0 places and 12 transitions.
Deduced a syphon composed of 13 places in 1 ms
Applied a total of 1 rules in 26 ms. Remains 356 /357 variables (removed 1) and now considering 707/731 (removed 24) transitions.
[2024-05-28 16:50:09] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
// Phase 1: matrix 695 rows 356 cols
[2024-05-28 16:50:09] [INFO ] Computed 55 invariants in 17 ms
[2024-05-28 16:50:09] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-28 16:50:09] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
[2024-05-28 16:50:09] [INFO ] Invariant cache hit.
[2024-05-28 16:50:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:50:11] [INFO ] Implicit Places using invariants and state equation in 2039 ms returned []
Implicit Place search using SMT with State Equation took 2378 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 356/357 places, 707/797 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66612 ms. Remains : 356/357 places, 707/797 transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((X(p1)||p0)) U G(p2)))'
Support contains 21 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 25 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 16:50:12] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 517 cols
[2024-05-28 16:50:12] [INFO ] Computed 43 invariants in 9 ms
[2024-05-28 16:50:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 16:50:20] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:50:20] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:50:20] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:50:20] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:50:20] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:50:20] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:50:21] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:50:21] [INFO ] Deduced a trap composed of 246 places in 240 ms of which 3 ms to minimize.
[2024-05-28 16:50:21] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:50:22] [INFO ] Deduced a trap composed of 86 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:50:22] [INFO ] Deduced a trap composed of 127 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:50:22] [INFO ] Deduced a trap composed of 151 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:50:22] [INFO ] Deduced a trap composed of 121 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:50:26] [INFO ] Deduced a trap composed of 241 places in 228 ms of which 4 ms to minimize.
[2024-05-28 16:50:26] [INFO ] Deduced a trap composed of 246 places in 258 ms of which 3 ms to minimize.
[2024-05-28 16:50:29] [INFO ] Deduced a trap composed of 277 places in 255 ms of which 4 ms to minimize.
[2024-05-28 16:50:32] [INFO ] Deduced a trap composed of 306 places in 232 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 16:50:41] [INFO ] Deduced a trap composed of 306 places in 236 ms of which 3 ms to minimize.
[2024-05-28 16:50:41] [INFO ] Deduced a trap composed of 272 places in 213 ms of which 4 ms to minimize.
[2024-05-28 16:50:51] [INFO ] Deduced a trap composed of 42 places in 270 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 20/20 constraints]
After SMT, in 40951ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40960ms
[2024-05-28 16:50:53] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 16:50:53] [INFO ] Invariant cache hit.
[2024-05-28 16:50:53] [INFO ] Implicit Places using invariants in 447 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 451 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41447 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p2), (NOT p1), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-00
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-00 finished in 41848 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((X(p1)&&p0))))'
Support contains 19 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 529 /529 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 16:50:53] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 529 cols
[2024-05-28 16:50:53] [INFO ] Computed 43 invariants in 9 ms
[2024-05-28 16:50:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:51:02] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:51:02] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 2 ms to minimize.
[2024-05-28 16:51:02] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:51:02] [INFO ] Deduced a trap composed of 75 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:51:02] [INFO ] Deduced a trap composed of 74 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:51:03] [INFO ] Deduced a trap composed of 73 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:51:03] [INFO ] Deduced a trap composed of 74 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:51:03] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:51:03] [INFO ] Deduced a trap composed of 247 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:51:04] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 6 ms to minimize.
[2024-05-28 16:51:04] [INFO ] Deduced a trap composed of 130 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:51:04] [INFO ] Deduced a trap composed of 276 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:51:07] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:51:07] [INFO ] Deduced a trap composed of 267 places in 266 ms of which 4 ms to minimize.
[2024-05-28 16:51:08] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 4 ms to minimize.
[2024-05-28 16:51:09] [INFO ] Deduced a trap composed of 264 places in 238 ms of which 3 ms to minimize.
[2024-05-28 16:51:14] [INFO ] Deduced a trap composed of 264 places in 252 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1485 variables, and 58 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/529 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:51:22] [INFO ] Deduced a trap composed of 258 places in 263 ms of which 3 ms to minimize.
[2024-05-28 16:51:27] [INFO ] Deduced a trap composed of 107 places in 239 ms of which 3 ms to minimize.
[2024-05-28 16:51:28] [INFO ] Deduced a trap composed of 240 places in 226 ms of which 3 ms to minimize.
[2024-05-28 16:51:28] [INFO ] Deduced a trap composed of 289 places in 220 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1485 variables, and 62 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/529 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 21/21 constraints]
After SMT, in 41108ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41125ms
[2024-05-28 16:51:34] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 16:51:34] [INFO ] Invariant cache hit.
[2024-05-28 16:51:35] [INFO ] Implicit Places using invariants in 459 ms returned [302]
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 : 528/529 places, 968/968 transitions.
Applied a total of 0 rules in 7 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41602 ms. Remains : 528/529 places, 968/968 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-03
Product exploration explored 100000 steps with 4556 reset in 567 ms.
Product exploration explored 100000 steps with 4579 reset in 568 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 142 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 202 steps (0 resets) in 8 ms. (22 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 191 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-28 16:51:37] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2024-05-28 16:51:37] [INFO ] Computed 42 invariants in 12 ms
[2024-05-28 16:51:37] [INFO ] [Real]Absence check using 18 positive place invariants in 35 ms returned sat
[2024-05-28 16:51:37] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 81 ms returned sat
[2024-05-28 16:51:39] [INFO ] [Real]Absence check using state equation in 1719 ms returned sat
[2024-05-28 16:51:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:51:40] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-05-28 16:51:40] [INFO ] [Nat]Absence check using 18 positive and 24 generalized place invariants in 26 ms returned sat
[2024-05-28 16:51:43] [INFO ] [Nat]Absence check using state equation in 3068 ms returned sat
[2024-05-28 16:51:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:51:43] [INFO ] [Nat]Added 72 Read/Feed constraints in 638 ms returned sat
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 4 ms to minimize.
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 278 places in 258 ms of which 4 ms to minimize.
[2024-05-28 16:51:45] [INFO ] Deduced a trap composed of 74 places in 277 ms of which 3 ms to minimize.
[2024-05-28 16:51:45] [INFO ] Deduced a trap composed of 74 places in 230 ms of which 4 ms to minimize.
[2024-05-28 16:51:45] [INFO ] Deduced a trap composed of 74 places in 226 ms of which 3 ms to minimize.
[2024-05-28 16:51:46] [INFO ] Deduced a trap composed of 74 places in 248 ms of which 3 ms to minimize.
[2024-05-28 16:51:46] [INFO ] Deduced a trap composed of 266 places in 267 ms of which 3 ms to minimize.
[2024-05-28 16:51:47] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 4 ms to minimize.
[2024-05-28 16:51:47] [INFO ] Deduced a trap composed of 74 places in 238 ms of which 4 ms to minimize.
[2024-05-28 16:51:47] [INFO ] Deduced a trap composed of 274 places in 259 ms of which 4 ms to minimize.
[2024-05-28 16:51:48] [INFO ] Deduced a trap composed of 313 places in 272 ms of which 4 ms to minimize.
[2024-05-28 16:51:48] [INFO ] Deduced a trap composed of 283 places in 275 ms of which 4 ms to minimize.
[2024-05-28 16:51:48] [INFO ] Deduced a trap composed of 295 places in 253 ms of which 5 ms to minimize.
[2024-05-28 16:51:49] [INFO ] Deduced a trap composed of 323 places in 258 ms of which 3 ms to minimize.
[2024-05-28 16:51:49] [INFO ] Deduced a trap composed of 287 places in 207 ms of which 4 ms to minimize.
[2024-05-28 16:51:50] [INFO ] Deduced a trap composed of 328 places in 284 ms of which 3 ms to minimize.
[2024-05-28 16:51:50] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6527 ms
[2024-05-28 16:51:50] [INFO ] Computed and/alt/rep : 630/2205/624 causal constraints (skipped 330 transitions) in 93 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 16:51:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 19 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Applied a total of 0 rules in 7 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 16:51:54] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 16:51:54] [INFO ] Invariant cache hit.
[2024-05-28 16:51:54] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:52:02] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:52:03] [INFO ] Deduced a trap composed of 133 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:52:04] [INFO ] Deduced a trap composed of 253 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:52:04] [INFO ] Deduced a trap composed of 263 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:52:05] [INFO ] Deduced a trap composed of 250 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:52:05] [INFO ] Deduced a trap composed of 258 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:52:06] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:52:06] [INFO ] Deduced a trap composed of 98 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:52:07] [INFO ] Deduced a trap composed of 266 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:52:07] [INFO ] Deduced a trap composed of 260 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:52:11] [INFO ] Deduced a trap composed of 253 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 50 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:52:21] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:52:21] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:52:22] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:52:22] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:52:23] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:52:29] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 4 ms to minimize.
[2024-05-28 16:52:35] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 57 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 18/18 constraints]
After SMT, in 41080ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41092ms
[2024-05-28 16:52:35] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 16:52:35] [INFO ] Invariant cache hit.
[2024-05-28 16:52:36] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-05-28 16:52:36] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 16:52:36] [INFO ] Invariant cache hit.
[2024-05-28 16:52:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:52:42] [INFO ] Implicit Places using invariants and state equation in 6638 ms returned []
Implicit Place search using SMT with State Equation took 7129 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-05-28 16:52:42] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 16:52:42] [INFO ] Invariant cache hit.
[2024-05-28 16:52:42] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:52:50] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-28 16:52:51] [INFO ] Deduced a trap composed of 133 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:52:52] [INFO ] Deduced a trap composed of 253 places in 207 ms of which 4 ms to minimize.
[2024-05-28 16:52:52] [INFO ] Deduced a trap composed of 263 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:52:53] [INFO ] Deduced a trap composed of 250 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:52:53] [INFO ] Deduced a trap composed of 258 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:52:54] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:52:54] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:52:55] [INFO ] Deduced a trap composed of 266 places in 208 ms of which 3 ms to minimize.
[2024-05-28 16:52:55] [INFO ] Deduced a trap composed of 260 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:53:00] [INFO ] Deduced a trap composed of 253 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:53:11] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 51 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:53:29] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 2 ms to minimize.
[2024-05-28 16:53:29] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:53:29] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:53:31] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:53:36] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:53:37] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 57 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 18/18 constraints]
After SMT, in 60870ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 60890ms
Finished structural reductions in LTL mode , in 1 iterations and 109124 ms. Remains : 528/528 places, 968/968 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 p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 132 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 540 steps (0 resets) in 12 ms. (41 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 232 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-28 16:53:44] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 16:53:44] [INFO ] Invariant cache hit.
[2024-05-28 16:53:45] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-05-28 16:53:45] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 67 ms returned sat
[2024-05-28 16:53:46] [INFO ] [Real]Absence check using state equation in 1647 ms returned sat
[2024-05-28 16:53:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:53:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2024-05-28 16:53:47] [INFO ] [Nat]Absence check using 18 positive and 24 generalized place invariants in 43 ms returned sat
[2024-05-28 16:53:49] [INFO ] [Nat]Absence check using state equation in 2491 ms returned sat
[2024-05-28 16:53:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:53:49] [INFO ] [Nat]Added 72 Read/Feed constraints in 156 ms returned sat
[2024-05-28 16:53:50] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1594 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4574 reset in 398 ms.
Product exploration explored 100000 steps with 4569 reset in 590 ms.
Built C files in :
/tmp/ltsmin5413083438652564519
[2024-05-28 16:53:52] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5413083438652564519
Running compilation step : cd /tmp/ltsmin5413083438652564519;'/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 2252 ms.
Running link step : cd /tmp/ltsmin5413083438652564519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin5413083438652564519;'/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/stateBased14866628798911158892.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 19 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 16:54:08] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 16:54:08] [INFO ] Invariant cache hit.
[2024-05-28 16:54:08] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:54:15] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:54:16] [INFO ] Deduced a trap composed of 133 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:54:17] [INFO ] Deduced a trap composed of 253 places in 212 ms of which 3 ms to minimize.
[2024-05-28 16:54:17] [INFO ] Deduced a trap composed of 263 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:54:18] [INFO ] Deduced a trap composed of 250 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:54:18] [INFO ] Deduced a trap composed of 258 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:54:19] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:54:19] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:54:20] [INFO ] Deduced a trap composed of 266 places in 204 ms of which 3 ms to minimize.
[2024-05-28 16:54:20] [INFO ] Deduced a trap composed of 260 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:54:25] [INFO ] Deduced a trap composed of 253 places in 191 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 50 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:54:34] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:54:34] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:54:35] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:54:35] [INFO ] Deduced a trap composed of 74 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:54:36] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:54:42] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 4 ms to minimize.
[2024-05-28 16:54:48] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 57 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 18/18 constraints]
After SMT, in 40886ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40895ms
[2024-05-28 16:54:48] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 16:54:48] [INFO ] Invariant cache hit.
[2024-05-28 16:54:49] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-28 16:54:49] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 16:54:49] [INFO ] Invariant cache hit.
[2024-05-28 16:54:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:54:55] [INFO ] Implicit Places using invariants and state equation in 6188 ms returned []
Implicit Place search using SMT with State Equation took 6583 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-05-28 16:54:55] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 16:54:55] [INFO ] Invariant cache hit.
[2024-05-28 16:54:55] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:55:03] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:55:04] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:55:05] [INFO ] Deduced a trap composed of 253 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:55:05] [INFO ] Deduced a trap composed of 263 places in 129 ms of which 3 ms to minimize.
[2024-05-28 16:55:05] [INFO ] Deduced a trap composed of 250 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:55:06] [INFO ] Deduced a trap composed of 258 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:55:06] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:55:07] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:55:07] [INFO ] Deduced a trap composed of 266 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:55:08] [INFO ] Deduced a trap composed of 260 places in 129 ms of which 3 ms to minimize.
[2024-05-28 16:55:11] [INFO ] Deduced a trap composed of 253 places in 144 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:55:24] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 51 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 16:55:39] [INFO ] Deduced a trap composed of 74 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:55:40] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:55:40] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:55:41] [INFO ] Deduced a trap composed of 74 places in 42 ms of which 3 ms to minimize.
[2024-05-28 16:55:47] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:55:47] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 57 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 18/18 constraints]
After SMT, in 61128ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 61139ms
Finished structural reductions in LTL mode , in 1 iterations and 108625 ms. Remains : 528/528 places, 968/968 transitions.
Built C files in :
/tmp/ltsmin14497872399165296251
[2024-05-28 16:55:56] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14497872399165296251
Running compilation step : cd /tmp/ltsmin14497872399165296251;'/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 1878 ms.
Running link step : cd /tmp/ltsmin14497872399165296251;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin14497872399165296251;'/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/stateBased5390459377086813560.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 16:56:11] [INFO ] Flatten gal took : 57 ms
[2024-05-28 16:56:11] [INFO ] Flatten gal took : 43 ms
[2024-05-28 16:56:11] [INFO ] Time to serialize gal into /tmp/LTL11569284648205964818.gal : 12 ms
[2024-05-28 16:56:11] [INFO ] Time to serialize properties into /tmp/LTL17050825614838226777.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/LTL11569284648205964818.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9133244989718333897.hoa' '-atoms' '/tmp/LTL17050825614838226777.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...319
Loading property file /tmp/LTL17050825614838226777.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9133244989718333897.hoa
Detected timeout of ITS tools.
[2024-05-28 16:56:27] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:56:27] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:56:27] [INFO ] Time to serialize gal into /tmp/LTL14666456611739555512.gal : 5 ms
[2024-05-28 16:56:27] [INFO ] Time to serialize properties into /tmp/LTL18256606441760196829.ltl : 3 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/LTL14666456611739555512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18256606441760196829.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 : !((G(F(((((X("((((Try_Check_Sources_E_5>=1)||(Try_Check_Sources_E_4>=1))||((Try_Check_Sources_E_6>=1)||(Try_Check_Sources_E_2>=1)))||(...817
Formula 0 simplified : FG(!"(((((cBlockedTasks<10)||(DisablePollingB_2_1<1))&&((cBlockedTasks<10)||(DisablePollingB_1_1<1)))&&(((cBlockedTasks<10)||(Disabl...803
Detected timeout of ITS tools.
[2024-05-28 16:56:42] [INFO ] Flatten gal took : 64 ms
[2024-05-28 16:56:42] [INFO ] Applying decomposition
[2024-05-28 16:56:42] [INFO ] Flatten gal took : 48 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/graph3175202976739027568.txt' '-o' '/tmp/graph3175202976739027568.bin' '-w' '/tmp/graph3175202976739027568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3175202976739027568.bin' '-l' '-1' '-v' '-w' '/tmp/graph3175202976739027568.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:56:42] [INFO ] Decomposing Gal with order
[2024-05-28 16:56:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:56:42] [INFO ] Removed a total of 794 redundant transitions.
[2024-05-28 16:56:42] [INFO ] Flatten gal took : 163 ms
[2024-05-28 16:56:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 42 ms.
[2024-05-28 16:56:43] [INFO ] Time to serialize gal into /tmp/LTL10712147670950087907.gal : 20 ms
[2024-05-28 16:56:43] [INFO ] Time to serialize properties into /tmp/LTL1065168181755889829.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/LTL10712147670950087907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1065168181755889829.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 : !((G(F(((((X("((((i12.u45.Try_Check_Sources_E_5>=1)||(i9.u101.Try_Check_Sources_E_4>=1))||((i0.u66.Try_Check_Sources_E_6>=1)||(i2.i0.i...1110
Formula 0 simplified : FG(!"(((((i2.i1.i0.u0.cBlockedTasks<10)||(i13.u71.DisablePollingB_2_1<1))&&((i2.i1.i0.u0.cBlockedTasks<10)||(i3.u22.DisablePollingB_...1096
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-03 finished in 364359 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 12 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Applied a total of 12 rules in 17 ms. Remains 523 /529 variables (removed 6) and now considering 962/968 (removed 6) transitions.
Running 960 sub problems to find dead transitions.
[2024-05-28 16:56:58] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
// Phase 1: matrix 950 rows 523 cols
[2024-05-28 16:56:58] [INFO ] Computed 43 invariants in 14 ms
[2024-05-28 16:56:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:57:06] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:57:07] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 5 ms to minimize.
[2024-05-28 16:57:09] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:57:10] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:57:14] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/1473 variables, and 38 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 16/26 constraints, State Equation: 0/523 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:57:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-28 16:57:21] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 3 ms to minimize.
[2024-05-28 16:57:21] [INFO ] Deduced a trap composed of 73 places in 261 ms of which 3 ms to minimize.
[2024-05-28 16:57:21] [INFO ] Deduced a trap composed of 56 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:57:21] [INFO ] Deduced a trap composed of 82 places in 192 ms of which 4 ms to minimize.
[2024-05-28 16:57:22] [INFO ] Deduced a trap composed of 119 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:57:22] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:57:22] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 2 ms to minimize.
[2024-05-28 16:57:22] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:57:23] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:57:23] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:57:29] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:57:29] [INFO ] Deduced a trap composed of 73 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 960 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 521/1473 variables, and 51 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 16/26 constraints, State Equation: 0/523 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 18/18 constraints]
After SMT, in 41071ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 41084ms
[2024-05-28 16:57:39] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2024-05-28 16:57:39] [INFO ] Invariant cache hit.
[2024-05-28 16:57:39] [INFO ] Implicit Places using invariants in 389 ms returned [299]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 391 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 522/529 places, 962/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 522 /522 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41500 ms. Remains : 522/529 places, 962/968 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-04 finished in 41577 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 G(p1))) U p2))'
Support contains 58 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 16 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 16:57:39] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 517 cols
[2024-05-28 16:57:39] [INFO ] Computed 43 invariants in 13 ms
[2024-05-28 16:57:39] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 16:57:47] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 3 ms to minimize.
[2024-05-28 16:57:47] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:57:47] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:57:47] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:57:47] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:57:47] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:57:48] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:57:48] [INFO ] Deduced a trap composed of 246 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:57:48] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 2 ms to minimize.
[2024-05-28 16:57:49] [INFO ] Deduced a trap composed of 86 places in 230 ms of which 4 ms to minimize.
[2024-05-28 16:57:49] [INFO ] Deduced a trap composed of 127 places in 205 ms of which 4 ms to minimize.
[2024-05-28 16:57:49] [INFO ] Deduced a trap composed of 151 places in 202 ms of which 3 ms to minimize.
[2024-05-28 16:57:50] [INFO ] Deduced a trap composed of 121 places in 220 ms of which 3 ms to minimize.
[2024-05-28 16:57:53] [INFO ] Deduced a trap composed of 241 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:57:54] [INFO ] Deduced a trap composed of 246 places in 238 ms of which 3 ms to minimize.
[2024-05-28 16:57:56] [INFO ] Deduced a trap composed of 277 places in 256 ms of which 3 ms to minimize.
[2024-05-28 16:57:59] [INFO ] Deduced a trap composed of 306 places in 243 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 16:58:09] [INFO ] Deduced a trap composed of 306 places in 233 ms of which 6 ms to minimize.
[2024-05-28 16:58:09] [INFO ] Deduced a trap composed of 272 places in 265 ms of which 4 ms to minimize.
[2024-05-28 16:58:17] [INFO ] Deduced a trap composed of 42 places in 295 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 20/20 constraints]
After SMT, in 40887ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40897ms
[2024-05-28 16:58:20] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 16:58:20] [INFO ] Invariant cache hit.
[2024-05-28 16:58:21] [INFO ] Implicit Places using invariants in 376 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 379 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 9 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41304 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (OR (NOT p2) p1), p1, (AND (NOT p0) p1), (AND p1 (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-05
Stuttering criterion allowed to conclude after 7765 steps with 142 reset in 72 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-05 finished in 41619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 12 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 35 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 16:58:21] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 16:58:21] [INFO ] Invariant cache hit.
[2024-05-28 16:58:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 16:58:28] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 72 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 246 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:58:30] [INFO ] Deduced a trap composed of 127 places in 226 ms of which 4 ms to minimize.
[2024-05-28 16:58:31] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:58:31] [INFO ] Deduced a trap composed of 348 places in 239 ms of which 4 ms to minimize.
[2024-05-28 16:58:33] [INFO ] Deduced a trap composed of 140 places in 232 ms of which 3 ms to minimize.
[2024-05-28 16:58:35] [INFO ] Deduced a trap composed of 241 places in 241 ms of which 4 ms to minimize.
[2024-05-28 16:58:35] [INFO ] Deduced a trap composed of 218 places in 260 ms of which 3 ms to minimize.
[2024-05-28 16:58:36] [INFO ] Deduced a trap composed of 266 places in 200 ms of which 2 ms to minimize.
[2024-05-28 16:58:36] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 4 ms to minimize.
[2024-05-28 16:58:41] [INFO ] Deduced a trap composed of 264 places in 291 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints]
After SMT, in 40900ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40920ms
[2024-05-28 16:59:02] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 16:59:02] [INFO ] Invariant cache hit.
[2024-05-28 16:59:02] [INFO ] Implicit Places using invariants in 540 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 543 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41507 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-06
Product exploration explored 100000 steps with 1848 reset in 312 ms.
Product exploration explored 100000 steps with 1851 reset in 370 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 210 steps (0 resets) in 5 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-05-28 16:59:04] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-05-28 16:59:04] [INFO ] Computed 42 invariants in 13 ms
[2024-05-28 16:59:04] [INFO ] [Real]Absence check using 16 positive place invariants in 18 ms returned sat
[2024-05-28 16:59:04] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 62 ms returned sat
[2024-05-28 16:59:05] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2024-05-28 16:59:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:59:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 16:59:05] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 47 ms returned sat
[2024-05-28 16:59:08] [INFO ] [Nat]Absence check using state equation in 2628 ms returned sat
[2024-05-28 16:59:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:59:09] [INFO ] [Nat]Added 72 Read/Feed constraints in 624 ms returned sat
[2024-05-28 16:59:09] [INFO ] Deduced a trap composed of 72 places in 209 ms of which 3 ms to minimize.
[2024-05-28 16:59:09] [INFO ] Deduced a trap composed of 95 places in 235 ms of which 3 ms to minimize.
[2024-05-28 16:59:10] [INFO ] Deduced a trap composed of 73 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:59:11] [INFO ] Deduced a trap composed of 76 places in 240 ms of which 3 ms to minimize.
[2024-05-28 16:59:11] [INFO ] Deduced a trap composed of 72 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:59:12] [INFO ] Deduced a trap composed of 124 places in 238 ms of which 4 ms to minimize.
[2024-05-28 16:59:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3179 ms
[2024-05-28 16:59:12] [INFO ] Computed and/alt/rep : 618/2193/612 causal constraints (skipped 330 transitions) in 103 ms.
Could not prove EG (NOT p0)
Support contains 12 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 956/956 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 516 transition count 914
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 474 transition count 854
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 414 transition count 854
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
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 276 place count 378 transition count 818
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 279 place count 375 transition count 815
Iterating global reduction 2 with 3 rules applied. Total rules applied 282 place count 375 transition count 815
Applied a total of 282 rules in 97 ms. Remains 375 /516 variables (removed 141) and now considering 815/956 (removed 141) transitions.
Running 813 sub problems to find dead transitions.
[2024-05-28 16:59:20] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
// Phase 1: matrix 803 rows 375 cols
[2024-05-28 16:59:20] [INFO ] Computed 42 invariants in 19 ms
[2024-05-28 16:59:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2024-05-28 16:59:26] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:59:26] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:59:26] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:59:26] [INFO ] Deduced a trap composed of 133 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:59:27] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:59:27] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:59:27] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:59:28] [INFO ] Deduced a trap composed of 113 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:59:31] [INFO ] Deduced a trap composed of 136 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:59:31] [INFO ] Deduced a trap composed of 127 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:59:32] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 813 unsolved
SMT process timed out in 21169ms, After SMT, problems are : Problem set: 0 solved, 813 unsolved
Search for dead transitions found 0 dead transitions in 21178ms
[2024-05-28 16:59:41] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-05-28 16:59:41] [INFO ] Invariant cache hit.
[2024-05-28 16:59:42] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-28 16:59:42] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-05-28 16:59:42] [INFO ] Invariant cache hit.
[2024-05-28 16:59:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:59:46] [INFO ] Implicit Places using invariants and state equation in 4279 ms returned []
Implicit Place search using SMT with State Equation took 4601 ms to find 0 implicit places.
[2024-05-28 16:59:46] [INFO ] Redundant transitions in 16 ms returned []
Running 813 sub problems to find dead transitions.
[2024-05-28 16:59:46] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-05-28 16:59:46] [INFO ] Invariant cache hit.
[2024-05-28 16:59:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2024-05-28 16:59:51] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:59:51] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:59:51] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 3 ms to minimize.
[2024-05-28 16:59:52] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:59:52] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:59:52] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:59:52] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:59:53] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:59:53] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:59:53] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:59:55] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:59:57] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:59:57] [INFO ] Deduced a trap composed of 127 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:59:57] [INFO ] Deduced a trap composed of 132 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/375 variables, 3/56 constraints. Problems are: Problem set: 66 solved, 747 unsolved
[2024-05-28 17:00:10] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 2 ms to minimize.
[2024-05-28 17:00:10] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:00:10] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:00:10] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 1 ms to minimize.
[2024-05-28 17:00:10] [INFO ] Deduced a trap composed of 49 places in 30 ms of which 0 ms to minimize.
[2024-05-28 17:00:10] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 1 ms to minimize.
[2024-05-28 17:00:11] [INFO ] Deduced a trap composed of 158 places in 154 ms of which 2 ms to minimize.
[2024-05-28 17:00:11] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 2 ms to minimize.
[2024-05-28 17:00:13] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 3 ms to minimize.
[2024-05-28 17:00:14] [INFO ] Deduced a trap composed of 200 places in 177 ms of which 2 ms to minimize.
[2024-05-28 17:00:14] [INFO ] Deduced a trap composed of 179 places in 181 ms of which 2 ms to minimize.
[2024-05-28 17:00:15] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 3 ms to minimize.
[2024-05-28 17:00:17] [INFO ] Deduced a trap composed of 135 places in 196 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/1178 variables, and 69 constraints, problems are : Problem set: 66 solved, 747 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/375 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 813/813 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 66 solved, 747 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 17/17 constraints. Problems are: Problem set: 66 solved, 747 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 22/39 constraints. Problems are: Problem set: 66 solved, 747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 22/61 constraints. Problems are: Problem set: 66 solved, 747 unsolved
[2024-05-28 17:00:19] [INFO ] Deduced a trap composed of 184 places in 150 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 1/62 constraints. Problems are: Problem set: 66 solved, 747 unsolved
[2024-05-28 17:00:31] [INFO ] Deduced a trap composed of 118 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 1/63 constraints. Problems are: Problem set: 66 solved, 747 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/63 constraints. Problems are: Problem set: 66 solved, 747 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/1178 variables, and 66 constraints, problems are : Problem set: 66 solved, 747 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/375 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/813 constraints, Known Traps: 24/29 constraints]
After SMT, in 60965ms problems are : Problem set: 66 solved, 747 unsolved
Search for dead transitions found 66 dead transitions in 60974ms
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 : 375/516 places, 749/956 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 361 transition count 725
Applied a total of 12 rules in 28 ms. Remains 361 /375 variables (removed 14) and now considering 725/749 (removed 24) transitions.
[2024-05-28 17:00:47] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
// Phase 1: matrix 713 rows 361 cols
[2024-05-28 17:00:47] [INFO ] Computed 42 invariants in 11 ms
[2024-05-28 17:00:47] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-28 17:00:47] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-05-28 17:00:47] [INFO ] Invariant cache hit.
[2024-05-28 17:00:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:00:51] [INFO ] Implicit Places using invariants and state equation in 3908 ms returned []
Implicit Place search using SMT with State Equation took 4298 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 361/516 places, 725/956 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91205 ms. Remains : 361/516 places, 725/956 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 141 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
[2024-05-28 17:00:52] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-05-28 17:00:52] [INFO ] Invariant cache hit.
[2024-05-28 17:00:52] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-05-28 17:00:52] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 48 ms returned sat
[2024-05-28 17:00:52] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2024-05-28 17:00:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:00:53] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-28 17:00:53] [INFO ] [Nat]Absence check using 18 positive and 24 generalized place invariants in 38 ms returned sat
[2024-05-28 17:00:54] [INFO ] [Nat]Absence check using state equation in 816 ms returned sat
[2024-05-28 17:00:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:00:54] [INFO ] [Nat]Added 72 Read/Feed constraints in 77 ms returned sat
[2024-05-28 17:00:54] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:00:54] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:00:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2024-05-28 17:00:54] [INFO ] Computed and/alt/rep : 441/1956/435 causal constraints (skipped 276 transitions) in 63 ms.
[2024-05-28 17:00:56] [INFO ] Added : 158 causal constraints over 32 iterations in 2343 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2631 reset in 439 ms.
Product exploration explored 100000 steps with 2634 reset in 447 ms.
Built C files in :
/tmp/ltsmin4243187419475602526
[2024-05-28 17:00:57] [INFO ] Computing symmetric may disable matrix : 725 transitions.
[2024-05-28 17:00:57] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:00:57] [INFO ] Computing symmetric may enable matrix : 725 transitions.
[2024-05-28 17:00:57] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:00:58] [INFO ] Computing Do-Not-Accords matrix : 725 transitions.
[2024-05-28 17:00:58] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:00:58] [INFO ] Built C files in 214ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4243187419475602526
Running compilation step : cd /tmp/ltsmin4243187419475602526;'/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 2101 ms.
Running link step : cd /tmp/ltsmin4243187419475602526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin4243187419475602526;'/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/stateBased6521490763179977821.hoa' '--buchi-type=spotba'
LTSmin run took 9232 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-06 finished in 168154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&(G(p1)||p2))))'
Support contains 63 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 15 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 17:01:09] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 517 cols
[2024-05-28 17:01:09] [INFO ] Computed 43 invariants in 12 ms
[2024-05-28 17:01:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 17:01:17] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-28 17:01:17] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:01:17] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:01:17] [INFO ] Deduced a trap composed of 73 places in 33 ms of which 0 ms to minimize.
[2024-05-28 17:01:17] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:01:17] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:01:17] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 0 ms to minimize.
[2024-05-28 17:01:17] [INFO ] Deduced a trap composed of 246 places in 175 ms of which 3 ms to minimize.
[2024-05-28 17:01:18] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:01:18] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 4 ms to minimize.
[2024-05-28 17:01:19] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:01:19] [INFO ] Deduced a trap composed of 151 places in 166 ms of which 3 ms to minimize.
[2024-05-28 17:01:19] [INFO ] Deduced a trap composed of 121 places in 145 ms of which 3 ms to minimize.
[2024-05-28 17:01:22] [INFO ] Deduced a trap composed of 241 places in 238 ms of which 3 ms to minimize.
[2024-05-28 17:01:23] [INFO ] Deduced a trap composed of 246 places in 236 ms of which 3 ms to minimize.
[2024-05-28 17:01:26] [INFO ] Deduced a trap composed of 277 places in 187 ms of which 3 ms to minimize.
[2024-05-28 17:01:28] [INFO ] Deduced a trap composed of 306 places in 185 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 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 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.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 4.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.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 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 (/ 1.0 3.0))
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.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 1.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 1.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 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.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 10.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 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 5.0)
(s385 0.0)
(s386 6.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 (/ 1.0 3.0))
(s392 1.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 (/ 1.0 3.0))
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 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 515/1461 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 17:01:38] [INFO ] Deduced a trap composed of 306 places in 267 ms of which 4 ms to minimize.
[2024-05-28 17:01:38] [INFO ] Deduced a trap composed of 272 places in 168 ms of which 2 ms to minimize.
[2024-05-28 17:01:46] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 20/20 constraints]
After SMT, in 40969ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40979ms
[2024-05-28 17:01:50] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 17:01:50] [INFO ] Invariant cache hit.
[2024-05-28 17:01:50] [INFO ] Implicit Places using invariants in 392 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 393 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41395 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-07 finished in 41537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 4 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 14 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 17:01:51] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 17:01:51] [INFO ] Invariant cache hit.
[2024-05-28 17:01:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 17:01:58] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 2 ms to minimize.
[2024-05-28 17:01:59] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 3 ms to minimize.
[2024-05-28 17:01:59] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 2 ms to minimize.
[2024-05-28 17:01:59] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:01:59] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 0 ms to minimize.
[2024-05-28 17:01:59] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 0 ms to minimize.
[2024-05-28 17:01:59] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-05-28 17:01:59] [INFO ] Deduced a trap composed of 72 places in 32 ms of which 0 ms to minimize.
[2024-05-28 17:01:59] [INFO ] Deduced a trap composed of 246 places in 207 ms of which 4 ms to minimize.
[2024-05-28 17:02:00] [INFO ] Deduced a trap composed of 127 places in 195 ms of which 2 ms to minimize.
[2024-05-28 17:02:01] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2024-05-28 17:02:01] [INFO ] Deduced a trap composed of 348 places in 222 ms of which 4 ms to minimize.
[2024-05-28 17:02:03] [INFO ] Deduced a trap composed of 140 places in 248 ms of which 3 ms to minimize.
[2024-05-28 17:02:05] [INFO ] Deduced a trap composed of 241 places in 231 ms of which 4 ms to minimize.
[2024-05-28 17:02:05] [INFO ] Deduced a trap composed of 218 places in 215 ms of which 2 ms to minimize.
[2024-05-28 17:02:06] [INFO ] Deduced a trap composed of 266 places in 195 ms of which 2 ms to minimize.
[2024-05-28 17:02:06] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
[2024-05-28 17:02:11] [INFO ] Deduced a trap composed of 264 places in 180 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
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 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 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 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 1)
(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 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(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 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 9)
(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 1)
(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 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints]
After SMT, in 40878ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40887ms
[2024-05-28 17:02:31] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 17:02:31] [INFO ] Invariant cache hit.
[2024-05-28 17:02:32] [INFO ] Implicit Places using invariants in 478 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 479 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41388 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-08
Stuttering criterion allowed to conclude after 10682 steps with 23 reset in 27 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-08 finished in 41505 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(G((p0||G(p1)))))))'
Support contains 10 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 30 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 17:02:32] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 17:02:32] [INFO ] Invariant cache hit.
[2024-05-28 17:02:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 17:02:40] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 3 ms to minimize.
[2024-05-28 17:02:41] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 2 ms to minimize.
[2024-05-28 17:02:41] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:02:41] [INFO ] Deduced a trap composed of 73 places in 30 ms of which 1 ms to minimize.
[2024-05-28 17:02:41] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:02:41] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 0 ms to minimize.
[2024-05-28 17:02:41] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 17:02:41] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:02:41] [INFO ] Deduced a trap composed of 246 places in 192 ms of which 2 ms to minimize.
[2024-05-28 17:02:42] [INFO ] Deduced a trap composed of 127 places in 197 ms of which 3 ms to minimize.
[2024-05-28 17:02:43] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
[2024-05-28 17:02:43] [INFO ] Deduced a trap composed of 348 places in 168 ms of which 2 ms to minimize.
[2024-05-28 17:02:44] [INFO ] Deduced a trap composed of 140 places in 239 ms of which 3 ms to minimize.
[2024-05-28 17:02:46] [INFO ] Deduced a trap composed of 241 places in 234 ms of which 4 ms to minimize.
[2024-05-28 17:02:47] [INFO ] Deduced a trap composed of 218 places in 229 ms of which 4 ms to minimize.
[2024-05-28 17:02:47] [INFO ] Deduced a trap composed of 266 places in 197 ms of which 3 ms to minimize.
[2024-05-28 17:02:48] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 4 ms to minimize.
[2024-05-28 17:02:52] [INFO ] Deduced a trap composed of 264 places in 225 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints]
After SMT, in 40971ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40985ms
[2024-05-28 17:03:13] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 17:03:13] [INFO ] Invariant cache hit.
[2024-05-28 17:03:14] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-28 17:03:14] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 17:03:14] [INFO ] Invariant cache hit.
[2024-05-28 17:03:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:03:22] [INFO ] Implicit Places using invariants and state equation in 8758 ms returned []
Implicit Place search using SMT with State Equation took 9261 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 17:03:22] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 17:03:22] [INFO ] Invariant cache hit.
[2024-05-28 17:03:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 17:03:30] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 3 ms to minimize.
[2024-05-28 17:03:31] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 2 ms to minimize.
[2024-05-28 17:03:31] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2024-05-28 17:03:31] [INFO ] Deduced a trap composed of 73 places in 32 ms of which 1 ms to minimize.
[2024-05-28 17:03:31] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-05-28 17:03:31] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-05-28 17:03:31] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-05-28 17:03:31] [INFO ] Deduced a trap composed of 72 places in 32 ms of which 1 ms to minimize.
[2024-05-28 17:03:31] [INFO ] Deduced a trap composed of 246 places in 232 ms of which 4 ms to minimize.
[2024-05-28 17:03:32] [INFO ] Deduced a trap composed of 127 places in 207 ms of which 3 ms to minimize.
[2024-05-28 17:03:33] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 2 ms to minimize.
[2024-05-28 17:03:33] [INFO ] Deduced a trap composed of 348 places in 227 ms of which 4 ms to minimize.
[2024-05-28 17:03:34] [INFO ] Deduced a trap composed of 140 places in 166 ms of which 2 ms to minimize.
[2024-05-28 17:03:36] [INFO ] Deduced a trap composed of 241 places in 250 ms of which 3 ms to minimize.
[2024-05-28 17:03:37] [INFO ] Deduced a trap composed of 218 places in 258 ms of which 4 ms to minimize.
[2024-05-28 17:03:37] [INFO ] Deduced a trap composed of 266 places in 188 ms of which 3 ms to minimize.
[2024-05-28 17:03:38] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 4 ms to minimize.
[2024-05-28 17:03:43] [INFO ] Deduced a trap composed of 264 places in 208 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
SMT process timed out in 31017ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 31027ms
Starting structural reductions in LTL mode, iteration 1 : 517/529 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81308 ms. Remains : 517/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-10 finished in 81450 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 3 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 13 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 17:03:54] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 17:03:54] [INFO ] Invariant cache hit.
[2024-05-28 17:03:54] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 17:04:01] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 2 ms to minimize.
[2024-05-28 17:04:02] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 2 ms to minimize.
[2024-05-28 17:04:02] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2024-05-28 17:04:02] [INFO ] Deduced a trap composed of 73 places in 31 ms of which 1 ms to minimize.
[2024-05-28 17:04:02] [INFO ] Deduced a trap composed of 72 places in 32 ms of which 0 ms to minimize.
[2024-05-28 17:04:02] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-05-28 17:04:02] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 3 ms to minimize.
[2024-05-28 17:04:02] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:04:02] [INFO ] Deduced a trap composed of 246 places in 214 ms of which 4 ms to minimize.
[2024-05-28 17:04:03] [INFO ] Deduced a trap composed of 127 places in 161 ms of which 2 ms to minimize.
[2024-05-28 17:04:04] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
[2024-05-28 17:04:04] [INFO ] Deduced a trap composed of 348 places in 162 ms of which 3 ms to minimize.
[2024-05-28 17:04:05] [INFO ] Deduced a trap composed of 140 places in 234 ms of which 4 ms to minimize.
[2024-05-28 17:04:07] [INFO ] Deduced a trap composed of 241 places in 198 ms of which 4 ms to minimize.
[2024-05-28 17:04:08] [INFO ] Deduced a trap composed of 218 places in 207 ms of which 3 ms to minimize.
[2024-05-28 17:04:08] [INFO ] Deduced a trap composed of 266 places in 185 ms of which 3 ms to minimize.
[2024-05-28 17:04:09] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 2 ms to minimize.
[2024-05-28 17:04:14] [INFO ] Deduced a trap composed of 264 places in 236 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints]
After SMT, in 40988ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40996ms
[2024-05-28 17:04:34] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 17:04:34] [INFO ] Invariant cache hit.
[2024-05-28 17:04:35] [INFO ] Implicit Places using invariants in 518 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 520 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41540 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 238 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-11 finished in 41620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 529 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 475 transition count 914
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 108 place count 475 transition count 855
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 226 place count 416 transition count 855
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 229 place count 413 transition count 852
Iterating global reduction 2 with 3 rules applied. Total rules applied 232 place count 413 transition count 852
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 328 place count 365 transition count 804
Applied a total of 328 rules in 53 ms. Remains 365 /529 variables (removed 164) and now considering 804/968 (removed 164) transitions.
Running 802 sub problems to find dead transitions.
[2024-05-28 17:04:35] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
// Phase 1: matrix 792 rows 365 cols
[2024-05-28 17:04:35] [INFO ] Computed 43 invariants in 7 ms
[2024-05-28 17:04:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 17:04:41] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:04:41] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:04:41] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2024-05-28 17:04:41] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 2 ms to minimize.
[2024-05-28 17:04:41] [INFO ] Deduced a trap composed of 121 places in 174 ms of which 2 ms to minimize.
[2024-05-28 17:04:41] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 0 ms to minimize.
[2024-05-28 17:04:41] [INFO ] Deduced a trap composed of 47 places in 29 ms of which 0 ms to minimize.
[2024-05-28 17:04:41] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 0 ms to minimize.
[2024-05-28 17:04:42] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
[2024-05-28 17:04:42] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 2 ms to minimize.
[2024-05-28 17:04:42] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-05-28 17:04:43] [INFO ] Deduced a trap composed of 216 places in 174 ms of which 2 ms to minimize.
[2024-05-28 17:04:45] [INFO ] Deduced a trap composed of 131 places in 190 ms of which 3 ms to minimize.
[2024-05-28 17:04:46] [INFO ] Deduced a trap composed of 113 places in 155 ms of which 2 ms to minimize.
[2024-05-28 17:04:46] [INFO ] Deduced a trap composed of 140 places in 142 ms of which 2 ms to minimize.
[2024-05-28 17:04:47] [INFO ] Deduced a trap composed of 151 places in 138 ms of which 2 ms to minimize.
[2024-05-28 17:04:47] [INFO ] Deduced a trap composed of 146 places in 216 ms of which 3 ms to minimize.
[2024-05-28 17:04:48] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 802 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 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 9.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.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 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 802 unsolved
SMT process timed out in 20831ms, After SMT, problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 20839ms
[2024-05-28 17:04:56] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
[2024-05-28 17:04:56] [INFO ] Invariant cache hit.
[2024-05-28 17:04:56] [INFO ] Implicit Places using invariants in 307 ms returned [209]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 309 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 364/529 places, 804/968 transitions.
Applied a total of 0 rules in 12 ms. Remains 364 /364 variables (removed 0) and now considering 804/804 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21216 ms. Remains : 364/529 places, 804/968 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-13
Stuttering criterion allowed to conclude after 3890 steps with 11 reset in 13 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-13 finished in 21267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)&&X((p2&&X(F(p3))))))'
Support contains 7 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 14 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 17:04:56] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 517 cols
[2024-05-28 17:04:56] [INFO ] Computed 43 invariants in 9 ms
[2024-05-28 17:04:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 17:05:04] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-28 17:05:04] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 2 ms to minimize.
[2024-05-28 17:05:04] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-05-28 17:05:04] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:05:04] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:05:04] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:05:04] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:05:04] [INFO ] Deduced a trap composed of 246 places in 238 ms of which 4 ms to minimize.
[2024-05-28 17:05:05] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 2 ms to minimize.
[2024-05-28 17:05:06] [INFO ] Deduced a trap composed of 86 places in 211 ms of which 3 ms to minimize.
[2024-05-28 17:05:06] [INFO ] Deduced a trap composed of 127 places in 177 ms of which 3 ms to minimize.
[2024-05-28 17:05:06] [INFO ] Deduced a trap composed of 151 places in 195 ms of which 4 ms to minimize.
[2024-05-28 17:05:06] [INFO ] Deduced a trap composed of 121 places in 182 ms of which 3 ms to minimize.
[2024-05-28 17:05:09] [INFO ] Deduced a trap composed of 241 places in 244 ms of which 3 ms to minimize.
[2024-05-28 17:05:10] [INFO ] Deduced a trap composed of 246 places in 217 ms of which 4 ms to minimize.
[2024-05-28 17:05:13] [INFO ] Deduced a trap composed of 277 places in 263 ms of which 3 ms to minimize.
[2024-05-28 17:05:15] [INFO ] Deduced a trap composed of 306 places in 255 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 17:05:26] [INFO ] Deduced a trap composed of 306 places in 274 ms of which 3 ms to minimize.
[2024-05-28 17:05:26] [INFO ] Deduced a trap composed of 272 places in 252 ms of which 4 ms to minimize.
[2024-05-28 17:05:33] [INFO ] Deduced a trap composed of 42 places in 281 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 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 4)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(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 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 20/20 constraints]
After SMT, in 40920ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40929ms
[2024-05-28 17:05:37] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 17:05:37] [INFO ] Invariant cache hit.
[2024-05-28 17:05:38] [INFO ] Implicit Places using invariants in 540 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 541 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41494 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p3) (NOT p2)), true, (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1019 steps with 3 reset in 10 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-14 finished in 41722 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((X(p1)&&p0))))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J06T06-LTLFireability-03
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 19 out of 529 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 529 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 481 transition count 920
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 96 place count 481 transition count 872
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 192 place count 433 transition count 872
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 195 place count 430 transition count 869
Iterating global reduction 2 with 3 rules applied. Total rules applied 198 place count 430 transition count 869
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 282 place count 388 transition count 827
Applied a total of 282 rules in 67 ms. Remains 388 /529 variables (removed 141) and now considering 827/968 (removed 141) transitions.
Running 825 sub problems to find dead transitions.
[2024-05-28 17:05:38] [INFO ] Flow matrix only has 815 transitions (discarded 12 similar events)
// Phase 1: matrix 815 rows 388 cols
[2024-05-28 17:05:38] [INFO ] Computed 43 invariants in 16 ms
[2024-05-28 17:05:38] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-28 17:05:44] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 4 ms to minimize.
[2024-05-28 17:05:45] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:05:48] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2024-05-28 17:05:48] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/388 variables, 10/47 constraints. Problems are: Problem set: 66 solved, 759 unsolved
[2024-05-28 17:05:58] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:05:58] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:05:58] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
[2024-05-28 17:05:59] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 0 ms to minimize.
[2024-05-28 17:05:59] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:05:59] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:05:59] [INFO ] Deduced a trap composed of 140 places in 203 ms of which 3 ms to minimize.
[2024-05-28 17:05:59] [INFO ] Deduced a trap composed of 139 places in 187 ms of which 3 ms to minimize.
[2024-05-28 17:05:59] [INFO ] Deduced a trap composed of 124 places in 208 ms of which 3 ms to minimize.
[2024-05-28 17:06:00] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 3 ms to minimize.
[2024-05-28 17:06:00] [INFO ] Deduced a trap composed of 156 places in 137 ms of which 2 ms to minimize.
SMT process timed out in 21382ms, After SMT, problems are : Problem set: 66 solved, 759 unsolved
Search for dead transitions found 66 dead transitions in 21395ms
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 17:06:00] [INFO ] Flow matrix only has 749 transitions (discarded 12 similar events)
// Phase 1: matrix 749 rows 388 cols
[2024-05-28 17:06:00] [INFO ] Computed 43 invariants in 17 ms
[2024-05-28 17:06:00] [INFO ] Implicit Places using invariants in 468 ms returned [223]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 471 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 387/529 places, 761/968 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 373 transition count 737
Applied a total of 12 rules in 14 ms. Remains 373 /387 variables (removed 14) and now considering 737/761 (removed 24) transitions.
[2024-05-28 17:06:00] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
// Phase 1: matrix 725 rows 373 cols
[2024-05-28 17:06:00] [INFO ] Computed 42 invariants in 17 ms
[2024-05-28 17:06:01] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-28 17:06:01] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-05-28 17:06:01] [INFO ] Invariant cache hit.
[2024-05-28 17:06:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:06:06] [INFO ] Implicit Places using invariants and state equation in 5052 ms returned []
Implicit Place search using SMT with State Equation took 5478 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 373/529 places, 737/968 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 27430 ms. Remains : 373/529 places, 737/968 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-03
Product exploration explored 100000 steps with 5723 reset in 500 ms.
Product exploration explored 100000 steps with 5745 reset in 431 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 319 steps (0 resets) in 8 ms. (35 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 310 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-28 17:06:08] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-05-28 17:06:08] [INFO ] Invariant cache hit.
[2024-05-28 17:06:08] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 17:06:08] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 51 ms returned sat
[2024-05-28 17:06:09] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2024-05-28 17:06:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:06:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 17:06:10] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 48 ms returned sat
[2024-05-28 17:06:10] [INFO ] [Nat]Absence check using state equation in 774 ms returned sat
[2024-05-28 17:06:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:06:11] [INFO ] [Nat]Added 72 Read/Feed constraints in 234 ms returned sat
[2024-05-28 17:06:11] [INFO ] Deduced a trap composed of 195 places in 216 ms of which 3 ms to minimize.
[2024-05-28 17:06:11] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 3 ms to minimize.
[2024-05-28 17:06:11] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 2 ms to minimize.
[2024-05-28 17:06:12] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 2 ms to minimize.
[2024-05-28 17:06:12] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 3 ms to minimize.
[2024-05-28 17:06:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1445 ms
[2024-05-28 17:06:12] [INFO ] Computed and/alt/rep : 465/2052/459 causal constraints (skipped 264 transitions) in 77 ms.
[2024-05-28 17:06:15] [INFO ] Added : 307 causal constraints over 62 iterations in 3322 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 19 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 737/737 transitions.
Applied a total of 0 rules in 4 ms. Remains 373 /373 variables (removed 0) and now considering 737/737 (removed 0) transitions.
Running 735 sub problems to find dead transitions.
[2024-05-28 17:06:15] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-05-28 17:06:15] [INFO ] Invariant cache hit.
[2024-05-28 17:06:15] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:06:21] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 1 ms to minimize.
[2024-05-28 17:06:21] [INFO ] Deduced a trap composed of 112 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:06:21] [INFO ] Deduced a trap composed of 123 places in 98 ms of which 1 ms to minimize.
[2024-05-28 17:06:21] [INFO ] Deduced a trap composed of 117 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:06:21] [INFO ] Deduced a trap composed of 112 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:06:22] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:06:23] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:06:23] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:06:24] [INFO ] Deduced a trap composed of 123 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:06:24] [INFO ] Deduced a trap composed of 123 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:06:24] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:06:25] [INFO ] Deduced a trap composed of 140 places in 117 ms of which 1 ms to minimize.
[2024-05-28 17:06:26] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:06:26] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:06:28] [INFO ] Deduced a trap composed of 112 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/1098 variables, and 48 constraints, problems are : Problem set: 0 solved, 735 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:06:39] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2024-05-28 17:06:39] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:06:39] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:06:39] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:06:39] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (OVERLAPS) 1/372 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:06:50] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:06:52] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:06:55] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1098 variables, and 57 constraints, problems are : Problem set: 0 solved, 735 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/735 constraints, Known Traps: 23/23 constraints]
After SMT, in 40912ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 40922ms
[2024-05-28 17:06:56] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-05-28 17:06:56] [INFO ] Invariant cache hit.
[2024-05-28 17:06:57] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-28 17:06:57] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-05-28 17:06:57] [INFO ] Invariant cache hit.
[2024-05-28 17:06:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:07:02] [INFO ] Implicit Places using invariants and state equation in 5210 ms returned []
Implicit Place search using SMT with State Equation took 5557 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2024-05-28 17:07:02] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-05-28 17:07:02] [INFO ] Invariant cache hit.
[2024-05-28 17:07:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:07:07] [INFO ] Deduced a trap composed of 122 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:07:07] [INFO ] Deduced a trap composed of 112 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:07:07] [INFO ] Deduced a trap composed of 123 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:07:07] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:07:07] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:07:08] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:07:09] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 2 ms to minimize.
[2024-05-28 17:07:09] [INFO ] Deduced a trap composed of 112 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:07:10] [INFO ] Deduced a trap composed of 123 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:07:10] [INFO ] Deduced a trap composed of 123 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:07:11] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 1 ms to minimize.
[2024-05-28 17:07:11] [INFO ] Deduced a trap composed of 140 places in 87 ms of which 1 ms to minimize.
[2024-05-28 17:07:12] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:07:12] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:07:15] [INFO ] Deduced a trap composed of 112 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (OVERLAPS) 1/372 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:07:28] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 7 ms to minimize.
[2024-05-28 17:07:28] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:07:28] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:07:28] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:07:29] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 2 ms to minimize.
[2024-05-28 17:07:29] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 1 ms to minimize.
[2024-05-28 17:07:30] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 2.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1098 variables, and 56 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:07:35] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:07:35] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:07:35] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:07:35] [INFO ] Deduced a trap composed of 48 places in 29 ms of which 0 ms to minimize.
[2024-05-28 17:07:35] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (OVERLAPS) 1/372 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:07:56] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:07:56] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-28 17:07:56] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:07:56] [INFO ] Deduced a trap composed of 119 places in 169 ms of which 2 ms to minimize.
[2024-05-28 17:07:56] [INFO ] Deduced a trap composed of 142 places in 148 ms of which 2 ms to minimize.
[2024-05-28 17:07:56] [INFO ] Deduced a trap composed of 171 places in 153 ms of which 3 ms to minimize.
[2024-05-28 17:07:57] [INFO ] Deduced a trap composed of 173 places in 200 ms of which 3 ms to minimize.
[2024-05-28 17:07:57] [INFO ] Deduced a trap composed of 84 places in 167 ms of which 2 ms to minimize.
[2024-05-28 17:07:58] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 2 ms to minimize.
[2024-05-28 17:07:58] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-28 17:07:58] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 3 ms to minimize.
[2024-05-28 17:07:58] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 3 ms to minimize.
[2024-05-28 17:07:59] [INFO ] Deduced a trap composed of 98 places in 188 ms of which 2 ms to minimize.
[2024-05-28 17:07:59] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 3 ms to minimize.
[2024-05-28 17:08:00] [INFO ] Deduced a trap composed of 134 places in 189 ms of which 3 ms to minimize.
[2024-05-28 17:08:00] [INFO ] Deduced a trap composed of 183 places in 162 ms of which 3 ms to minimize.
[2024-05-28 17:08:00] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 2 ms to minimize.
[2024-05-28 17:08:00] [INFO ] Deduced a trap composed of 121 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:08:00] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 3 ms to minimize.
[2024-05-28 17:08:01] [INFO ] Deduced a trap composed of 159 places in 210 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/1098 variables, and 89 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/735 constraints, Known Traps: 47/47 constraints]
After SMT, in 60918ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60930ms
Finished structural reductions in LTL mode , in 1 iterations and 107419 ms. Remains : 373/373 places, 737/737 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 p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 168 steps (0 resets) in 7 ms. (21 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 219 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-28 17:08:03] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-05-28 17:08:03] [INFO ] Invariant cache hit.
[2024-05-28 17:08:04] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 17:08:04] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 48 ms returned sat
[2024-05-28 17:08:05] [INFO ] [Real]Absence check using state equation in 1234 ms returned sat
[2024-05-28 17:08:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:08:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 17:08:05] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 48 ms returned sat
[2024-05-28 17:08:06] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2024-05-28 17:08:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:08:06] [INFO ] [Nat]Added 72 Read/Feed constraints in 129 ms returned sat
[2024-05-28 17:08:07] [INFO ] Deduced a trap composed of 195 places in 149 ms of which 2 ms to minimize.
[2024-05-28 17:08:07] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 2 ms to minimize.
[2024-05-28 17:08:07] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 2 ms to minimize.
[2024-05-28 17:08:07] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 3 ms to minimize.
[2024-05-28 17:08:07] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 3 ms to minimize.
[2024-05-28 17:08:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1153 ms
[2024-05-28 17:08:08] [INFO ] Computed and/alt/rep : 465/2052/459 causal constraints (skipped 264 transitions) in 54 ms.
[2024-05-28 17:08:11] [INFO ] Added : 307 causal constraints over 62 iterations in 3313 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5749 reset in 486 ms.
Product exploration explored 100000 steps with 5771 reset in 540 ms.
Built C files in :
/tmp/ltsmin8523351862843315484
[2024-05-28 17:08:12] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8523351862843315484
Running compilation step : cd /tmp/ltsmin8523351862843315484;'/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 1628 ms.
Running link step : cd /tmp/ltsmin8523351862843315484;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin8523351862843315484;'/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/stateBased11940563434707574735.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 19 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 737/737 transitions.
Applied a total of 0 rules in 2 ms. Remains 373 /373 variables (removed 0) and now considering 737/737 (removed 0) transitions.
Running 735 sub problems to find dead transitions.
[2024-05-28 17:08:27] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-05-28 17:08:27] [INFO ] Invariant cache hit.
[2024-05-28 17:08:27] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:08:32] [INFO ] Deduced a trap composed of 122 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:08:32] [INFO ] Deduced a trap composed of 112 places in 83 ms of which 1 ms to minimize.
[2024-05-28 17:08:32] [INFO ] Deduced a trap composed of 123 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:08:32] [INFO ] Deduced a trap composed of 117 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:08:32] [INFO ] Deduced a trap composed of 112 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:08:33] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:08:34] [INFO ] Deduced a trap composed of 123 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:08:34] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:08:34] [INFO ] Deduced a trap composed of 123 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:08:34] [INFO ] Deduced a trap composed of 123 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:08:35] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:08:35] [INFO ] Deduced a trap composed of 140 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:08:36] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:08:37] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:08:39] [INFO ] Deduced a trap composed of 112 places in 83 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/1098 variables, and 48 constraints, problems are : Problem set: 0 solved, 735 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:08:50] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 2 ms to minimize.
[2024-05-28 17:08:51] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 1 ms to minimize.
[2024-05-28 17:08:51] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:08:51] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-05-28 17:08:51] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (OVERLAPS) 1/372 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:09:05] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:09:06] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 9)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 1)
(s19 0)
(s20 1)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 1)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 1)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 2)
(s69 1)
(s70 1)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 1)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 1)
(s155 0)
(s156 0)
(s157 1)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 1)
(s173 1)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 1)
(s184 0)
(s185 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1098 variables, and 56 constraints, problems are : Problem set: 0 solved, 735 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/735 constraints, Known Traps: 22/22 constraints]
After SMT, in 40748ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 40754ms
[2024-05-28 17:09:08] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-05-28 17:09:08] [INFO ] Invariant cache hit.
[2024-05-28 17:09:08] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-28 17:09:08] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-05-28 17:09:08] [INFO ] Invariant cache hit.
[2024-05-28 17:09:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:09:13] [INFO ] Implicit Places using invariants and state equation in 5248 ms returned []
Implicit Place search using SMT with State Equation took 5533 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2024-05-28 17:09:13] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-05-28 17:09:13] [INFO ] Invariant cache hit.
[2024-05-28 17:09:13] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:09:19] [INFO ] Deduced a trap composed of 122 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:09:19] [INFO ] Deduced a trap composed of 112 places in 84 ms of which 1 ms to minimize.
[2024-05-28 17:09:19] [INFO ] Deduced a trap composed of 123 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:09:19] [INFO ] Deduced a trap composed of 117 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:09:19] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:09:20] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:09:21] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:09:21] [INFO ] Deduced a trap composed of 112 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:09:22] [INFO ] Deduced a trap composed of 123 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:09:22] [INFO ] Deduced a trap composed of 123 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:09:22] [INFO ] Deduced a trap composed of 123 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:09:23] [INFO ] Deduced a trap composed of 140 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:09:24] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:09:24] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:09:26] [INFO ] Deduced a trap composed of 112 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (OVERLAPS) 1/372 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:09:38] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:09:38] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:09:38] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:09:38] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:09:39] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:09:39] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:09:40] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1098 variables, and 56 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:09:47] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 3 ms to minimize.
[2024-05-28 17:09:47] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:09:47] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2024-05-28 17:09:47] [INFO ] Deduced a trap composed of 48 places in 28 ms of which 1 ms to minimize.
[2024-05-28 17:09:47] [INFO ] Deduced a trap composed of 49 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (OVERLAPS) 1/372 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-05-28 17:10:06] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:10:06] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:10:06] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:10:06] [INFO ] Deduced a trap composed of 119 places in 168 ms of which 3 ms to minimize.
[2024-05-28 17:10:06] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 2 ms to minimize.
[2024-05-28 17:10:06] [INFO ] Deduced a trap composed of 171 places in 153 ms of which 2 ms to minimize.
[2024-05-28 17:10:07] [INFO ] Deduced a trap composed of 173 places in 159 ms of which 2 ms to minimize.
[2024-05-28 17:10:07] [INFO ] Deduced a trap composed of 84 places in 205 ms of which 3 ms to minimize.
[2024-05-28 17:10:07] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 2 ms to minimize.
[2024-05-28 17:10:08] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 2 ms to minimize.
[2024-05-28 17:10:08] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 3 ms to minimize.
[2024-05-28 17:10:08] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 2 ms to minimize.
[2024-05-28 17:10:09] [INFO ] Deduced a trap composed of 98 places in 177 ms of which 2 ms to minimize.
[2024-05-28 17:10:09] [INFO ] Deduced a trap composed of 89 places in 164 ms of which 2 ms to minimize.
[2024-05-28 17:10:09] [INFO ] Deduced a trap composed of 134 places in 197 ms of which 3 ms to minimize.
[2024-05-28 17:10:10] [INFO ] Deduced a trap composed of 183 places in 159 ms of which 2 ms to minimize.
[2024-05-28 17:10:10] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 3 ms to minimize.
[2024-05-28 17:10:10] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 3 ms to minimize.
[2024-05-28 17:10:10] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 2 ms to minimize.
[2024-05-28 17:10:11] [INFO ] Deduced a trap composed of 159 places in 189 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/1098 variables, and 89 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/735 constraints, Known Traps: 47/47 constraints]
After SMT, in 60828ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60838ms
Finished structural reductions in LTL mode , in 1 iterations and 107131 ms. Remains : 373/373 places, 737/737 transitions.
Built C files in :
/tmp/ltsmin18173618571153472937
[2024-05-28 17:10:14] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18173618571153472937
Running compilation step : cd /tmp/ltsmin18173618571153472937;'/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 1293 ms.
Running link step : cd /tmp/ltsmin18173618571153472937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin18173618571153472937;'/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/stateBased3753111592767228867.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 17:10:29] [INFO ] Flatten gal took : 30 ms
[2024-05-28 17:10:29] [INFO ] Flatten gal took : 27 ms
[2024-05-28 17:10:29] [INFO ] Time to serialize gal into /tmp/LTL9535350387996201429.gal : 7 ms
[2024-05-28 17:10:29] [INFO ] Time to serialize properties into /tmp/LTL5870941970955033928.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/LTL9535350387996201429.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13217712479143699711.hoa' '-atoms' '/tmp/LTL5870941970955033928.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/LTL5870941970955033928.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13217712479143699711.hoa
Detected timeout of ITS tools.
[2024-05-28 17:10:45] [INFO ] Flatten gal took : 28 ms
[2024-05-28 17:10:45] [INFO ] Flatten gal took : 27 ms
[2024-05-28 17:10:45] [INFO ] Time to serialize gal into /tmp/LTL9978144642193919615.gal : 7 ms
[2024-05-28 17:10:45] [INFO ] Time to serialize properties into /tmp/LTL18238787303413132588.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/LTL9978144642193919615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18238787303413132588.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 : !((G(F(((((X("((((Try_Check_Sources_E_5>=1)||(Try_Check_Sources_E_4>=1))||((Try_Check_Sources_E_6>=1)||(Try_Check_Sources_E_2>=1)))||(...817
Formula 0 simplified : FG(!"(((((cBlockedTasks<10)||(DisablePollingB_2_1<1))&&((cBlockedTasks<10)||(DisablePollingB_1_1<1)))&&(((cBlockedTasks<10)||(Disabl...803
Detected timeout of ITS tools.
[2024-05-28 17:11:00] [INFO ] Flatten gal took : 26 ms
[2024-05-28 17:11:00] [INFO ] Applying decomposition
[2024-05-28 17:11:00] [INFO ] Flatten gal took : 25 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/graph6674707588892204659.txt' '-o' '/tmp/graph6674707588892204659.bin' '-w' '/tmp/graph6674707588892204659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6674707588892204659.bin' '-l' '-1' '-v' '-w' '/tmp/graph6674707588892204659.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:11:00] [INFO ] Decomposing Gal with order
[2024-05-28 17:11:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:11:00] [INFO ] Removed a total of 603 redundant transitions.
[2024-05-28 17:11:00] [INFO ] Flatten gal took : 74 ms
[2024-05-28 17:11:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 439 labels/synchronizations in 17 ms.
[2024-05-28 17:11:00] [INFO ] Time to serialize gal into /tmp/LTL12906732026546342966.gal : 6 ms
[2024-05-28 17:11:00] [INFO ] Time to serialize properties into /tmp/LTL11544329763960639583.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/LTL12906732026546342966.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11544329763960639583.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 : !((G(F(((((X("((((i0.i3.u10.Try_Check_Sources_E_5>=1)||(i0.i0.u14.Try_Check_Sources_E_4>=1))||((i0.i0.u18.Try_Check_Sources_E_6>=1)||(...1071
Formula 0 simplified : FG(!"(((((i0.i0.u0.cBlockedTasks<10)||(i5.u20.DisablePollingB_2_1<1))&&((i0.i0.u0.cBlockedTasks<10)||(i3.u24.DisablePollingB_1_1<1))...1057
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-03 finished in 336950 ms.
[2024-05-28 17:11:15] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12560915215385364495
[2024-05-28 17:11:15] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2024-05-28 17:11:15] [INFO ] Applying decomposition
[2024-05-28 17:11:15] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:11:15] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2024-05-28 17:11:15] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:11:15] [INFO ] Flatten gal took : 35 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/graph15961283563852830812.txt' '-o' '/tmp/graph15961283563852830812.bin' '-w' '/tmp/graph15961283563852830812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15961283563852830812.bin' '-l' '-1' '-v' '-w' '/tmp/graph15961283563852830812.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:11:15] [INFO ] Decomposing Gal with order
[2024-05-28 17:11:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:11:15] [INFO ] Removed a total of 838 redundant transitions.
[2024-05-28 17:11:15] [INFO ] Flatten gal took : 51 ms
[2024-05-28 17:11:15] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2024-05-28 17:11:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2024-05-28 17:11:15] [INFO ] Time to serialize gal into /tmp/LTLFireability16393777966834481342.gal : 6 ms
[2024-05-28 17:11:15] [INFO ] Time to serialize properties into /tmp/LTLFireability6955116938825733523.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/LTLFireability16393777966834481342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6955116938825733523.ltl' '-c' '-stutter-deadlock'
[2024-05-28 17:11:15] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)

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
[2024-05-28 17:11:15] [INFO ] Built C files in 326ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12560915215385364495
Running compilation step : cd /tmp/ltsmin12560915215385364495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
Checking formula 0 : !((G(F(("(((((i0.i0.u1.cBlockedTasks<10)||(i6.u53.DisablePollingB_6_2<1))&&((i0.i0.u1.cBlockedTasks<10)||(i2.u61.DisablePollingB_3_2<1...1061
Formula 0 simplified : FG(!"(((((i0.i0.u1.cBlockedTasks<10)||(i6.u53.DisablePollingB_6_2<1))&&((i0.i0.u1.cBlockedTasks<10)||(i2.u61.DisablePollingB_3_2<1))...1051
Compilation finished in 3152 ms.
Running link step : cd /tmp/ltsmin12560915215385364495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin12560915215385364495;'/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((LTLAPp1==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 606324 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2065065 ms.

BK_STOP 1716916885691

--------------------
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-S02J06T06"
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-S02J06T06, 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-171654446700244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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