Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 34K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Apr 11 17:07 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 14K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K Apr 11 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.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 1.1M 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-S02J06T10-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717253348174

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:49:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:49:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:49:10] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2024-06-01 14:49:10] [INFO ] Transformed 844 places.
[2024-06-01 14:49:10] [INFO ] Transformed 1812 transitions.
[2024-06-01 14:49:10] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 282 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 843 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 833 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 833 transition count 1642
Applied a total of 21 rules in 227 ms. Remains 833 /844 variables (removed 11) and now considering 1642/1652 (removed 10) transitions.
Running 1640 sub problems to find dead transitions.
[2024-06-01 14:49:11] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 833 cols
[2024-06-01 14:49:11] [INFO ] Computed 57 invariants in 157 ms
[2024-06-01 14:49:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/830 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 23 places in 376 ms of which 31 ms to minimize.
SMT process timed out in 23914ms, After SMT, problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 24002ms
[2024-06-01 14:49:35] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
[2024-06-01 14:49:35] [INFO ] Invariant cache hit.
[2024-06-01 14:49:36] [INFO ] Implicit Places using invariants in 1113 ms returned [105, 204, 255, 454, 530, 573, 576, 633, 787, 830]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1125 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 823/844 places, 1642/1652 transitions.
Applied a total of 0 rules in 20 ms. Remains 823 /823 variables (removed 0) and now considering 1642/1642 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25485 ms. Remains : 823/844 places, 1642/1652 transitions.
Support contains 282 out of 823 places after structural reductions.
[2024-06-01 14:49:36] [INFO ] Flatten gal took : 174 ms
[2024-06-01 14:49:36] [INFO ] Flatten gal took : 114 ms
[2024-06-01 14:49:37] [INFO ] Input system was already deterministic with 1642 transitions.
Support contains 263 out of 823 places (down from 282) after GAL structural reductions.
RANDOM walk for 40001 steps (10 resets) in 2820 ms. (14 steps per ms) remains 8/23 properties
BEST_FIRST walk for 40000 steps (10 resets) in 544 ms. (73 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 396 ms. (100 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 233 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (11 resets) in 438 ms. (91 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 232 ms. (171 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 437 ms. (91 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 231 ms. (172 steps per ms) remains 8/8 properties
[2024-06-01 14:49:39] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 823 cols
[2024-06-01 14:49:39] [INFO ] Computed 47 invariants in 49 ms
[2024-06-01 14:49:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 236/271 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 15/286 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 5 (OVERLAPS) 508/794 variables, 22/32 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/32 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/798 variables, 4/36 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 0/36 constraints. Problems are: Problem set: 6 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 9 (OVERLAPS) 23/821 variables, 10/46 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-06-01 14:49:40] [INFO ] Deduced a trap composed of 73 places in 306 ms of which 5 ms to minimize.
[2024-06-01 14:49:40] [INFO ] Deduced a trap composed of 73 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:49:40] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:49:40] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:49:41] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:49:41] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-06-01 14:49:41] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:49:41] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/821 variables, 8/54 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/821 variables, 0/54 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2443/2445 variables, and 875 constraints, problems are : Problem set: 7 solved, 1 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 821/823 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/398 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 134/532 variables, 9/13 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/536 variables, 2/15 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 282/818 variables, 28/43 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/818 variables, 8/51 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-06-01 14:49:45] [INFO ] Deduced a trap composed of 73 places in 423 ms of which 5 ms to minimize.
[2024-06-01 14:49:45] [INFO ] Deduced a trap composed of 416 places in 393 ms of which 4 ms to minimize.
[2024-06-01 14:49:45] [INFO ] Deduced a trap composed of 419 places in 387 ms of which 7 ms to minimize.
[2024-06-01 14:49:45] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 4/55 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 0/55 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/821 variables, 3/58 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/821 variables, 0/58 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2443/2445 variables, and 879 constraints, problems are : Problem set: 7 solved, 1 unsolved in 4331 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 821/823 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 12/12 constraints]
After SMT, in 9464ms problems are : Problem set: 7 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 823 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 823/823 places, 1642/1642 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 822 transition count 1572
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 752 transition count 1572
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 141 place count 752 transition count 1472
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 341 place count 652 transition count 1472
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 521 place count 562 transition count 1382
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 530 place count 553 transition count 1373
Iterating global reduction 2 with 9 rules applied. Total rules applied 539 place count 553 transition count 1373
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 559 place count 553 transition count 1353
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 579 place count 533 transition count 1353
Applied a total of 579 rules in 225 ms. Remains 533 /823 variables (removed 290) and now considering 1353/1642 (removed 289) transitions.
Running 1351 sub problems to find dead transitions.
[2024-06-01 14:49:48] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
// Phase 1: matrix 1333 rows 533 cols
[2024-06-01 14:49:48] [INFO ] Computed 46 invariants in 42 ms
[2024-06-01 14:49:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 14:50:02] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:50:02] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:50:02] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:50:02] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:50:04] [INFO ] Deduced a trap composed of 52 places in 324 ms of which 4 ms to minimize.
[2024-06-01 14:50:04] [INFO ] Deduced a trap composed of 81 places in 313 ms of which 4 ms to minimize.
[2024-06-01 14:50:06] [INFO ] Deduced a trap composed of 186 places in 326 ms of which 4 ms to minimize.
[2024-06-01 14:50:07] [INFO ] Deduced a trap composed of 332 places in 260 ms of which 3 ms to minimize.
[2024-06-01 14:50:08] [INFO ] Deduced a trap composed of 199 places in 326 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 60 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 14:50:24] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:50:25] [INFO ] Deduced a trap composed of 230 places in 363 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 62 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 18/18 constraints]
After SMT, in 43911ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 43925ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44155 ms. Remains : 533/823 places, 1353/1642 transitions.
RANDOM walk for 40000 steps (15 resets) in 453 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (10 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 121522 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 1
Probabilistic random walk after 121522 steps, saw 80991 distinct states, run finished after 3006 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 14:50:36] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 14:50:36] [INFO ] Invariant cache hit.
[2024-06-01 14:50:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:50:36] [INFO ] Deduced a trap composed of 44 places in 335 ms of which 4 ms to minimize.
[2024-06-01 14:50:36] [INFO ] Deduced a trap composed of 44 places in 351 ms of which 4 ms to minimize.
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 44 places in 327 ms of which 4 ms to minimize.
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 44 places in 319 ms of which 5 ms to minimize.
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 3 ms to minimize.
[2024-06-01 14:50:38] [INFO ] Deduced a trap composed of 44 places in 381 ms of which 4 ms to minimize.
[2024-06-01 14:50:38] [INFO ] Deduced a trap composed of 44 places in 322 ms of which 4 ms to minimize.
[2024-06-01 14:50:38] [INFO ] Deduced a trap composed of 44 places in 276 ms of which 3 ms to minimize.
[2024-06-01 14:50:39] [INFO ] Deduced a trap composed of 226 places in 345 ms of which 3 ms to minimize.
[2024-06-01 14:50:39] [INFO ] Deduced a trap composed of 209 places in 267 ms of which 2 ms to minimize.
[2024-06-01 14:50:39] [INFO ] Deduced a trap composed of 226 places in 335 ms of which 4 ms to minimize.
[2024-06-01 14:50:40] [INFO ] Deduced a trap composed of 44 places in 309 ms of which 4 ms to minimize.
[2024-06-01 14:50:40] [INFO ] Deduced a trap composed of 221 places in 329 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1333/1864 variables, 531/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 120/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1866 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1866 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1866 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 712 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7707 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:50:44] [INFO ] Deduced a trap composed of 226 places in 434 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1333/1864 variables, 531/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 120/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1866 variables, 2/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1866 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1866 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1866 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1866/1866 variables, and 714 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4076 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 11802ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 114 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 89 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-06-01 14:50:48] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 14:50:48] [INFO ] Invariant cache hit.
[2024-06-01 14:50:49] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-06-01 14:50:49] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 14:50:49] [INFO ] Invariant cache hit.
[2024-06-01 14:50:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:51:07] [INFO ] Implicit Places using invariants and state equation in 18282 ms returned []
Implicit Place search using SMT with State Equation took 19168 ms to find 0 implicit places.
[2024-06-01 14:51:07] [INFO ] Redundant transitions in 85 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-06-01 14:51:07] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 14:51:07] [INFO ] Invariant cache hit.
[2024-06-01 14:51:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 14:51:21] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-06-01 14:51:21] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:51:21] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 2 ms to minimize.
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 0 ms to minimize.
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 182 places in 346 ms of which 3 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 47 places in 473 ms of which 7 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 85 places in 334 ms of which 4 ms to minimize.
[2024-06-01 14:51:24] [INFO ] Deduced a trap composed of 81 places in 314 ms of which 3 ms to minimize.
[2024-06-01 14:51:24] [INFO ] Deduced a trap composed of 78 places in 435 ms of which 7 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 196 places in 462 ms of which 4 ms to minimize.
[2024-06-01 14:51:26] [INFO ] Deduced a trap composed of 334 places in 397 ms of which 3 ms to minimize.
[2024-06-01 14:51:26] [INFO ] Deduced a trap composed of 334 places in 511 ms of which 4 ms to minimize.
[2024-06-01 14:51:27] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-06-01 14:51:29] [INFO ] Deduced a trap composed of 348 places in 362 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 14:51:30] [INFO ] Deduced a trap composed of 98 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:51:30] [INFO ] Deduced a trap composed of 203 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:51:31] [INFO ] Deduced a trap composed of 335 places in 330 ms of which 4 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 227 places in 353 ms of which 4 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 3 places in 383 ms of which 4 ms to minimize.
SMT process timed out in 33393ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 33409ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52789 ms. Remains : 533/533 places, 1353/1353 transitions.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!(p0 U p1))||G(p0))))'
Support contains 30 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 1642/1642 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 822 transition count 1572
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 752 transition count 1572
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 752 transition count 1472
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 652 transition count 1472
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 460 place count 592 transition count 1412
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 469 place count 583 transition count 1403
Iterating global reduction 2 with 9 rules applied. Total rules applied 478 place count 583 transition count 1403
Applied a total of 478 rules in 100 ms. Remains 583 /823 variables (removed 240) and now considering 1403/1642 (removed 239) transitions.
Running 1401 sub problems to find dead transitions.
[2024-06-01 14:51:41] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
// Phase 1: matrix 1383 rows 583 cols
[2024-06-01 14:51:41] [INFO ] Computed 46 invariants in 41 ms
[2024-06-01 14:51:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 3 ms to minimize.
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 227 places in 386 ms of which 5 ms to minimize.
[2024-06-01 14:51:57] [INFO ] Deduced a trap composed of 246 places in 396 ms of which 5 ms to minimize.
[2024-06-01 14:51:57] [INFO ] Deduced a trap composed of 49 places in 366 ms of which 5 ms to minimize.
[2024-06-01 14:51:57] [INFO ] Deduced a trap composed of 50 places in 408 ms of which 4 ms to minimize.
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 240 places in 385 ms of which 4 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 387 places in 409 ms of which 4 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 226 places in 390 ms of which 5 ms to minimize.
[2024-06-01 14:52:00] [INFO ] Deduced a trap composed of 78 places in 423 ms of which 4 ms to minimize.
[2024-06-01 14:52:01] [INFO ] Deduced a trap composed of 119 places in 313 ms of which 3 ms to minimize.
[2024-06-01 14:52:02] [INFO ] Deduced a trap composed of 23 places in 336 ms of which 3 ms to minimize.
[2024-06-01 14:52:03] [INFO ] Deduced a trap composed of 79 places in 355 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1966 variables, and 64 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 14:52:21] [INFO ] Deduced a trap composed of 228 places in 441 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/1966 variables, and 65 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 21/21 constraints]
After SMT, in 42617ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 42631ms
[2024-06-01 14:52:23] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-06-01 14:52:23] [INFO ] Invariant cache hit.
[2024-06-01 14:52:24] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-06-01 14:52:24] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-06-01 14:52:24] [INFO ] Invariant cache hit.
[2024-06-01 14:52:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:52:36] [INFO ] Implicit Places using invariants and state equation in 12387 ms returned []
Implicit Place search using SMT with State Equation took 13080 ms to find 0 implicit places.
[2024-06-01 14:52:36] [INFO ] Redundant transitions in 23 ms returned []
Running 1401 sub problems to find dead transitions.
[2024-06-01 14:52:37] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-06-01 14:52:37] [INFO ] Invariant cache hit.
[2024-06-01 14:52:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 49 places in 311 ms of which 2 ms to minimize.
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:52:53] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 5 ms to minimize.
[2024-06-01 14:52:53] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:52:53] [INFO ] Deduced a trap composed of 283 places in 415 ms of which 4 ms to minimize.
[2024-06-01 14:52:54] [INFO ] Deduced a trap composed of 238 places in 438 ms of which 4 ms to minimize.
[2024-06-01 14:52:54] [INFO ] Deduced a trap composed of 217 places in 371 ms of which 4 ms to minimize.
[2024-06-01 14:52:54] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:52:55] [INFO ] Deduced a trap composed of 117 places in 396 ms of which 5 ms to minimize.
[2024-06-01 14:52:56] [INFO ] Deduced a trap composed of 284 places in 370 ms of which 5 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 218 places in 509 ms of which 4 ms to minimize.
[2024-06-01 14:52:58] [INFO ] Deduced a trap composed of 72 places in 410 ms of which 4 ms to minimize.
[2024-06-01 14:52:59] [INFO ] Deduced a trap composed of 71 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:53:05] [INFO ] Deduced a trap composed of 382 places in 423 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1966 variables, and 64 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/1966 variables, and 64 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 20/20 constraints]
After SMT, in 63262ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 63292ms
Starting structural reductions in SI_LTL mode, iteration 1 : 583/823 places, 1403/1642 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119173 ms. Remains : 583/823 places, 1403/1642 transitions.
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p0) p1), p1]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-01
Product exploration explored 100000 steps with 34 reset in 734 ms.
Product exploration explored 100000 steps with 24 reset in 543 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 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 158 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (13 resets) in 647 ms. (61 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 381 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 425 ms. (93 steps per ms) remains 2/2 properties
[2024-06-01 14:53:42] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-06-01 14:53:42] [INFO ] Invariant cache hit.
[2024-06-01 14:53:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 438/513 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/535 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 45/580 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/581 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1383/1964 variables, 581/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1964 variables, 120/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1964 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1966 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1966 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1966 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1966 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1966/1966 variables, and 749 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1270 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 583/583 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 438/513 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/535 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 45/580 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 4 ms to minimize.
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 3 ms to minimize.
[2024-06-01 14:53:45] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 6 ms to minimize.
[2024-06-01 14:53:45] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:53:45] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:53:45] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:53:45] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/581 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1383/1964 variables, 581/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1964/1966 variables, and 754 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3559 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 581/583 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 4845ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 166 ms.
Support contains 30 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1403/1403 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 583 transition count 1383
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 563 transition count 1383
Applied a total of 40 rules in 79 ms. Remains 563 /583 variables (removed 20) and now considering 1383/1403 (removed 20) transitions.
Running 1381 sub problems to find dead transitions.
[2024-06-01 14:53:47] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
// Phase 1: matrix 1363 rows 563 cols
[2024-06-01 14:53:48] [INFO ] Computed 46 invariants in 33 ms
[2024-06-01 14:53:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 23 places in 303 ms of which 6 ms to minimize.
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:54:04] [INFO ] Deduced a trap composed of 47 places in 392 ms of which 4 ms to minimize.
[2024-06-01 14:54:04] [INFO ] Deduced a trap composed of 226 places in 382 ms of which 4 ms to minimize.
[2024-06-01 14:54:04] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:54:04] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:54:05] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:54:05] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:54:05] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:54:06] [INFO ] Deduced a trap composed of 113 places in 443 ms of which 4 ms to minimize.
[2024-06-01 14:54:07] [INFO ] Deduced a trap composed of 214 places in 417 ms of which 4 ms to minimize.
[2024-06-01 14:54:07] [INFO ] Deduced a trap composed of 218 places in 392 ms of which 4 ms to minimize.
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 228 places in 411 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 60 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 14:54:30] [INFO ] Deduced a trap composed of 85 places in 404 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 61 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 17/17 constraints]
After SMT, in 43375ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 43388ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43471 ms. Remains : 563/583 places, 1383/1403 transitions.
RANDOM walk for 40001 steps (13 resets) in 581 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 361 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 294 ms. (135 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 87465 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 2
Probabilistic random walk after 87465 steps, saw 53499 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
[2024-06-01 14:54:34] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 14:54:34] [INFO ] Invariant cache hit.
[2024-06-01 14:54:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 379/409 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/431 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/436 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 119/555 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:54:35] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 4 ms to minimize.
[2024-06-01 14:54:35] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:54:35] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 3 ms to minimize.
[2024-06-01 14:54:35] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:54:35] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:54:36] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:54:36] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 3 ms to minimize.
[2024-06-01 14:54:36] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/560 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/561 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1363/1924 variables, 561/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1924 variables, 120/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1924 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1926 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1926 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1926 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1926 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1926/1926 variables, and 737 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3592 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 563/563 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 379/409 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/431 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/436 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 119/555 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:54:38] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/560 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/561 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1363/1924 variables, 561/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1924 variables, 120/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1924 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:54:42] [INFO ] Deduced a trap composed of 234 places in 398 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1924 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1924 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1926 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1926 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1926 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1926 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1926/1926 variables, and 741 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4637 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 563/563 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 8270ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 219 ms.
Support contains 30 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 1383/1383 transitions.
Applied a total of 0 rules in 72 ms. Remains 563 /563 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 563/563 places, 1383/1383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 1383/1383 transitions.
Applied a total of 0 rules in 71 ms. Remains 563 /563 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-06-01 14:54:43] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 14:54:43] [INFO ] Invariant cache hit.
[2024-06-01 14:54:44] [INFO ] Implicit Places using invariants in 1284 ms returned []
[2024-06-01 14:54:44] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 14:54:44] [INFO ] Invariant cache hit.
[2024-06-01 14:54:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:55:00] [INFO ] Implicit Places using invariants and state equation in 15848 ms returned []
Implicit Place search using SMT with State Equation took 17139 ms to find 0 implicit places.
[2024-06-01 14:55:00] [INFO ] Redundant transitions in 89 ms returned []
Running 1381 sub problems to find dead transitions.
[2024-06-01 14:55:00] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 14:55:00] [INFO ] Invariant cache hit.
[2024-06-01 14:55:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 14:55:15] [INFO ] Deduced a trap composed of 47 places in 302 ms of which 5 ms to minimize.
[2024-06-01 14:55:15] [INFO ] Deduced a trap composed of 48 places in 289 ms of which 5 ms to minimize.
[2024-06-01 14:55:16] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:55:16] [INFO ] Deduced a trap composed of 48 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:55:16] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:55:16] [INFO ] Deduced a trap composed of 109 places in 275 ms of which 4 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 5 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 2 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:55:18] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:55:18] [INFO ] Deduced a trap composed of 273 places in 397 ms of which 4 ms to minimize.
[2024-06-01 14:55:19] [INFO ] Deduced a trap composed of 109 places in 372 ms of which 5 ms to minimize.
[2024-06-01 14:55:20] [INFO ] Deduced a trap composed of 220 places in 433 ms of which 6 ms to minimize.
[2024-06-01 14:55:22] [INFO ] Deduced a trap composed of 353 places in 413 ms of which 5 ms to minimize.
[2024-06-01 14:55:24] [INFO ] Deduced a trap composed of 207 places in 312 ms of which 3 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 242 places in 430 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 64 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 14:55:44] [INFO ] Deduced a trap composed of 207 places in 506 ms of which 4 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 2 ms to minimize.
[2024-06-01 14:55:54] [INFO ] Deduced a trap composed of 82 places in 607 ms of which 19 ms to minimize.
[2024-06-01 14:55:58] [INFO ] Deduced a trap composed of 251 places in 340 ms of which 4 ms to minimize.
[2024-06-01 14:55:58] [INFO ] Deduced a trap composed of 221 places in 455 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 70 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 26/26 constraints]
After SMT, in 63683ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 63715ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81059 ms. Remains : 563/563 places, 1383/1383 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1), p1]
Support contains 30 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1403/1403 transitions.
Applied a total of 0 rules in 26 ms. Remains 583 /583 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-06-01 14:56:04] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
// Phase 1: matrix 1383 rows 583 cols
[2024-06-01 14:56:04] [INFO ] Computed 46 invariants in 45 ms
[2024-06-01 14:56:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 14:56:21] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:56:21] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:56:21] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 1 ms to minimize.
[2024-06-01 14:56:21] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:56:21] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 227 places in 393 ms of which 4 ms to minimize.
[2024-06-01 14:56:23] [INFO ] Deduced a trap composed of 246 places in 358 ms of which 4 ms to minimize.
[2024-06-01 14:56:23] [INFO ] Deduced a trap composed of 49 places in 393 ms of which 4 ms to minimize.
[2024-06-01 14:56:23] [INFO ] Deduced a trap composed of 50 places in 346 ms of which 4 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 240 places in 368 ms of which 4 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 387 places in 319 ms of which 3 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 226 places in 319 ms of which 3 ms to minimize.
[2024-06-01 14:56:26] [INFO ] Deduced a trap composed of 78 places in 437 ms of which 4 ms to minimize.
[2024-06-01 14:56:26] [INFO ] Deduced a trap composed of 119 places in 359 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1966 variables, and 62 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 14:56:47] [INFO ] Deduced a trap composed of 68 places in 217 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/1966 variables, and 63 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 19/19 constraints]
After SMT, in 43211ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 43229ms
[2024-06-01 14:56:48] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-06-01 14:56:48] [INFO ] Invariant cache hit.
[2024-06-01 14:56:49] [INFO ] Implicit Places using invariants in 1278 ms returned []
[2024-06-01 14:56:49] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-06-01 14:56:49] [INFO ] Invariant cache hit.
[2024-06-01 14:56:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:57:03] [INFO ] Implicit Places using invariants and state equation in 13745 ms returned []
Implicit Place search using SMT with State Equation took 15027 ms to find 0 implicit places.
[2024-06-01 14:57:03] [INFO ] Redundant transitions in 35 ms returned []
Running 1401 sub problems to find dead transitions.
[2024-06-01 14:57:03] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-06-01 14:57:03] [INFO ] Invariant cache hit.
[2024-06-01 14:57:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 14:57:17] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:57:17] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:57:17] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:57:17] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:57:17] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:57:17] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:57:17] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:57:18] [INFO ] Deduced a trap composed of 49 places in 246 ms of which 4 ms to minimize.
[2024-06-01 14:57:18] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 2 ms to minimize.
[2024-06-01 14:57:18] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:57:19] [INFO ] Deduced a trap composed of 283 places in 318 ms of which 3 ms to minimize.
[2024-06-01 14:57:19] [INFO ] Deduced a trap composed of 238 places in 524 ms of which 18 ms to minimize.
[2024-06-01 14:57:20] [INFO ] Deduced a trap composed of 217 places in 511 ms of which 32 ms to minimize.
[2024-06-01 14:57:20] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:57:22] [INFO ] Deduced a trap composed of 117 places in 437 ms of which 4 ms to minimize.
[2024-06-01 14:57:23] [INFO ] Deduced a trap composed of 284 places in 425 ms of which 4 ms to minimize.
[2024-06-01 14:57:24] [INFO ] Deduced a trap composed of 218 places in 384 ms of which 4 ms to minimize.
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 72 places in 447 ms of which 6 ms to minimize.
[2024-06-01 14:57:30] [INFO ] Deduced a trap composed of 71 places in 337 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1966 variables, and 63 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 14:58:05] [INFO ] Deduced a trap composed of 383 places in 632 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/1966 variables, and 64 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 20/20 constraints]
After SMT, in 62627ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 62638ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 120983 ms. Remains : 583/583 places, 1403/1403 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 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 182 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (13 resets) in 632 ms. (63 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (13 resets) in 293 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 287 ms. (138 steps per ms) remains 2/2 properties
[2024-06-01 14:58:06] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-06-01 14:58:06] [INFO ] Invariant cache hit.
[2024-06-01 14:58:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 438/513 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/535 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 45/580 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/581 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1383/1964 variables, 581/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1964 variables, 120/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1964 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1966 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1966 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1966 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1966 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1966/1966 variables, and 749 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1540 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 583/583 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 438/513 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/535 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 45/580 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:58:08] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 4 ms to minimize.
[2024-06-01 14:58:08] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:58:09] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 3 ms to minimize.
[2024-06-01 14:58:09] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 3 ms to minimize.
[2024-06-01 14:58:09] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:58:09] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:58:09] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:58:09] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/581 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1383/1964 variables, 581/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1964 variables, 120/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1964 variables, 2/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1964 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1966 variables, 2/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1966 variables, 1/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:58:11] [INFO ] Deduced a trap composed of 273 places in 706 ms of which 33 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1966 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1966 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1966 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1966/1966 variables, and 760 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4303 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 583/583 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 5877ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 30 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1403/1403 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 583 transition count 1383
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 563 transition count 1383
Applied a total of 40 rules in 55 ms. Remains 563 /583 variables (removed 20) and now considering 1383/1403 (removed 20) transitions.
Running 1381 sub problems to find dead transitions.
[2024-06-01 14:58:12] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
// Phase 1: matrix 1363 rows 563 cols
[2024-06-01 14:58:12] [INFO ] Computed 46 invariants in 40 ms
[2024-06-01 14:58:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 14:58:27] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:58:28] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:58:28] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:58:28] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:58:28] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:58:28] [INFO ] Deduced a trap composed of 47 places in 326 ms of which 3 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 226 places in 360 ms of which 4 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 3 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 113 places in 366 ms of which 4 ms to minimize.
[2024-06-01 14:58:32] [INFO ] Deduced a trap composed of 214 places in 354 ms of which 4 ms to minimize.
[2024-06-01 14:58:33] [INFO ] Deduced a trap composed of 218 places in 357 ms of which 6 ms to minimize.
[2024-06-01 14:58:33] [INFO ] Deduced a trap composed of 228 places in 374 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 60 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 14:58:48] [INFO ] Deduced a trap composed of 85 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:58:50] [INFO ] Deduced a trap composed of 378 places in 329 ms of which 4 ms to minimize.
[2024-06-01 14:58:56] [INFO ] Deduced a trap composed of 120 places in 273 ms of which 2 ms to minimize.
SMT process timed out in 43425ms, After SMT, problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 43440ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43500 ms. Remains : 563/583 places, 1383/1403 transitions.
RANDOM walk for 40000 steps (24 resets) in 755 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 345 ms. (115 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (9 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 102459 steps, run timeout after 3012 ms. (steps per millisecond=34 ) properties seen :0 out of 2
Probabilistic random walk after 102459 steps, saw 62626 distinct states, run finished after 3013 ms. (steps per millisecond=34 ) properties seen :0
[2024-06-01 14:58:59] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 14:58:59] [INFO ] Invariant cache hit.
[2024-06-01 14:58:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 379/409 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/431 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/436 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 119/555 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:59:00] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:59:00] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 2 ms to minimize.
[2024-06-01 14:59:00] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:59:00] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:59:00] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:59:01] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 1 ms to minimize.
[2024-06-01 14:59:01] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 1 ms to minimize.
[2024-06-01 14:59:01] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/560 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/561 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1363/1924 variables, 561/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1924 variables, 120/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1924 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1926 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1926 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1926 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1926 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1926/1926 variables, and 737 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4304 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 563/563 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 379/409 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/431 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/436 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 119/555 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/560 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/561 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1363/1924 variables, 561/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1924 variables, 120/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1924 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:59:07] [INFO ] Deduced a trap composed of 234 places in 657 ms of which 19 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1924 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1924 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1926 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1926 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1926 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1926 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1926/1926 variables, and 741 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4925 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 563/563 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 9258ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 174 ms.
Support contains 30 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 1383/1383 transitions.
Applied a total of 0 rules in 45 ms. Remains 563 /563 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 563/563 places, 1383/1383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 1383/1383 transitions.
Applied a total of 0 rules in 54 ms. Remains 563 /563 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-06-01 14:59:09] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 14:59:09] [INFO ] Invariant cache hit.
[2024-06-01 14:59:10] [INFO ] Implicit Places using invariants in 908 ms returned []
[2024-06-01 14:59:10] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 14:59:10] [INFO ] Invariant cache hit.
[2024-06-01 14:59:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:59:27] [INFO ] Implicit Places using invariants and state equation in 17815 ms returned []
Implicit Place search using SMT with State Equation took 18741 ms to find 0 implicit places.
[2024-06-01 14:59:27] [INFO ] Redundant transitions in 57 ms returned []
Running 1381 sub problems to find dead transitions.
[2024-06-01 14:59:27] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 14:59:27] [INFO ] Invariant cache hit.
[2024-06-01 14:59:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 14:59:42] [INFO ] Deduced a trap composed of 47 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:59:42] [INFO ] Deduced a trap composed of 48 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:59:43] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:59:43] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:59:43] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 3 ms to minimize.
[2024-06-01 14:59:43] [INFO ] Deduced a trap composed of 109 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:59:43] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 3 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:59:45] [INFO ] Deduced a trap composed of 273 places in 295 ms of which 3 ms to minimize.
[2024-06-01 14:59:47] [INFO ] Deduced a trap composed of 109 places in 390 ms of which 3 ms to minimize.
[2024-06-01 14:59:48] [INFO ] Deduced a trap composed of 220 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:59:50] [INFO ] Deduced a trap composed of 353 places in 310 ms of which 3 ms to minimize.
[2024-06-01 14:59:52] [INFO ] Deduced a trap composed of 207 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 242 places in 420 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 64 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 15:00:09] [INFO ] Deduced a trap composed of 207 places in 376 ms of which 4 ms to minimize.
[2024-06-01 15:00:16] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:00:16] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:00:17] [INFO ] Deduced a trap composed of 82 places in 380 ms of which 4 ms to minimize.
[2024-06-01 15:00:21] [INFO ] Deduced a trap composed of 251 places in 346 ms of which 4 ms to minimize.
[2024-06-01 15:00:21] [INFO ] Deduced a trap composed of 221 places in 360 ms of which 4 ms to minimize.
[2024-06-01 15:00:29] [INFO ] Deduced a trap composed of 330 places in 366 ms of which 4 ms to minimize.
[2024-06-01 15:00:30] [INFO ] Deduced a trap composed of 362 places in 367 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 72 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 28/28 constraints]
After SMT, in 63271ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 63292ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82164 ms. Remains : 563/563 places, 1383/1383 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 30 reset in 634 ms.
Product exploration explored 100000 steps with 33 reset in 507 ms.
Support contains 30 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1403/1403 transitions.
Applied a total of 0 rules in 36 ms. Remains 583 /583 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-06-01 15:00:33] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
// Phase 1: matrix 1383 rows 583 cols
[2024-06-01 15:00:33] [INFO ] Computed 46 invariants in 40 ms
[2024-06-01 15:00:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:00:46] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 227 places in 332 ms of which 4 ms to minimize.
[2024-06-01 15:00:48] [INFO ] Deduced a trap composed of 246 places in 379 ms of which 4 ms to minimize.
[2024-06-01 15:00:48] [INFO ] Deduced a trap composed of 49 places in 291 ms of which 3 ms to minimize.
[2024-06-01 15:00:48] [INFO ] Deduced a trap composed of 50 places in 271 ms of which 3 ms to minimize.
[2024-06-01 15:00:49] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:00:49] [INFO ] Deduced a trap composed of 240 places in 361 ms of which 4 ms to minimize.
[2024-06-01 15:00:50] [INFO ] Deduced a trap composed of 387 places in 350 ms of which 4 ms to minimize.
[2024-06-01 15:00:50] [INFO ] Deduced a trap composed of 226 places in 356 ms of which 7 ms to minimize.
[2024-06-01 15:00:51] [INFO ] Deduced a trap composed of 78 places in 360 ms of which 9 ms to minimize.
[2024-06-01 15:00:51] [INFO ] Deduced a trap composed of 119 places in 362 ms of which 4 ms to minimize.
[2024-06-01 15:00:53] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:00:53] [INFO ] Deduced a trap composed of 79 places in 212 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1966 variables, and 64 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:01:14] [INFO ] Deduced a trap composed of 228 places in 385 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/1966 variables, and 65 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 21/21 constraints]
After SMT, in 42642ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 42665ms
[2024-06-01 15:01:15] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-06-01 15:01:15] [INFO ] Invariant cache hit.
[2024-06-01 15:01:16] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-06-01 15:01:16] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-06-01 15:01:16] [INFO ] Invariant cache hit.
[2024-06-01 15:01:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:01:30] [INFO ] Implicit Places using invariants and state equation in 13793 ms returned []
Implicit Place search using SMT with State Equation took 14690 ms to find 0 implicit places.
[2024-06-01 15:01:30] [INFO ] Redundant transitions in 35 ms returned []
Running 1401 sub problems to find dead transitions.
[2024-06-01 15:01:30] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-06-01 15:01:30] [INFO ] Invariant cache hit.
[2024-06-01 15:01:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 4 ms to minimize.
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 2 ms to minimize.
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 2 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 283 places in 374 ms of which 4 ms to minimize.
[2024-06-01 15:01:46] [INFO ] Deduced a trap composed of 238 places in 535 ms of which 4 ms to minimize.
[2024-06-01 15:01:46] [INFO ] Deduced a trap composed of 217 places in 339 ms of which 3 ms to minimize.
[2024-06-01 15:01:46] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2024-06-01 15:01:47] [INFO ] Deduced a trap composed of 117 places in 292 ms of which 3 ms to minimize.
[2024-06-01 15:01:48] [INFO ] Deduced a trap composed of 284 places in 280 ms of which 3 ms to minimize.
[2024-06-01 15:01:48] [INFO ] Deduced a trap composed of 218 places in 322 ms of which 3 ms to minimize.
[2024-06-01 15:01:49] [INFO ] Deduced a trap composed of 72 places in 616 ms of which 4 ms to minimize.
[2024-06-01 15:01:51] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:01:56] [INFO ] Deduced a trap composed of 382 places in 454 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 3.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 3.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 (/ 29.0 4.0))
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 (/ 9.0 4.0))
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.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 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.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 (/ 3.0 4.0))
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.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 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 (/ 3.0 4.0))
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 (/ 3.0 4.0))
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 (/ 11.0 4.0))
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 (/ 1.0 4.0))
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1966 variables, and 64 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:02:32] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/1966 variables, and 65 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 21/21 constraints]
After SMT, in 62388ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 62408ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 119862 ms. Remains : 583/583 places, 1403/1403 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-01 finished in 652402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1) U (!p0 U X(X(p2))))))'
Support contains 41 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 1642/1642 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 812 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 812 transition count 1632
Applied a total of 21 rules in 32 ms. Remains 812 /823 variables (removed 11) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:02:33] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-06-01 15:02:33] [INFO ] Computed 46 invariants in 35 ms
[2024-06-01 15:02:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:02:54] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 4 ms to minimize.
[2024-06-01 15:02:54] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:02:54] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:02:55] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 1 ms to minimize.
[2024-06-01 15:02:55] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 1 ms to minimize.
[2024-06-01 15:02:55] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:02:55] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:02:55] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:02:56] [INFO ] Deduced a trap composed of 198 places in 420 ms of which 4 ms to minimize.
[2024-06-01 15:02:56] [INFO ] Deduced a trap composed of 72 places in 411 ms of which 4 ms to minimize.
SMT process timed out in 23074ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23088ms
[2024-06-01 15:02:56] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:02:56] [INFO ] Invariant cache hit.
[2024-06-01 15:02:57] [INFO ] Implicit Places using invariants in 865 ms returned []
[2024-06-01 15:02:57] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:02:57] [INFO ] Invariant cache hit.
[2024-06-01 15:02:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:03:17] [INFO ] Implicit Places using invariants and state equation in 19509 ms returned []
Implicit Place search using SMT with State Equation took 20403 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:03:17] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:03:17] [INFO ] Invariant cache hit.
[2024-06-01 15:03:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:03:38] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 4 ms to minimize.
[2024-06-01 15:03:38] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:03:38] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 3 ms to minimize.
[2024-06-01 15:03:39] [INFO ] Deduced a trap composed of 72 places in 570 ms of which 5 ms to minimize.
[2024-06-01 15:03:39] [INFO ] Deduced a trap composed of 427 places in 391 ms of which 4 ms to minimize.
[2024-06-01 15:03:40] [INFO ] Deduced a trap composed of 72 places in 603 ms of which 6 ms to minimize.
[2024-06-01 15:03:41] [INFO ] Deduced a trap composed of 461 places in 548 ms of which 6 ms to minimize.
[2024-06-01 15:03:41] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:03:41] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:03:41] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 2 ms to minimize.
[2024-06-01 15:03:41] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 1 ms to minimize.
[2024-06-01 15:03:41] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:03:41] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:03:42] [INFO ] Deduced a trap composed of 206 places in 511 ms of which 6 ms to minimize.
[2024-06-01 15:03:43] [INFO ] Deduced a trap composed of 81 places in 310 ms of which 3 ms to minimize.
[2024-06-01 15:03:48] [INFO ] Deduced a trap composed of 422 places in 517 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 60 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:04:15] [INFO ] Deduced a trap composed of 588 places in 487 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 61 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 17/17 constraints]
After SMT, in 62885ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62896ms
Starting structural reductions in LTL mode, iteration 1 : 812/823 places, 1632/1642 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106428 ms. Remains : 812/823 places, 1632/1642 transitions.
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-04
Stuttering criterion allowed to conclude after 1265 steps with 13 reset in 12 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-04 finished in 107042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 11 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 1642/1642 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 812 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 812 transition count 1632
Applied a total of 21 rules in 47 ms. Remains 812 /823 variables (removed 11) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:04:20] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:04:20] [INFO ] Invariant cache hit.
[2024-06-01 15:04:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:04:41] [INFO ] Deduced a trap composed of 23 places in 393 ms of which 7 ms to minimize.
[2024-06-01 15:04:42] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:04:42] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:04:42] [INFO ] Deduced a trap composed of 72 places in 595 ms of which 8 ms to minimize.
[2024-06-01 15:04:43] [INFO ] Deduced a trap composed of 427 places in 463 ms of which 6 ms to minimize.
[2024-06-01 15:04:43] [INFO ] Deduced a trap composed of 72 places in 505 ms of which 8 ms to minimize.
SMT process timed out in 23383ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23407ms
[2024-06-01 15:04:43] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:04:43] [INFO ] Invariant cache hit.
[2024-06-01 15:04:44] [INFO ] Implicit Places using invariants in 805 ms returned []
[2024-06-01 15:04:44] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:04:44] [INFO ] Invariant cache hit.
[2024-06-01 15:04:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:05:05] [INFO ] Implicit Places using invariants and state equation in 20777 ms returned []
Implicit Place search using SMT with State Equation took 21587 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:05:05] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:05:05] [INFO ] Invariant cache hit.
[2024-06-01 15:05:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:05:31] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 5 ms to minimize.
[2024-06-01 15:05:31] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:05:31] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 3 ms to minimize.
[2024-06-01 15:05:32] [INFO ] Deduced a trap composed of 72 places in 609 ms of which 5 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 427 places in 663 ms of which 19 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 72 places in 686 ms of which 19 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 461 places in 482 ms of which 5 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:05:35] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 1 ms to minimize.
[2024-06-01 15:05:35] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:05:36] [INFO ] Deduced a trap composed of 206 places in 627 ms of which 13 ms to minimize.
[2024-06-01 15:05:36] [INFO ] Deduced a trap composed of 81 places in 287 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 59 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:06:03] [INFO ] Deduced a trap composed of 445 places in 566 ms of which 6 ms to minimize.
[2024-06-01 15:06:04] [INFO ] Deduced a trap composed of 416 places in 799 ms of which 20 ms to minimize.
[2024-06-01 15:06:04] [INFO ] Deduced a trap composed of 618 places in 682 ms of which 9 ms to minimize.
[2024-06-01 15:06:05] [INFO ] Deduced a trap composed of 573 places in 561 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 63 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 19/19 constraints]
After SMT, in 62892ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62917ms
Starting structural reductions in LTL mode, iteration 1 : 812/823 places, 1632/1642 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107984 ms. Remains : 812/823 places, 1632/1642 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-06
Product exploration explored 100000 steps with 25000 reset in 590 ms.
Product exploration explored 100000 steps with 25000 reset in 366 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 336 steps (0 resets) in 8 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 10 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:06:10] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:06:10] [INFO ] Invariant cache hit.
[2024-06-01 15:06:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 23 places in 307 ms of which 5 ms to minimize.
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 72 places in 514 ms of which 6 ms to minimize.
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 427 places in 480 ms of which 6 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 72 places in 410 ms of which 4 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 461 places in 452 ms of which 5 ms to minimize.
SMT process timed out in 23181ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23194ms
[2024-06-01 15:06:33] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:06:33] [INFO ] Invariant cache hit.
[2024-06-01 15:06:34] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-06-01 15:06:34] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:06:34] [INFO ] Invariant cache hit.
[2024-06-01 15:06:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:06:53] [INFO ] Implicit Places using invariants and state equation in 18632 ms returned []
Implicit Place search using SMT with State Equation took 19505 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:06:53] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:06:53] [INFO ] Invariant cache hit.
[2024-06-01 15:06:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:07:13] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 5 ms to minimize.
[2024-06-01 15:07:13] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 1 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 72 places in 570 ms of which 6 ms to minimize.
[2024-06-01 15:07:15] [INFO ] Deduced a trap composed of 427 places in 482 ms of which 6 ms to minimize.
[2024-06-01 15:07:15] [INFO ] Deduced a trap composed of 72 places in 450 ms of which 5 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 461 places in 459 ms of which 4 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:07:17] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:07:17] [INFO ] Deduced a trap composed of 206 places in 446 ms of which 5 ms to minimize.
[2024-06-01 15:07:18] [INFO ] Deduced a trap composed of 81 places in 293 ms of which 4 ms to minimize.
[2024-06-01 15:07:22] [INFO ] Deduced a trap composed of 422 places in 483 ms of which 6 ms to minimize.
[2024-06-01 15:07:25] [INFO ] Deduced a trap composed of 66 places in 554 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 61 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 572 places in 570 ms of which 6 ms to minimize.
[2024-06-01 15:07:53] [INFO ] Deduced a trap composed of 408 places in 519 ms of which 6 ms to minimize.
[2024-06-01 15:07:55] [INFO ] Deduced a trap composed of 151 places in 499 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 64 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 20/20 constraints]
After SMT, in 63265ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 63282ms
Finished structural reductions in LTL mode , in 1 iterations and 106002 ms. Remains : 812/812 places, 1632/1632 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 252 steps (0 resets) in 8 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 515 ms.
Product exploration explored 100000 steps with 25000 reset in 488 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 812 transition count 1632
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 50 place count 812 transition count 1742
Deduced a syphon composed of 160 places in 1 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 160 place count 812 transition count 1742
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 230 place count 812 transition count 1742
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 259 place count 783 transition count 1713
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 288 place count 783 transition count 1713
Deduced a syphon composed of 210 places in 1 ms
Applied a total of 288 rules in 209 ms. Remains 783 /812 variables (removed 29) and now considering 1713/1632 (removed -81) transitions.
Running 1711 sub problems to find dead transitions.
[2024-06-01 15:07:59] [INFO ] Flow matrix only has 1693 transitions (discarded 20 similar events)
// Phase 1: matrix 1693 rows 783 cols
[2024-06-01 15:07:59] [INFO ] Computed 46 invariants in 23 ms
[2024-06-01 15:07:59] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1711 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/781 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1711 unsolved
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 48 places in 272 ms of which 2 ms to minimize.
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 1 ms to minimize.
[2024-06-01 15:08:21] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:08:21] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:08:22] [INFO ] Deduced a trap composed of 34 places in 800 ms of which 19 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 15:08:22] [INFO ] Deduced a trap composed of 216 places in 527 ms of which 5 ms to minimize.
[2024-06-01 15:08:23] [INFO ] Deduced a trap composed of 111 places in 607 ms of which 18 ms to minimize.
SMT process timed out in 23971ms, After SMT, problems are : Problem set: 0 solved, 1711 unsolved
Search for dead transitions found 0 dead transitions in 23988ms
[2024-06-01 15:08:23] [INFO ] Redundant transitions in 34 ms returned []
Running 1711 sub problems to find dead transitions.
[2024-06-01 15:08:23] [INFO ] Flow matrix only has 1693 transitions (discarded 20 similar events)
[2024-06-01 15:08:23] [INFO ] Invariant cache hit.
[2024-06-01 15:08:23] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1711 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/781 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1711 unsolved
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 0 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 316 places in 464 ms of which 5 ms to minimize.
[2024-06-01 15:08:44] [INFO ] Deduced a trap composed of 34 places in 610 ms of which 19 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 15:08:45] [INFO ] Deduced a trap composed of 34 places in 474 ms of which 6 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 15:08:45] [INFO ] Deduced a trap composed of 49 places in 594 ms of which 19 ms to minimize.
[2024-06-01 15:08:46] [INFO ] Deduced a trap composed of 377 places in 399 ms of which 5 ms to minimize.
[2024-06-01 15:08:46] [INFO ] Deduced a trap composed of 34 places in 642 ms of which 21 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
[2024-06-01 15:08:47] [INFO ] Deduced a trap composed of 49 places in 414 ms of which 6 ms to minimize.
[2024-06-01 15:08:47] [INFO ] Deduced a trap composed of 48 places in 366 ms of which 4 ms to minimize.
[2024-06-01 15:08:48] [INFO ] Deduced a trap composed of 34 places in 369 ms of which 4 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-01 15:08:48] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD43 is UNSAT
[2024-06-01 15:08:49] [INFO ] Deduced a trap composed of 216 places in 389 ms of which 4 ms to minimize.
[2024-06-01 15:08:49] [INFO ] Deduced a trap composed of 109 places in 383 ms of which 4 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 2 ms to minimize.
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 23 places in 364 ms of which 4 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1710 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/64 constraints. Problems are: Problem set: 300 solved, 1411 unsolved
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 232 places in 599 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/2476 variables, and 65 constraints, problems are : Problem set: 300 solved, 1411 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/783 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1711/1711 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 300 solved, 1411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 8/8 constraints. Problems are: Problem set: 300 solved, 1411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/591 variables, 13/21 constraints. Problems are: Problem set: 300 solved, 1411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 21/42 constraints. Problems are: Problem set: 300 solved, 1411 unsolved
[2024-06-01 15:08:58] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/591 variables, 1/43 constraints. Problems are: Problem set: 300 solved, 1411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/2476 variables, and 43 constraints, problems are : Problem set: 300 solved, 1411 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 8/15 constraints, Generalized P Invariants (flows): 13/31 constraints, State Equation: 0/783 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1711 constraints, Known Traps: 22/22 constraints]
After SMT, in 63735ms problems are : Problem set: 300 solved, 1411 unsolved
Search for dead transitions found 300 dead transitions in 63766ms
Found 300 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 300 transitions
Dead transitions reduction (with SMT) removed 300 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 783/812 places, 1413/1632 transitions.
Graph (complete) has 3787 edges and 783 vertex of which 593 are kept as prefixes of interest. Removing 190 places using SCC suffix rule.7 ms
Discarding 190 places :
Also discarding 0 output transitions
Deduced a syphon composed of 20 places in 1 ms
Applied a total of 1 rules in 50 ms. Remains 593 /783 variables (removed 190) and now considering 1413/1413 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 593/812 places, 1413/1632 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88087 ms. Remains : 593/812 places, 1413/1632 transitions.
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 25 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:09:27] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-06-01 15:09:27] [INFO ] Computed 46 invariants in 53 ms
[2024-06-01 15:09:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:09:48] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 4 ms to minimize.
[2024-06-01 15:09:48] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:09:49] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:09:49] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:09:49] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:09:49] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:09:49] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:09:49] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:09:50] [INFO ] Deduced a trap composed of 198 places in 492 ms of which 6 ms to minimize.
SMT process timed out in 23241ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23261ms
[2024-06-01 15:09:50] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:09:50] [INFO ] Invariant cache hit.
[2024-06-01 15:09:51] [INFO ] Implicit Places using invariants in 755 ms returned []
[2024-06-01 15:09:51] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:09:51] [INFO ] Invariant cache hit.
[2024-06-01 15:09:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:10:11] [INFO ] Implicit Places using invariants and state equation in 20617 ms returned []
Implicit Place search using SMT with State Equation took 21375 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:10:11] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:10:11] [INFO ] Invariant cache hit.
[2024-06-01 15:10:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:10:32] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 3 ms to minimize.
[2024-06-01 15:10:36] [INFO ] Deduced a trap composed of 72 places in 4380 ms of which 27 ms to minimize.
[2024-06-01 15:10:36] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:10:37] [INFO ] Deduced a trap composed of 72 places in 503 ms of which 6 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 427 places in 410 ms of which 5 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 72 places in 386 ms of which 5 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 461 places in 422 ms of which 5 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:10:39] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:10:39] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:10:39] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:10:39] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:10:39] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:10:46] [INFO ] Deduced a trap composed of 206 places in 6539 ms of which 30 ms to minimize.
SMT process timed out in 34725ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 34737ms
Finished structural reductions in LTL mode , in 1 iterations and 79407 ms. Remains : 812/812 places, 1632/1632 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-06 finished in 386158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 71 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 1642/1642 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 822 transition count 1572
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 752 transition count 1572
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 140 place count 752 transition count 1542
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 200 place count 722 transition count 1542
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 380 place count 632 transition count 1452
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 389 place count 623 transition count 1443
Iterating global reduction 2 with 9 rules applied. Total rules applied 398 place count 623 transition count 1443
Applied a total of 398 rules in 125 ms. Remains 623 /823 variables (removed 200) and now considering 1443/1642 (removed 199) transitions.
Running 1441 sub problems to find dead transitions.
[2024-06-01 15:10:46] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
// Phase 1: matrix 1423 rows 623 cols
[2024-06-01 15:10:46] [INFO ] Computed 46 invariants in 30 ms
[2024-06-01 15:10:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
[2024-06-01 15:11:02] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 3 ms to minimize.
[2024-06-01 15:11:02] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:11:02] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:11:02] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:11:02] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:11:02] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:11:02] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:11:02] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:11:03] [INFO ] Deduced a trap composed of 266 places in 345 ms of which 4 ms to minimize.
[2024-06-01 15:11:03] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:11:03] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:11:04] [INFO ] Deduced a trap composed of 89 places in 377 ms of which 5 ms to minimize.
[2024-06-01 15:11:05] [INFO ] Deduced a trap composed of 58 places in 252 ms of which 3 ms to minimize.
[2024-06-01 15:11:06] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:11:09] [INFO ] Deduced a trap composed of 74 places in 238 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2046 variables, and 59 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/623 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1441/1441 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
[2024-06-01 15:11:26] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/2046 variables, and 60 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/623 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1441 constraints, Known Traps: 16/16 constraints]
After SMT, in 43327ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 43347ms
[2024-06-01 15:11:30] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-06-01 15:11:30] [INFO ] Invariant cache hit.
[2024-06-01 15:11:30] [INFO ] Implicit Places using invariants in 856 ms returned []
[2024-06-01 15:11:30] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-06-01 15:11:30] [INFO ] Invariant cache hit.
[2024-06-01 15:11:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:11:45] [INFO ] Implicit Places using invariants and state equation in 14797 ms returned []
Implicit Place search using SMT with State Equation took 15658 ms to find 0 implicit places.
[2024-06-01 15:11:45] [INFO ] Redundant transitions in 36 ms returned []
Running 1441 sub problems to find dead transitions.
[2024-06-01 15:11:45] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-06-01 15:11:45] [INFO ] Invariant cache hit.
[2024-06-01 15:11:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
[2024-06-01 15:11:59] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:11:59] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:12:00] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:12:00] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:12:00] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:12:00] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-06-01 15:12:00] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:12:00] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:12:00] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:12:00] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:12:01] [INFO ] Deduced a trap composed of 276 places in 372 ms of which 4 ms to minimize.
[2024-06-01 15:12:02] [INFO ] Deduced a trap composed of 89 places in 354 ms of which 5 ms to minimize.
[2024-06-01 15:12:03] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:12:04] [INFO ] Deduced a trap composed of 450 places in 375 ms of which 5 ms to minimize.
[2024-06-01 15:12:04] [INFO ] Deduced a trap composed of 448 places in 374 ms of which 5 ms to minimize.
[2024-06-01 15:12:05] [INFO ] Deduced a trap composed of 301 places in 362 ms of which 4 ms to minimize.
[2024-06-01 15:12:05] [INFO ] Deduced a trap composed of 23 places in 320 ms of which 4 ms to minimize.
[2024-06-01 15:12:12] [INFO ] Deduced a trap composed of 438 places in 403 ms of which 5 ms to minimize.
[2024-06-01 15:12:15] [INFO ] Deduced a trap composed of 267 places in 394 ms of which 5 ms to minimize.
[2024-06-01 15:12:17] [INFO ] Deduced a trap composed of 337 places in 374 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2046 variables, and 64 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/623 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1441/1441 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 9)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(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 5)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(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 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 1)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 1)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 1)
(s504 1)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 5)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/2046 variables, and 64 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/623 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1441 constraints, Known Traps: 20/20 constraints]
After SMT, in 62659ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 62673ms
Starting structural reductions in SI_LTL mode, iteration 1 : 623/823 places, 1443/1642 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121858 ms. Remains : 623/823 places, 1443/1642 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-07
Product exploration explored 100000 steps with 2429 reset in 609 ms.
Product exploration explored 100000 steps with 2420 reset in 819 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 103 steps (0 resets) in 6 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Support contains 71 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 1443/1443 transitions.
Applied a total of 0 rules in 28 ms. Remains 623 /623 variables (removed 0) and now considering 1443/1443 (removed 0) transitions.
Running 1441 sub problems to find dead transitions.
[2024-06-01 15:12:50] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-06-01 15:12:50] [INFO ] Invariant cache hit.
[2024-06-01 15:12:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
[2024-06-01 15:13:05] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:13:05] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:13:05] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:13:05] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:13:06] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:13:06] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:13:06] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:13:06] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:13:06] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:13:06] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:13:07] [INFO ] Deduced a trap composed of 276 places in 348 ms of which 4 ms to minimize.
[2024-06-01 15:13:08] [INFO ] Deduced a trap composed of 89 places in 364 ms of which 4 ms to minimize.
[2024-06-01 15:13:08] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 3 ms to minimize.
[2024-06-01 15:13:10] [INFO ] Deduced a trap composed of 450 places in 434 ms of which 4 ms to minimize.
[2024-06-01 15:13:10] [INFO ] Deduced a trap composed of 448 places in 345 ms of which 3 ms to minimize.
[2024-06-01 15:13:11] [INFO ] Deduced a trap composed of 301 places in 424 ms of which 7 ms to minimize.
[2024-06-01 15:13:11] [INFO ] Deduced a trap composed of 23 places in 382 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.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 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 4.0)
(s42 0.0)
(s43 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2046 variables, and 61 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/623 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1441/1441 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
[2024-06-01 15:13:28] [INFO ] Deduced a trap composed of 266 places in 410 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/2046 variables, and 62 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/623 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1441 constraints, Known Traps: 18/18 constraints]
After SMT, in 42826ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 42844ms
[2024-06-01 15:13:33] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-06-01 15:13:33] [INFO ] Invariant cache hit.
[2024-06-01 15:13:34] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-06-01 15:13:34] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-06-01 15:13:34] [INFO ] Invariant cache hit.
[2024-06-01 15:13:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:13:47] [INFO ] Implicit Places using invariants and state equation in 13613 ms returned []
Implicit Place search using SMT with State Equation took 14288 ms to find 0 implicit places.
[2024-06-01 15:13:47] [INFO ] Redundant transitions in 26 ms returned []
Running 1441 sub problems to find dead transitions.
[2024-06-01 15:13:47] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-06-01 15:13:47] [INFO ] Invariant cache hit.
[2024-06-01 15:13:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 3 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 6 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 2 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:14:04] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:14:04] [INFO ] Deduced a trap composed of 276 places in 506 ms of which 20 ms to minimize.
[2024-06-01 15:14:05] [INFO ] Deduced a trap composed of 89 places in 489 ms of which 4 ms to minimize.
[2024-06-01 15:14:07] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 3 ms to minimize.
[2024-06-01 15:14:08] [INFO ] Deduced a trap composed of 450 places in 361 ms of which 5 ms to minimize.
[2024-06-01 15:14:08] [INFO ] Deduced a trap composed of 448 places in 383 ms of which 4 ms to minimize.
[2024-06-01 15:14:09] [INFO ] Deduced a trap composed of 301 places in 375 ms of which 4 ms to minimize.
[2024-06-01 15:14:09] [INFO ] Deduced a trap composed of 23 places in 329 ms of which 4 ms to minimize.
[2024-06-01 15:14:16] [INFO ] Deduced a trap composed of 438 places in 372 ms of which 5 ms to minimize.
[2024-06-01 15:14:20] [INFO ] Deduced a trap composed of 267 places in 381 ms of which 4 ms to minimize.
SMT process timed out in 32857ms, After SMT, problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 32868ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 90072 ms. Remains : 623/623 places, 1443/1443 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 105 steps (0 resets) in 7 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2481 reset in 865 ms.
Product exploration explored 100000 steps with 2427 reset in 647 ms.
Support contains 71 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 1443/1443 transitions.
Applied a total of 0 rules in 51 ms. Remains 623 /623 variables (removed 0) and now considering 1443/1443 (removed 0) transitions.
Running 1441 sub problems to find dead transitions.
[2024-06-01 15:14:22] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-06-01 15:14:22] [INFO ] Invariant cache hit.
[2024-06-01 15:14:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
[2024-06-01 15:14:38] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 276 places in 318 ms of which 3 ms to minimize.
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 89 places in 365 ms of which 4 ms to minimize.
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 450 places in 406 ms of which 4 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 448 places in 362 ms of which 4 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 301 places in 390 ms of which 4 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 3.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.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 2.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 4.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2046 variables, and 61 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/623 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1441/1441 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
[2024-06-01 15:14:59] [INFO ] Deduced a trap composed of 266 places in 387 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/2046 variables, and 62 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/623 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1441 constraints, Known Traps: 18/18 constraints]
After SMT, in 43108ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 43126ms
[2024-06-01 15:15:06] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-06-01 15:15:06] [INFO ] Invariant cache hit.
[2024-06-01 15:15:06] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-06-01 15:15:06] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-06-01 15:15:06] [INFO ] Invariant cache hit.
[2024-06-01 15:15:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:15:21] [INFO ] Implicit Places using invariants and state equation in 14635 ms returned []
Implicit Place search using SMT with State Equation took 15419 ms to find 0 implicit places.
[2024-06-01 15:15:21] [INFO ] Redundant transitions in 24 ms returned []
Running 1441 sub problems to find dead transitions.
[2024-06-01 15:15:21] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-06-01 15:15:21] [INFO ] Invariant cache hit.
[2024-06-01 15:15:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 1 ms to minimize.
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 2 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 0 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:15:38] [INFO ] Deduced a trap composed of 276 places in 307 ms of which 4 ms to minimize.
[2024-06-01 15:15:39] [INFO ] Deduced a trap composed of 89 places in 291 ms of which 3 ms to minimize.
[2024-06-01 15:15:39] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 450 places in 380 ms of which 4 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 448 places in 341 ms of which 4 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 301 places in 386 ms of which 5 ms to minimize.
[2024-06-01 15:15:42] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 4 ms to minimize.
[2024-06-01 15:15:50] [INFO ] Deduced a trap composed of 438 places in 366 ms of which 5 ms to minimize.
[2024-06-01 15:15:53] [INFO ] Deduced a trap composed of 267 places in 355 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2046 variables, and 63 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/623 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1441/1441 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/2046 variables, and 63 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/623 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1441 constraints, Known Traps: 19/19 constraints]
After SMT, in 62756ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 62768ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121402 ms. Remains : 623/623 places, 1443/1443 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-07 finished in 337725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 1642/1642 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 822 transition count 1573
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 753 transition count 1573
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 138 place count 753 transition count 1473
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 338 place count 653 transition count 1473
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 516 place count 564 transition count 1384
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 525 place count 555 transition count 1375
Iterating global reduction 2 with 9 rules applied. Total rules applied 534 place count 555 transition count 1375
Applied a total of 534 rules in 113 ms. Remains 555 /823 variables (removed 268) and now considering 1375/1642 (removed 267) transitions.
Running 1373 sub problems to find dead transitions.
[2024-06-01 15:16:24] [INFO ] Flow matrix only has 1355 transitions (discarded 20 similar events)
// Phase 1: matrix 1355 rows 555 cols
[2024-06-01 15:16:24] [INFO ] Computed 46 invariants in 37 ms
[2024-06-01 15:16:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
[2024-06-01 15:16:40] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:16:41] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:16:41] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:16:41] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:16:41] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:16:41] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:16:41] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:16:41] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:16:41] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:16:42] [INFO ] Deduced a trap composed of 50 places in 351 ms of which 4 ms to minimize.
[2024-06-01 15:16:42] [INFO ] Deduced a trap composed of 90 places in 365 ms of which 4 ms to minimize.
[2024-06-01 15:16:43] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:16:44] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:16:44] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:16:44] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 3 ms to minimize.
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 199 places in 336 ms of which 4 ms to minimize.
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 198 places in 343 ms of which 4 ms to minimize.
SMT process timed out in 23284ms, After SMT, problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 23300ms
[2024-06-01 15:16:47] [INFO ] Flow matrix only has 1355 transitions (discarded 20 similar events)
[2024-06-01 15:16:47] [INFO ] Invariant cache hit.
[2024-06-01 15:16:48] [INFO ] Implicit Places using invariants in 717 ms returned []
[2024-06-01 15:16:48] [INFO ] Flow matrix only has 1355 transitions (discarded 20 similar events)
[2024-06-01 15:16:48] [INFO ] Invariant cache hit.
[2024-06-01 15:16:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:17:03] [INFO ] Implicit Places using invariants and state equation in 14886 ms returned []
Implicit Place search using SMT with State Equation took 15604 ms to find 0 implicit places.
[2024-06-01 15:17:03] [INFO ] Redundant transitions in 57 ms returned []
Running 1373 sub problems to find dead transitions.
[2024-06-01 15:17:03] [INFO ] Flow matrix only has 1355 transitions (discarded 20 similar events)
[2024-06-01 15:17:03] [INFO ] Invariant cache hit.
[2024-06-01 15:17:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
[2024-06-01 15:17:16] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:17:16] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:17:16] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:17:16] [INFO ] Deduced a trap composed of 46 places in 345 ms of which 4 ms to minimize.
[2024-06-01 15:17:17] [INFO ] Deduced a trap composed of 46 places in 332 ms of which 4 ms to minimize.
[2024-06-01 15:17:17] [INFO ] Deduced a trap composed of 197 places in 316 ms of which 4 ms to minimize.
[2024-06-01 15:17:17] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 2 ms to minimize.
[2024-06-01 15:17:17] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:17:17] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 46 places in 336 ms of which 4 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 197 places in 324 ms of which 4 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:17:19] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:17:19] [INFO ] Deduced a trap composed of 50 places in 350 ms of which 4 ms to minimize.
[2024-06-01 15:17:20] [INFO ] Deduced a trap composed of 94 places in 329 ms of which 5 ms to minimize.
[2024-06-01 15:17:20] [INFO ] Deduced a trap composed of 205 places in 367 ms of which 4 ms to minimize.
[2024-06-01 15:17:20] [INFO ] Deduced a trap composed of 88 places in 326 ms of which 4 ms to minimize.
[2024-06-01 15:17:26] [INFO ] Deduced a trap composed of 211 places in 343 ms of which 4 ms to minimize.
[2024-06-01 15:17:28] [INFO ] Deduced a trap composed of 367 places in 332 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
[2024-06-01 15:17:31] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1910 variables, and 65 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/555 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1373/1373 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
[2024-06-01 15:17:59] [INFO ] Deduced a trap composed of 354 places in 347 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/1910 variables, and 66 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/555 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1373 constraints, Known Traps: 22/22 constraints]
After SMT, in 62880ms problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 62903ms
Starting structural reductions in SI_LTL mode, iteration 1 : 555/823 places, 1375/1642 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101995 ms. Remains : 555/823 places, 1375/1642 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-09
Stuttering criterion allowed to conclude after 5083 steps with 0 reset in 42 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-09 finished in 102141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(p0) U G(p1)) U p2)))'
Support contains 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 1642/1642 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 822 transition count 1574
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 137 place count 754 transition count 1573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 753 transition count 1573
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 138 place count 753 transition count 1473
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 338 place count 653 transition count 1473
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 498 place count 573 transition count 1393
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 507 place count 564 transition count 1384
Iterating global reduction 3 with 9 rules applied. Total rules applied 516 place count 564 transition count 1384
Applied a total of 516 rules in 103 ms. Remains 564 /823 variables (removed 259) and now considering 1384/1642 (removed 258) transitions.
Running 1382 sub problems to find dead transitions.
[2024-06-01 15:18:06] [INFO ] Flow matrix only has 1364 transitions (discarded 20 similar events)
// Phase 1: matrix 1364 rows 564 cols
[2024-06-01 15:18:06] [INFO ] Computed 46 invariants in 43 ms
[2024-06-01 15:18:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
[2024-06-01 15:18:21] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:18:21] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 1 ms to minimize.
[2024-06-01 15:18:21] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:18:21] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:18:21] [INFO ] Deduced a trap composed of 197 places in 389 ms of which 4 ms to minimize.
[2024-06-01 15:18:22] [INFO ] Deduced a trap composed of 23 places in 390 ms of which 4 ms to minimize.
[2024-06-01 15:18:22] [INFO ] Deduced a trap composed of 47 places in 365 ms of which 6 ms to minimize.
[2024-06-01 15:18:23] [INFO ] Deduced a trap composed of 47 places in 365 ms of which 3 ms to minimize.
[2024-06-01 15:18:23] [INFO ] Deduced a trap composed of 48 places in 424 ms of which 5 ms to minimize.
[2024-06-01 15:18:23] [INFO ] Deduced a trap composed of 47 places in 413 ms of which 18 ms to minimize.
[2024-06-01 15:18:24] [INFO ] Deduced a trap composed of 206 places in 434 ms of which 31 ms to minimize.
[2024-06-01 15:18:24] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 0 ms to minimize.
[2024-06-01 15:18:24] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:18:25] [INFO ] Deduced a trap composed of 101 places in 421 ms of which 5 ms to minimize.
[2024-06-01 15:18:31] [INFO ] Deduced a trap composed of 127 places in 3977 ms of which 28 ms to minimize.
SMT process timed out in 24701ms, After SMT, problems are : Problem set: 0 solved, 1382 unsolved
Search for dead transitions found 0 dead transitions in 24716ms
[2024-06-01 15:18:31] [INFO ] Flow matrix only has 1364 transitions (discarded 20 similar events)
[2024-06-01 15:18:31] [INFO ] Invariant cache hit.
[2024-06-01 15:18:32] [INFO ] Implicit Places using invariants in 765 ms returned []
[2024-06-01 15:18:32] [INFO ] Flow matrix only has 1364 transitions (discarded 20 similar events)
[2024-06-01 15:18:32] [INFO ] Invariant cache hit.
[2024-06-01 15:18:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:18:42] [INFO ] Implicit Places using invariants and state equation in 10731 ms returned []
Implicit Place search using SMT with State Equation took 11514 ms to find 0 implicit places.
[2024-06-01 15:18:42] [INFO ] Redundant transitions in 34 ms returned []
Running 1382 sub problems to find dead transitions.
[2024-06-01 15:18:42] [INFO ] Flow matrix only has 1364 transitions (discarded 20 similar events)
[2024-06-01 15:18:42] [INFO ] Invariant cache hit.
[2024-06-01 15:18:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
[2024-06-01 15:18:58] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:18:58] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:18:58] [INFO ] Deduced a trap composed of 48 places in 398 ms of which 6 ms to minimize.
[2024-06-01 15:18:58] [INFO ] Deduced a trap composed of 47 places in 273 ms of which 3 ms to minimize.
[2024-06-01 15:18:59] [INFO ] Deduced a trap composed of 47 places in 314 ms of which 3 ms to minimize.
[2024-06-01 15:18:59] [INFO ] Deduced a trap composed of 47 places in 363 ms of which 4 ms to minimize.
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 206 places in 408 ms of which 6 ms to minimize.
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:19:01] [INFO ] Deduced a trap composed of 216 places in 355 ms of which 4 ms to minimize.
[2024-06-01 15:19:01] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:19:01] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:19:02] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:19:02] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:19:03] [INFO ] Deduced a trap composed of 58 places in 414 ms of which 6 ms to minimize.
[2024-06-01 15:19:03] [INFO ] Deduced a trap composed of 101 places in 326 ms of which 3 ms to minimize.
[2024-06-01 15:19:07] [INFO ] Deduced a trap composed of 109 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:19:09] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 2 ms to minimize.
[2024-06-01 15:19:14] [INFO ] Deduced a trap composed of 366 places in 292 ms of which 4 ms to minimize.
[2024-06-01 15:19:14] [INFO ] Deduced a trap composed of 373 places in 329 ms of which 3 ms to minimize.
[2024-06-01 15:19:15] [INFO ] Deduced a trap composed of 364 places in 382 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1928 variables, and 64 constraints, problems are : Problem set: 0 solved, 1382 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/564 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1382/1382 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/1928 variables, and 64 constraints, problems are : Problem set: 0 solved, 1382 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/564 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1382 constraints, Known Traps: 20/20 constraints]
After SMT, in 63213ms problems are : Problem set: 0 solved, 1382 unsolved
Search for dead transitions found 0 dead transitions in 63227ms
Starting structural reductions in SI_LTL mode, iteration 1 : 564/823 places, 1384/1642 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99629 ms. Remains : 564/823 places, 1384/1642 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p2), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-10
Stuttering criterion allowed to conclude after 5224 steps with 11 reset in 57 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-10 finished in 99954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 1642/1642 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 822 transition count 1642
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 813 transition count 1633
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 813 transition count 1633
Applied a total of 19 rules in 38 ms. Remains 813 /823 variables (removed 10) and now considering 1633/1642 (removed 9) transitions.
Running 1631 sub problems to find dead transitions.
[2024-06-01 15:19:46] [INFO ] Flow matrix only has 1613 transitions (discarded 20 similar events)
// Phase 1: matrix 1613 rows 813 cols
[2024-06-01 15:19:46] [INFO ] Computed 46 invariants in 50 ms
[2024-06-01 15:19:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/811 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
SMT process timed out in 23315ms, After SMT, problems are : Problem set: 0 solved, 1631 unsolved
Search for dead transitions found 0 dead transitions in 23343ms
[2024-06-01 15:20:09] [INFO ] Flow matrix only has 1613 transitions (discarded 20 similar events)
[2024-06-01 15:20:09] [INFO ] Invariant cache hit.
[2024-06-01 15:20:11] [INFO ] Implicit Places using invariants in 1382 ms returned []
[2024-06-01 15:20:11] [INFO ] Flow matrix only has 1613 transitions (discarded 20 similar events)
[2024-06-01 15:20:11] [INFO ] Invariant cache hit.
[2024-06-01 15:20:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:20:42] [INFO ] Performed 759/813 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:20:43] [INFO ] Implicit Places using invariants and state equation in 32010 ms returned []
Implicit Place search using SMT with State Equation took 33416 ms to find 0 implicit places.
Running 1631 sub problems to find dead transitions.
[2024-06-01 15:20:43] [INFO ] Flow matrix only has 1613 transitions (discarded 20 similar events)
[2024-06-01 15:20:43] [INFO ] Invariant cache hit.
[2024-06-01 15:20:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/811 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/811 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
[2024-06-01 15:21:03] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 4 ms to minimize.
[2024-06-01 15:21:03] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:21:03] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 3 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 0 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 1 ms to minimize.
[2024-06-01 15:21:05] [INFO ] Deduced a trap composed of 72 places in 499 ms of which 6 ms to minimize.
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 152 places in 547 ms of which 6 ms to minimize.
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 201 places in 424 ms of which 5 ms to minimize.
[2024-06-01 15:21:08] [INFO ] Deduced a trap composed of 414 places in 523 ms of which 6 ms to minimize.
[2024-06-01 15:21:08] [INFO ] Deduced a trap composed of 414 places in 537 ms of which 6 ms to minimize.
[2024-06-01 15:21:10] [INFO ] Deduced a trap composed of 66 places in 498 ms of which 6 ms to minimize.
[2024-06-01 15:21:11] [INFO ] Deduced a trap composed of 99 places in 311 ms of which 3 ms to minimize.
[2024-06-01 15:21:12] [INFO ] Deduced a trap composed of 118 places in 319 ms of which 3 ms to minimize.
[2024-06-01 15:21:14] [INFO ] Deduced a trap composed of 423 places in 640 ms of which 34 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 811/2426 variables, and 63 constraints, problems are : Problem set: 0 solved, 1631 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/813 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1631/1631 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1631 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/811 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/811 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/811 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 573 places in 529 ms of which 6 ms to minimize.
[2024-06-01 15:21:46] [INFO ] Deduced a trap composed of 118 places in 365 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/2426 variables, and 65 constraints, problems are : Problem set: 0 solved, 1631 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/813 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1631 constraints, Known Traps: 21/21 constraints]
After SMT, in 62795ms problems are : Problem set: 0 solved, 1631 unsolved
Search for dead transitions found 0 dead transitions in 62809ms
Starting structural reductions in LTL mode, iteration 1 : 813/823 places, 1633/1642 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119618 ms. Remains : 813/823 places, 1633/1642 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-12
Stuttering criterion allowed to conclude after 5218 steps with 0 reset in 47 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-12 finished in 120017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!(p0 U p1))||G(p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J06T10-LTLCardinality-06
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 1642/1642 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 822 transition count 1602
Reduce places removed 40 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 90 place count 782 transition count 1592
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 772 transition count 1592
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 100 place count 772 transition count 1482
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 320 place count 662 transition count 1482
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 480 place count 582 transition count 1402
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 489 place count 573 transition count 1393
Iterating global reduction 3 with 9 rules applied. Total rules applied 498 place count 573 transition count 1393
Applied a total of 498 rules in 130 ms. Remains 573 /823 variables (removed 250) and now considering 1393/1642 (removed 249) transitions.
Running 1391 sub problems to find dead transitions.
[2024-06-01 15:21:47] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
// Phase 1: matrix 1373 rows 573 cols
[2024-06-01 15:21:47] [INFO ] Computed 46 invariants in 38 ms
[2024-06-01 15:21:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:22:00] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 1 ms to minimize.
[2024-06-01 15:22:00] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 1 ms to minimize.
[2024-06-01 15:22:01] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:22:01] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:22:01] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:22:01] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:22:01] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:22:01] [INFO ] Deduced a trap composed of 216 places in 409 ms of which 5 ms to minimize.
[2024-06-01 15:22:02] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:22:02] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:22:02] [INFO ] Deduced a trap composed of 68 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:22:02] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:22:03] [INFO ] Deduced a trap composed of 228 places in 367 ms of which 4 ms to minimize.
[2024-06-01 15:22:04] [INFO ] Deduced a trap composed of 113 places in 358 ms of which 5 ms to minimize.
[2024-06-01 15:22:10] [INFO ] Deduced a trap composed of 48 places in 243 ms of which 2 ms to minimize.
SMT process timed out in 23335ms, After SMT, problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 23355ms
[2024-06-01 15:22:10] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:22:10] [INFO ] Invariant cache hit.
[2024-06-01 15:22:11] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-06-01 15:22:11] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:22:11] [INFO ] Invariant cache hit.
[2024-06-01 15:22:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:22:29] [INFO ] Implicit Places using invariants and state equation in 18109 ms returned []
Implicit Place search using SMT with State Equation took 18832 ms to find 0 implicit places.
Running 1391 sub problems to find dead transitions.
[2024-06-01 15:22:29] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:22:29] [INFO ] Invariant cache hit.
[2024-06-01 15:22:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:22:47] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 1 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 1 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 0 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:22:49] [INFO ] Deduced a trap composed of 48 places in 662 ms of which 20 ms to minimize.
[2024-06-01 15:22:51] [INFO ] Deduced a trap composed of 216 places in 2239 ms of which 29 ms to minimize.
[2024-06-01 15:22:51] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:22:51] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 0 ms to minimize.
[2024-06-01 15:22:51] [INFO ] Deduced a trap composed of 59 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:22:52] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:22:52] [INFO ] Deduced a trap composed of 68 places in 290 ms of which 3 ms to minimize.
[2024-06-01 15:22:53] [INFO ] Deduced a trap composed of 109 places in 302 ms of which 3 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 37 places in 302 ms of which 5 ms to minimize.
[2024-06-01 15:23:01] [INFO ] Deduced a trap composed of 372 places in 440 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1946 variables, and 60 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1391/1391 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:23:11] [INFO ] Deduced a trap composed of 234 places in 381 ms of which 5 ms to minimize.
[2024-06-01 15:23:32] [INFO ] Deduced a trap composed of 393 places in 335 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/1946 variables, and 62 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1391 constraints, Known Traps: 18/18 constraints]
After SMT, in 63184ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 63202ms
Starting structural reductions in LI_LTL mode, iteration 1 : 573/823 places, 1393/1642 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 105540 ms. Remains : 573/823 places, 1393/1642 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-06
Product exploration explored 100000 steps with 25000 reset in 337 ms.
Product exploration explored 100000 steps with 25000 reset in 346 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 167 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 153 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1393/1393 transitions.
Applied a total of 0 rules in 8 ms. Remains 573 /573 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
Running 1391 sub problems to find dead transitions.
[2024-06-01 15:23:34] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:23:34] [INFO ] Invariant cache hit.
[2024-06-01 15:23:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:23:49] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:23:49] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:23:49] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:23:49] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:23:49] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:23:49] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:23:50] [INFO ] Deduced a trap composed of 48 places in 376 ms of which 4 ms to minimize.
[2024-06-01 15:23:50] [INFO ] Deduced a trap composed of 216 places in 359 ms of which 3 ms to minimize.
[2024-06-01 15:23:50] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:23:50] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:23:51] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 2 ms to minimize.
[2024-06-01 15:23:51] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:23:52] [INFO ] Deduced a trap composed of 68 places in 421 ms of which 4 ms to minimize.
[2024-06-01 15:23:52] [INFO ] Deduced a trap composed of 109 places in 389 ms of which 4 ms to minimize.
[2024-06-01 15:23:54] [INFO ] Deduced a trap composed of 37 places in 273 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1946 variables, and 59 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1391/1391 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:24:14] [INFO ] Deduced a trap composed of 74 places in 246 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/1946 variables, and 60 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1391 constraints, Known Traps: 16/16 constraints]
After SMT, in 42783ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 42803ms
[2024-06-01 15:24:17] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:24:17] [INFO ] Invariant cache hit.
[2024-06-01 15:24:17] [INFO ] Implicit Places using invariants in 783 ms returned []
[2024-06-01 15:24:17] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:24:17] [INFO ] Invariant cache hit.
[2024-06-01 15:24:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:24:34] [INFO ] Implicit Places using invariants and state equation in 17155 ms returned []
Implicit Place search using SMT with State Equation took 17938 ms to find 0 implicit places.
Running 1391 sub problems to find dead transitions.
[2024-06-01 15:24:34] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:24:34] [INFO ] Invariant cache hit.
[2024-06-01 15:24:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:24:49] [INFO ] Deduced a trap composed of 48 places in 473 ms of which 4 ms to minimize.
[2024-06-01 15:24:49] [INFO ] Deduced a trap composed of 216 places in 397 ms of which 5 ms to minimize.
[2024-06-01 15:24:49] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:24:49] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:24:50] [INFO ] Deduced a trap composed of 59 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:24:50] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:24:51] [INFO ] Deduced a trap composed of 68 places in 441 ms of which 4 ms to minimize.
[2024-06-01 15:24:52] [INFO ] Deduced a trap composed of 109 places in 383 ms of which 4 ms to minimize.
[2024-06-01 15:24:53] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 3 ms to minimize.
[2024-06-01 15:25:00] [INFO ] Deduced a trap composed of 372 places in 359 ms of which 4 ms to minimize.
[2024-06-01 15:25:07] [INFO ] Deduced a trap composed of 245 places in 498 ms of which 5 ms to minimize.
[2024-06-01 15:25:07] [INFO ] Deduced a trap composed of 259 places in 410 ms of which 4 ms to minimize.
[2024-06-01 15:25:08] [INFO ] Deduced a trap composed of 257 places in 374 ms of which 4 ms to minimize.
SMT process timed out in 33053ms, After SMT, problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 33068ms
Finished structural reductions in LTL mode , in 1 iterations and 93828 ms. Remains : 573/573 places, 1393/1393 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 268 steps (0 resets) in 7 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 325 ms.
Product exploration explored 100000 steps with 25000 reset in 337 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 1393/1393 transitions.
Applied a total of 0 rules in 18 ms. Remains 573 /573 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
Running 1391 sub problems to find dead transitions.
[2024-06-01 15:25:10] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:25:10] [INFO ] Invariant cache hit.
[2024-06-01 15:25:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:25:24] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 1 ms to minimize.
[2024-06-01 15:25:24] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:25:24] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:25:24] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:25:24] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:25:24] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:25:25] [INFO ] Deduced a trap composed of 48 places in 401 ms of which 4 ms to minimize.
[2024-06-01 15:25:25] [INFO ] Deduced a trap composed of 216 places in 343 ms of which 4 ms to minimize.
[2024-06-01 15:25:25] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 0 ms to minimize.
[2024-06-01 15:25:25] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:25:26] [INFO ] Deduced a trap composed of 59 places in 220 ms of which 2 ms to minimize.
[2024-06-01 15:25:26] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 0 ms to minimize.
[2024-06-01 15:25:27] [INFO ] Deduced a trap composed of 68 places in 373 ms of which 4 ms to minimize.
[2024-06-01 15:25:28] [INFO ] Deduced a trap composed of 109 places in 554 ms of which 6 ms to minimize.
[2024-06-01 15:25:29] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1946 variables, and 59 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1391/1391 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:25:48] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/1946 variables, and 60 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1391 constraints, Known Traps: 16/16 constraints]
After SMT, in 42692ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 42718ms
[2024-06-01 15:25:52] [INFO ] Redundant transitions in 22 ms returned []
Running 1391 sub problems to find dead transitions.
[2024-06-01 15:25:53] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:25:53] [INFO ] Invariant cache hit.
[2024-06-01 15:25:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:26:11] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:26:12] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:26:12] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:26:12] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:26:12] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:26:12] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:26:12] [INFO ] Deduced a trap composed of 48 places in 440 ms of which 7 ms to minimize.
[2024-06-01 15:26:13] [INFO ] Deduced a trap composed of 216 places in 423 ms of which 7 ms to minimize.
[2024-06-01 15:26:13] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:26:13] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:26:13] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 5 ms to minimize.
[2024-06-01 15:26:13] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:26:20] [INFO ] Deduced a trap composed of 68 places in 5433 ms of which 5 ms to minimize.
[2024-06-01 15:26:20] [INFO ] Deduced a trap composed of 109 places in 379 ms of which 4 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1946 variables, and 59 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1391/1391 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:26:42] [INFO ] Deduced a trap composed of 74 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:26:48] [INFO ] Deduced a trap composed of 388 places in 309 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/1946 variables, and 61 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1391 constraints, Known Traps: 17/17 constraints]
After SMT, in 63174ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 63213ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105994 ms. Remains : 573/573 places, 1393/1393 transitions.
Support contains 11 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1393/1393 transitions.
Applied a total of 0 rules in 5 ms. Remains 573 /573 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
Running 1391 sub problems to find dead transitions.
[2024-06-01 15:26:56] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:26:56] [INFO ] Invariant cache hit.
[2024-06-01 15:26:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 48 places in 325 ms of which 3 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 216 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:27:13] [INFO ] Deduced a trap composed of 68 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:27:13] [INFO ] Deduced a trap composed of 109 places in 322 ms of which 3 ms to minimize.
[2024-06-01 15:27:15] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1946 variables, and 59 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1391/1391 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:27:34] [INFO ] Deduced a trap composed of 74 places in 222 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/1946 variables, and 60 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1391 constraints, Known Traps: 16/16 constraints]
After SMT, in 42405ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 42436ms
[2024-06-01 15:27:38] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:27:38] [INFO ] Invariant cache hit.
[2024-06-01 15:27:39] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-06-01 15:27:39] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:27:39] [INFO ] Invariant cache hit.
[2024-06-01 15:27:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:27:56] [INFO ] Implicit Places using invariants and state equation in 17100 ms returned []
Implicit Place search using SMT with State Equation took 17802 ms to find 0 implicit places.
Running 1391 sub problems to find dead transitions.
[2024-06-01 15:27:56] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-06-01 15:27:56] [INFO ] Invariant cache hit.
[2024-06-01 15:27:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:28:10] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:28:10] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:28:10] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:28:10] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:28:10] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:28:10] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:28:10] [INFO ] Deduced a trap composed of 48 places in 375 ms of which 4 ms to minimize.
[2024-06-01 15:28:11] [INFO ] Deduced a trap composed of 216 places in 372 ms of which 4 ms to minimize.
[2024-06-01 15:28:11] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:28:11] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:28:11] [INFO ] Deduced a trap composed of 59 places in 234 ms of which 2 ms to minimize.
[2024-06-01 15:28:12] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:28:13] [INFO ] Deduced a trap composed of 68 places in 349 ms of which 3 ms to minimize.
[2024-06-01 15:28:13] [INFO ] Deduced a trap composed of 109 places in 332 ms of which 3 ms to minimize.
[2024-06-01 15:28:14] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 372 places in 275 ms of which 3 ms to minimize.
[2024-06-01 15:28:25] [INFO ] Deduced a trap composed of 245 places in 331 ms of which 3 ms to minimize.
[2024-06-01 15:28:26] [INFO ] Deduced a trap composed of 259 places in 357 ms of which 3 ms to minimize.
[2024-06-01 15:28:26] [INFO ] Deduced a trap composed of 257 places in 293 ms of which 3 ms to minimize.
[2024-06-01 15:28:27] [INFO ] Deduced a trap composed of 247 places in 349 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:28:28] [INFO ] Deduced a trap composed of 207 places in 322 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 571/1946 variables, and 65 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1391/1391 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/1946 variables, and 66 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1391 constraints, Known Traps: 22/22 constraints]
After SMT, in 62487ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 62503ms
Finished structural reductions in LTL mode , in 1 iterations and 122754 ms. Remains : 573/573 places, 1393/1393 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-06 finished in 432387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 15:28:59] [INFO ] Flatten gal took : 161 ms
[2024-06-01 15:28:59] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 15:28:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 823 places, 1642 transitions and 7131 arcs took 24 ms.
Total runtime 2389242 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-LTLCardinality-01
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717256048562

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S02J06T10-LTLCardinality-01
ltl formula formula --ltl=/tmp/4170/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 823 places, 1642 transitions and 7131 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4170/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4170/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.050 user 0.130 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4170/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4170/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 837 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 824, there are 1648 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2466 levels ~10000 states ~19332 transitions
pnml2lts-mc( 0/ 4): ~4904 levels ~20000 states ~42320 transitions
pnml2lts-mc( 3/ 4): ~9601 levels ~40000 states ~75584 transitions
pnml2lts-mc( 3/ 4): ~19238 levels ~80000 states ~155056 transitions
pnml2lts-mc( 3/ 4): ~37489 levels ~160000 states ~303900 transitions
pnml2lts-mc( 0/ 4): ~75560 levels ~320000 states ~700252 transitions
pnml2lts-mc( 3/ 4): ~117268 levels ~640000 states ~1088916 transitions
pnml2lts-mc( 1/ 4): ~231223 levels ~1280000 states ~2578288 transitions
pnml2lts-mc( 2/ 4): ~390309 levels ~2560000 states ~4363856 transitions
pnml2lts-mc( 1/ 4): ~806087 levels ~5120000 states ~10441780 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11340
pnml2lts-mc( 0/ 4): unique states count: 6004176
pnml2lts-mc( 0/ 4): unique transitions count: 11295557
pnml2lts-mc( 0/ 4): - self-loop count: 945
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1729982
pnml2lts-mc( 0/ 4): - claim success count: 6004223
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3795566
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6004225 states 11295673 transitions, fanout: 1.881
pnml2lts-mc( 0/ 4): Total exploration time 306.370 sec (306.320 sec minimum, 306.342 sec on average)
pnml2lts-mc( 0/ 4): States per second: 19598, Transitions per second: 36869
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 133.6MB, 15.4 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 27.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1672 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 133.6MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S02J06T10-LTLCardinality-06
ltl formula formula --ltl=/tmp/4170/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 823 places, 1642 transitions and 7131 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.080 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4170/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4170/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4170/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4170/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 838 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 824, there are 1646 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 10
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 14
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14 states 24 transitions, fanout: 1.714
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 171.6 B/state, compr.: 5.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1672 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S02J06T10-LTLCardinality-07
ltl formula formula --ltl=/tmp/4170/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 823 places, 1642 transitions and 7131 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.060 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4170/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4170/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4170/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4170/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 838 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 824, there are 1645 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~905!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 197
pnml2lts-mc( 0/ 4): unique states count: 2627
pnml2lts-mc( 0/ 4): unique transitions count: 5341
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 87
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 2636
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2439
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2636 states 5373 transitions, fanout: 2.038
pnml2lts-mc( 0/ 4): Total exploration time 0.220 sec (0.210 sec minimum, 0.215 sec on average)
pnml2lts-mc( 0/ 4): States per second: 11982, Transitions per second: 24423
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 42.8 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1672 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J06T10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446700259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T10.tgz
mv PolyORBLF-PT-S02J06T10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;