MCC'2024- Execution of r289-tajo-171654445500259

About the Execution of GreatSPN+red for PolyORBLF-PT-S02J06T10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
10283.516	3600000.00	7263760.00	555.90	F?FFFF??TFFTFFTT	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445500259.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 greatspnxred
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 r289-tajo-171654445500259
=====================================================================

--------------------
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 1716863292788

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:28:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 02:28:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:28:14] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-05-28 02:28:14] [INFO ] Transformed 844 places.
[2024-05-28 02:28:14] [INFO ] Transformed 1812 transitions.
[2024-05-28 02:28:14] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 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 114 ms. Remains 833 /844 variables (removed 11) and now considering 1642/1652 (removed 10) transitions.
Running 1640 sub problems to find dead transitions.
[2024-05-28 02:28:14] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 833 cols
[2024-05-28 02:28:14] [INFO ] Computed 57 invariants in 105 ms
[2024-05-28 02:28:15] [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-05-28 02:28:37] [INFO ] Deduced a trap composed of 23 places in 351 ms of which 40 ms to minimize.
[2024-05-28 02:28:37] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 2 ms to minimize.
SMT process timed out in 22909ms, After SMT, problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 22957ms
[2024-05-28 02:28:37] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
[2024-05-28 02:28:37] [INFO ] Invariant cache hit.
[2024-05-28 02:28:38] [INFO ] Implicit Places using invariants in 925 ms returned [105, 204, 255, 454, 530, 573, 576, 633, 787, 830]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 933 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 21 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 24083 ms. Remains : 823/844 places, 1642/1652 transitions.
Support contains 282 out of 823 places after structural reductions.
[2024-05-28 02:28:39] [INFO ] Flatten gal took : 210 ms
[2024-05-28 02:28:39] [INFO ] Flatten gal took : 144 ms
[2024-05-28 02:28:39] [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 40000 steps (10 resets) in 2764 ms. (14 steps per ms) remains 8/23 properties
BEST_FIRST walk for 40002 steps (8 resets) in 505 ms. (79 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (9 resets) in 307 ms. (129 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 276 ms. (144 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (12 resets) in 384 ms. (103 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (9 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
[2024-05-28 02:28:41] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 823 cols
[2024-05-28 02:28:41] [INFO ] Computed 47 invariants in 37 ms
[2024-05-28 02:28:41] [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-05-28 02:28:42] [INFO ] Deduced a trap composed of 73 places in 278 ms of which 5 ms to minimize.
[2024-05-28 02:28:42] [INFO ] Deduced a trap composed of 73 places in 221 ms of which 4 ms to minimize.
[2024-05-28 02:28:42] [INFO ] Deduced a trap composed of 73 places in 192 ms of which 4 ms to minimize.
[2024-05-28 02:28:42] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 2 ms to minimize.
[2024-05-28 02:28:42] [INFO ] Deduced a trap composed of 73 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:28:43] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-05-28 02:28:43] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
[2024-05-28 02:28:43] [INFO ] Deduced a trap composed of 73 places in 51 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 5020 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-05-28 02:28:47] [INFO ] Deduced a trap composed of 73 places in 469 ms of which 5 ms to minimize.
[2024-05-28 02:28:47] [INFO ] Deduced a trap composed of 416 places in 416 ms of which 5 ms to minimize.
[2024-05-28 02:28:47] [INFO ] Deduced a trap composed of 419 places in 438 ms of which 5 ms to minimize.
[2024-05-28 02:28:48] [INFO ] Deduced a trap composed of 73 places in 71 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 4478 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 9581ms 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 1 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 222 ms. Remains 533 /823 variables (removed 290) and now considering 1353/1642 (removed 289) transitions.
Running 1351 sub problems to find dead transitions.
[2024-05-28 02:28:51] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
// Phase 1: matrix 1333 rows 533 cols
[2024-05-28 02:28:51] [INFO ] Computed 46 invariants in 33 ms
[2024-05-28 02:28:51] [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-05-28 02:29:05] [INFO ] Deduced a trap composed of 43 places in 239 ms of which 3 ms to minimize.
[2024-05-28 02:29:05] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-28 02:29:05] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-28 02:29:05] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2024-05-28 02:29:05] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 2 ms to minimize.
[2024-05-28 02:29:05] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-28 02:29:05] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-28 02:29:05] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-28 02:29:05] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:29:06] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:29:06] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-28 02:29:06] [INFO ] Deduced a trap composed of 52 places in 318 ms of which 4 ms to minimize.
[2024-05-28 02:29:07] [INFO ] Deduced a trap composed of 81 places in 327 ms of which 3 ms to minimize.
[2024-05-28 02:29:09] [INFO ] Deduced a trap composed of 186 places in 242 ms of which 3 ms to minimize.
[2024-05-28 02:29:10] [INFO ] Deduced a trap composed of 332 places in 341 ms of which 5 ms to minimize.
[2024-05-28 02:29:11] [INFO ] Deduced a trap composed of 199 places in 338 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 20058 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-05-28 02:29:26] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 61 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20046 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: 17/17 constraints]
After SMT, in 42998ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 43011ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43237 ms. Remains : 533/823 places, 1353/1642 transitions.
RANDOM walk for 40000 steps (13 resets) in 515 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (9 resets) in 281 ms. (141 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 146202 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 1
Probabilistic random walk after 146202 steps, saw 96915 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-28 02:29:37] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 02:29:37] [INFO ] Invariant cache hit.
[2024-05-28 02:29:37] [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-05-28 02:29:37] [INFO ] Deduced a trap composed of 44 places in 403 ms of which 4 ms to minimize.
[2024-05-28 02:29:38] [INFO ] Deduced a trap composed of 44 places in 353 ms of which 4 ms to minimize.
[2024-05-28 02:29:38] [INFO ] Deduced a trap composed of 44 places in 294 ms of which 4 ms to minimize.
[2024-05-28 02:29:38] [INFO ] Deduced a trap composed of 44 places in 317 ms of which 5 ms to minimize.
[2024-05-28 02:29:39] [INFO ] Deduced a trap composed of 45 places in 277 ms of which 3 ms to minimize.
[2024-05-28 02:29:39] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 3 ms to minimize.
[2024-05-28 02:29:39] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-05-28 02:29:40] [INFO ] Deduced a trap composed of 44 places in 333 ms of which 3 ms to minimize.
[2024-05-28 02:29:40] [INFO ] Deduced a trap composed of 226 places in 294 ms of which 3 ms to minimize.
[2024-05-28 02:29:40] [INFO ] Deduced a trap composed of 209 places in 284 ms of which 3 ms to minimize.
[2024-05-28 02:29:41] [INFO ] Deduced a trap composed of 226 places in 396 ms of which 4 ms to minimize.
[2024-05-28 02:29:41] [INFO ] Deduced a trap composed of 44 places in 357 ms of which 4 ms to minimize.
[2024-05-28 02:29:41] [INFO ] Deduced a trap composed of 221 places in 300 ms of which 4 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 7757 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-05-28 02:29:45] [INFO ] Deduced a trap composed of 226 places in 394 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 4284 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 12055ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 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 40 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 42 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 38 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-05-28 02:29:49] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 02:29:49] [INFO ] Invariant cache hit.
[2024-05-28 02:29:50] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-28 02:29:50] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 02:29:50] [INFO ] Invariant cache hit.
[2024-05-28 02:29:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:30:06] [INFO ] Implicit Places using invariants and state equation in 16483 ms returned []
Implicit Place search using SMT with State Equation took 17150 ms to find 0 implicit places.
[2024-05-28 02:30:06] [INFO ] Redundant transitions in 87 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-05-28 02:30:06] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 02:30:06] [INFO ] Invariant cache hit.
[2024-05-28 02:30:06] [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-05-28 02:30:21] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-28 02:30:21] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:30:21] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:30:21] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:30:21] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-28 02:30:22] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 2 ms to minimize.
[2024-05-28 02:30:22] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:30:22] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2024-05-28 02:30:22] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:30:22] [INFO ] Deduced a trap composed of 182 places in 400 ms of which 4 ms to minimize.
[2024-05-28 02:30:23] [INFO ] Deduced a trap composed of 47 places in 388 ms of which 4 ms to minimize.
[2024-05-28 02:30:23] [INFO ] Deduced a trap composed of 85 places in 358 ms of which 4 ms to minimize.
[2024-05-28 02:30:23] [INFO ] Deduced a trap composed of 81 places in 321 ms of which 3 ms to minimize.
[2024-05-28 02:30:24] [INFO ] Deduced a trap composed of 78 places in 329 ms of which 4 ms to minimize.
[2024-05-28 02:30:24] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:30:25] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 3 ms to minimize.
[2024-05-28 02:30:25] [INFO ] Deduced a trap composed of 334 places in 298 ms of which 4 ms to minimize.
[2024-05-28 02:30:26] [INFO ] Deduced a trap composed of 334 places in 374 ms of which 4 ms to minimize.
[2024-05-28 02:30:26] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-28 02:30:28] [INFO ] Deduced a trap composed of 348 places in 345 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 02:30:29] [INFO ] Deduced a trap composed of 98 places in 188 ms of which 2 ms to minimize.
[2024-05-28 02:30:29] [INFO ] Deduced a trap composed of 203 places in 186 ms of which 3 ms to minimize.
[2024-05-28 02:30:31] [INFO ] Deduced a trap composed of 335 places in 322 ms of which 4 ms to minimize.
[2024-05-28 02:30:39] [INFO ] Deduced a trap composed of 227 places in 378 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 Real declared 531/1866 variables, and 68 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30030 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: 24/24 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, 24/68 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 02:30:53] [INFO ] Deduced a trap composed of 186 places in 336 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 69 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30024 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: 25/25 constraints]
After SMT, in 63326ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63337ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80629 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 130 ms. Remains 583 /823 variables (removed 240) and now considering 1403/1642 (removed 239) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 02:31:10] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
// Phase 1: matrix 1383 rows 583 cols
[2024-05-28 02:31:10] [INFO ] Computed 46 invariants in 41 ms
[2024-05-28 02:31:10] [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-05-28 02:31:24] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-05-28 02:31:24] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:31:24] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:31:24] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:31:24] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-28 02:31:24] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:31:25] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:31:25] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 0 ms to minimize.
[2024-05-28 02:31:25] [INFO ] Deduced a trap composed of 227 places in 287 ms of which 3 ms to minimize.
[2024-05-28 02:31:25] [INFO ] Deduced a trap composed of 246 places in 280 ms of which 4 ms to minimize.
[2024-05-28 02:31:25] [INFO ] Deduced a trap composed of 49 places in 292 ms of which 3 ms to minimize.
[2024-05-28 02:31:26] [INFO ] Deduced a trap composed of 50 places in 305 ms of which 3 ms to minimize.
[2024-05-28 02:31:26] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 2 ms to minimize.
[2024-05-28 02:31:27] [INFO ] Deduced a trap composed of 240 places in 367 ms of which 4 ms to minimize.
[2024-05-28 02:31:27] [INFO ] Deduced a trap composed of 387 places in 272 ms of which 3 ms to minimize.
[2024-05-28 02:31:27] [INFO ] Deduced a trap composed of 226 places in 282 ms of which 4 ms to minimize.
[2024-05-28 02:31:28] [INFO ] Deduced a trap composed of 78 places in 301 ms of which 3 ms to minimize.
[2024-05-28 02:31:28] [INFO ] Deduced a trap composed of 119 places in 288 ms of which 3 ms to minimize.
[2024-05-28 02:31:30] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 3 ms to minimize.
[2024-05-28 02:31:30] [INFO ] Deduced a trap composed of 79 places in 235 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 20030 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-05-28 02:31:52] [INFO ] Deduced a trap composed of 228 places in 403 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 20034 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 42563ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 42577ms
[2024-05-28 02:31:53] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-05-28 02:31:53] [INFO ] Invariant cache hit.
[2024-05-28 02:31:53] [INFO ] Implicit Places using invariants in 803 ms returned []
[2024-05-28 02:31:53] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-05-28 02:31:53] [INFO ] Invariant cache hit.
[2024-05-28 02:31:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:32:06] [INFO ] Implicit Places using invariants and state equation in 12800 ms returned []
Implicit Place search using SMT with State Equation took 13610 ms to find 0 implicit places.
[2024-05-28 02:32:06] [INFO ] Redundant transitions in 34 ms returned []
Running 1401 sub problems to find dead transitions.
[2024-05-28 02:32:06] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-05-28 02:32:06] [INFO ] Invariant cache hit.
[2024-05-28 02:32:06] [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-05-28 02:32:22] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
[2024-05-28 02:32:22] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 1 ms to minimize.
[2024-05-28 02:32:22] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
[2024-05-28 02:32:22] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2024-05-28 02:32:22] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-05-28 02:32:22] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-05-28 02:32:22] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:32:23] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 3 ms to minimize.
[2024-05-28 02:32:23] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 3 ms to minimize.
[2024-05-28 02:32:23] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
[2024-05-28 02:32:24] [INFO ] Deduced a trap composed of 283 places in 412 ms of which 5 ms to minimize.
[2024-05-28 02:32:24] [INFO ] Deduced a trap composed of 238 places in 389 ms of which 4 ms to minimize.
[2024-05-28 02:32:24] [INFO ] Deduced a trap composed of 217 places in 311 ms of which 3 ms to minimize.
[2024-05-28 02:32:24] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:32:25] [INFO ] Deduced a trap composed of 117 places in 366 ms of which 4 ms to minimize.
[2024-05-28 02:32:26] [INFO ] Deduced a trap composed of 284 places in 337 ms of which 4 ms to minimize.
[2024-05-28 02:32:26] [INFO ] Deduced a trap composed of 218 places in 350 ms of which 4 ms to minimize.
[2024-05-28 02:32:27] [INFO ] Deduced a trap composed of 72 places in 319 ms of which 4 ms to minimize.
[2024-05-28 02:32:29] [INFO ] Deduced a trap composed of 71 places in 242 ms of which 3 ms to minimize.
[2024-05-28 02:32:34] [INFO ] Deduced a trap composed of 382 places in 309 ms of which 7 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 30023 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 30045 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 62969ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 62989ms
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 119363 ms. Remains : 583/823 places, 1403/1642 transitions.
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) p1), p1]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-01
Product exploration explored 100000 steps with 32 reset in 642 ms.
Product exploration explored 100000 steps with 27 reset in 536 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 186 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 105 ms :[(AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (12 resets) in 850 ms. (47 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (9 resets) in 275 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 258 ms. (154 steps per ms) remains 2/2 properties
[2024-05-28 02:33:12] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-05-28 02:33:12] [INFO ] Invariant cache hit.
[2024-05-28 02:33:12] [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 1370 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-05-28 02:33:14] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 3 ms to minimize.
[2024-05-28 02:33:14] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 3 ms to minimize.
[2024-05-28 02:33:14] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:33:14] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-05-28 02:33:14] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-05-28 02:33:14] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:33:14] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:33:14] [INFO ] Deduced a trap composed of 49 places in 41 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1964/1966 variables, and 634 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3078 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 581/583 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 4473ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 67 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 52 ms. Remains 563 /583 variables (removed 20) and now considering 1383/1403 (removed 20) transitions.
Running 1381 sub problems to find dead transitions.
[2024-05-28 02:33:16] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
// Phase 1: matrix 1363 rows 563 cols
[2024-05-28 02:33:16] [INFO ] Computed 46 invariants in 17 ms
[2024-05-28 02:33:16] [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-05-28 02:33:32] [INFO ] Deduced a trap composed of 23 places in 341 ms of which 3 ms to minimize.
[2024-05-28 02:33:32] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-05-28 02:33:32] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:33:32] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:33:32] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-28 02:33:32] [INFO ] Deduced a trap composed of 47 places in 329 ms of which 4 ms to minimize.
[2024-05-28 02:33:33] [INFO ] Deduced a trap composed of 226 places in 262 ms of which 3 ms to minimize.
[2024-05-28 02:33:33] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2024-05-28 02:33:33] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:33:33] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:33:33] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-28 02:33:33] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-05-28 02:33:34] [INFO ] Deduced a trap composed of 113 places in 254 ms of which 3 ms to minimize.
[2024-05-28 02:33:34] [INFO ] Deduced a trap composed of 214 places in 305 ms of which 4 ms to minimize.
[2024-05-28 02:33:35] [INFO ] Deduced a trap composed of 218 places in 266 ms of which 3 ms to minimize.
[2024-05-28 02:33:35] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 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 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 4.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 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 1.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 9.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 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 8.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 20027 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-05-28 02:33:54] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 2 ms to minimize.
[2024-05-28 02:33:55] [INFO ] Deduced a trap composed of 378 places in 333 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 62 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20023 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: 18/18 constraints]
After SMT, in 43031ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 43045ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43101 ms. Remains : 563/583 places, 1383/1403 transitions.
RANDOM walk for 40000 steps (11 resets) in 495 ms. (80 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (11 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 100473 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 2
Probabilistic random walk after 100473 steps, saw 61511 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-28 02:34:03] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-05-28 02:34:03] [INFO ] Invariant cache hit.
[2024-05-28 02:34:03] [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-05-28 02:34:03] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 3 ms to minimize.
[2024-05-28 02:34:04] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 3 ms to minimize.
[2024-05-28 02:34:04] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 4 ms to minimize.
[2024-05-28 02:34:04] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:34:04] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-28 02:34:04] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 3 ms to minimize.
[2024-05-28 02:34:04] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:34:04] [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 3786 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-05-28 02:34:07] [INFO ] Deduced a trap composed of 47 places in 43 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-05-28 02:34:10] [INFO ] Deduced a trap composed of 234 places in 370 ms of which 5 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 4551 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 8381ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 114 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 96 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 96 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 31 ms. Remains 563 /563 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-05-28 02:34:11] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-05-28 02:34:11] [INFO ] Invariant cache hit.
[2024-05-28 02:34:12] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-28 02:34:12] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-05-28 02:34:12] [INFO ] Invariant cache hit.
[2024-05-28 02:34:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:34:29] [INFO ] Implicit Places using invariants and state equation in 16585 ms returned []
Implicit Place search using SMT with State Equation took 17250 ms to find 0 implicit places.
[2024-05-28 02:34:29] [INFO ] Redundant transitions in 110 ms returned []
Running 1381 sub problems to find dead transitions.
[2024-05-28 02:34:29] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-05-28 02:34:29] [INFO ] Invariant cache hit.
[2024-05-28 02:34:29] [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-05-28 02:34:44] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 3 ms to minimize.
[2024-05-28 02:34:44] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 3 ms to minimize.
[2024-05-28 02:34:44] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 6 ms to minimize.
[2024-05-28 02:34:45] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 3 ms to minimize.
[2024-05-28 02:34:45] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 3 ms to minimize.
[2024-05-28 02:34:45] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:34:45] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 2 ms to minimize.
[2024-05-28 02:34:45] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 2 ms to minimize.
[2024-05-28 02:34:45] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 2 ms to minimize.
[2024-05-28 02:34:46] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:34:46] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:34:46] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-28 02:34:46] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:34:46] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 0 ms to minimize.
[2024-05-28 02:34:46] [INFO ] Deduced a trap composed of 273 places in 254 ms of which 3 ms to minimize.
[2024-05-28 02:34:47] [INFO ] Deduced a trap composed of 109 places in 285 ms of which 3 ms to minimize.
[2024-05-28 02:34:48] [INFO ] Deduced a trap composed of 220 places in 335 ms of which 3 ms to minimize.
[2024-05-28 02:34:50] [INFO ] Deduced a trap composed of 353 places in 287 ms of which 4 ms to minimize.
[2024-05-28 02:34:52] [INFO ] Deduced a trap composed of 207 places in 385 ms of which 4 ms to minimize.
[2024-05-28 02:34:58] [INFO ] Deduced a trap composed of 242 places in 292 ms of which 3 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 30021 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-05-28 02:35:10] [INFO ] Deduced a trap composed of 207 places in 296 ms of which 4 ms to minimize.
[2024-05-28 02:35:16] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-28 02:35:16] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
[2024-05-28 02:35:17] [INFO ] Deduced a trap composed of 82 places in 250 ms of which 3 ms to minimize.
[2024-05-28 02:35:20] [INFO ] Deduced a trap composed of 251 places in 226 ms of which 4 ms to minimize.
[2024-05-28 02:35:21] [INFO ] Deduced a trap composed of 221 places in 292 ms of which 3 ms to minimize.
[2024-05-28 02:35:29] [INFO ] Deduced a trap composed of 330 places in 406 ms of which 5 ms to minimize.
[2024-05-28 02:35:30] [INFO ] Deduced a trap composed of 362 places in 263 ms of which 3 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 30046 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 63315ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 63346ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80752 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 180 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 95 ms :[(AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 120 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 35 ms. Remains 583 /583 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 02:35:33] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
// Phase 1: matrix 1383 rows 583 cols
[2024-05-28 02:35:33] [INFO ] Computed 46 invariants in 23 ms
[2024-05-28 02:35: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-05-28 02:35:47] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 49 places in 32 ms of which 0 ms to minimize.
[2024-05-28 02:35:48] [INFO ] Deduced a trap composed of 227 places in 373 ms of which 4 ms to minimize.
[2024-05-28 02:35:48] [INFO ] Deduced a trap composed of 246 places in 347 ms of which 4 ms to minimize.
[2024-05-28 02:35:48] [INFO ] Deduced a trap composed of 49 places in 278 ms of which 3 ms to minimize.
[2024-05-28 02:35:49] [INFO ] Deduced a trap composed of 50 places in 345 ms of which 3 ms to minimize.
[2024-05-28 02:35:49] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 2 ms to minimize.
[2024-05-28 02:35:50] [INFO ] Deduced a trap composed of 240 places in 276 ms of which 3 ms to minimize.
[2024-05-28 02:35:50] [INFO ] Deduced a trap composed of 387 places in 251 ms of which 3 ms to minimize.
[2024-05-28 02:35:50] [INFO ] Deduced a trap composed of 226 places in 348 ms of which 4 ms to minimize.
[2024-05-28 02:35:51] [INFO ] Deduced a trap composed of 78 places in 381 ms of which 4 ms to minimize.
[2024-05-28 02:35:51] [INFO ] Deduced a trap composed of 119 places in 260 ms of which 3 ms to minimize.
[2024-05-28 02:35:52] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 2 ms to minimize.
[2024-05-28 02:35:53] [INFO ] Deduced a trap composed of 79 places in 232 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 20026 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-05-28 02:36:13] [INFO ] Deduced a trap composed of 228 places in 365 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 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 43119ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 43139ms
[2024-05-28 02:36:16] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-05-28 02:36:16] [INFO ] Invariant cache hit.
[2024-05-28 02:36:16] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-05-28 02:36:16] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-05-28 02:36:16] [INFO ] Invariant cache hit.
[2024-05-28 02:36:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:36:29] [INFO ] Implicit Places using invariants and state equation in 12617 ms returned []
Implicit Place search using SMT with State Equation took 13209 ms to find 0 implicit places.
[2024-05-28 02:36:29] [INFO ] Redundant transitions in 73 ms returned []
Running 1401 sub problems to find dead transitions.
[2024-05-28 02:36:29] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-05-28 02:36:29] [INFO ] Invariant cache hit.
[2024-05-28 02:36:29] [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-05-28 02:36:42] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 3 ms to minimize.
[2024-05-28 02:36:43] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:36:43] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:36:43] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:36:43] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-28 02:36:43] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:36:43] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:36:43] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 3 ms to minimize.
[2024-05-28 02:36:43] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 2 ms to minimize.
[2024-05-28 02:36:43] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:36:44] [INFO ] Deduced a trap composed of 283 places in 314 ms of which 4 ms to minimize.
[2024-05-28 02:36:44] [INFO ] Deduced a trap composed of 238 places in 299 ms of which 3 ms to minimize.
[2024-05-28 02:36:45] [INFO ] Deduced a trap composed of 217 places in 291 ms of which 3 ms to minimize.
[2024-05-28 02:36:45] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:36:46] [INFO ] Deduced a trap composed of 117 places in 279 ms of which 3 ms to minimize.
[2024-05-28 02:36:46] [INFO ] Deduced a trap composed of 284 places in 423 ms of which 5 ms to minimize.
[2024-05-28 02:36:47] [INFO ] Deduced a trap composed of 218 places in 274 ms of which 4 ms to minimize.
[2024-05-28 02:36:48] [INFO ] Deduced a trap composed of 72 places in 386 ms of which 5 ms to minimize.
[2024-05-28 02:36:49] [INFO ] Deduced a trap composed of 71 places in 223 ms of which 3 ms to minimize.
[2024-05-28 02:36:54] [INFO ] Deduced a trap composed of 382 places in 363 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
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1966 variables, and 64 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30026 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-05-28 02:37:28] [INFO ] Deduced a trap composed of 23 places in 191 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 30031 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 62480ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 62494ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 118968 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 82 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 66 ms :[(AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (15 resets) in 490 ms. (81 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
[2024-05-28 02:37:32] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-05-28 02:37:32] [INFO ] Invariant cache hit.
[2024-05-28 02:37:32] [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 1215 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-05-28 02:37:34] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 2 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 3 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 1 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 2 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 49 places in 40 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 3206 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 4434ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 172 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 71 ms. Remains 563 /583 variables (removed 20) and now considering 1383/1403 (removed 20) transitions.
Running 1381 sub problems to find dead transitions.
[2024-05-28 02:37:37] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
// Phase 1: matrix 1363 rows 563 cols
[2024-05-28 02:37:37] [INFO ] Computed 46 invariants in 18 ms
[2024-05-28 02:37:37] [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-05-28 02:37:52] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 2 ms to minimize.
[2024-05-28 02:37:53] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2024-05-28 02:37:53] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:37:53] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-28 02:37:53] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-28 02:37:53] [INFO ] Deduced a trap composed of 47 places in 355 ms of which 3 ms to minimize.
[2024-05-28 02:37:54] [INFO ] Deduced a trap composed of 226 places in 336 ms of which 5 ms to minimize.
[2024-05-28 02:37:54] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:37:54] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-28 02:37:54] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:37:54] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
[2024-05-28 02:37:54] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:37:55] [INFO ] Deduced a trap composed of 113 places in 387 ms of which 4 ms to minimize.
[2024-05-28 02:37:56] [INFO ] Deduced a trap composed of 214 places in 331 ms of which 3 ms to minimize.
[2024-05-28 02:37:56] [INFO ] Deduced a trap composed of 218 places in 353 ms of which 3 ms to minimize.
[2024-05-28 02:37:57] [INFO ] Deduced a trap composed of 228 places in 364 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 561/1926 variables, and 60 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20025 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-05-28 02:38:15] [INFO ] Deduced a trap composed of 85 places in 243 ms of which 3 ms to minimize.
[2024-05-28 02:38:17] [INFO ] Deduced a trap composed of 378 places in 273 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 62 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20025 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: 18/18 constraints]
After SMT, in 43881ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 43899ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43975 ms. Remains : 563/583 places, 1383/1403 transitions.
RANDOM walk for 40000 steps (15 resets) in 767 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 256 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 258 ms. (154 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 101651 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 2
Probabilistic random walk after 101651 steps, saw 62153 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-28 02:38:24] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-05-28 02:38:24] [INFO ] Invariant cache hit.
[2024-05-28 02:38:24] [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-05-28 02:38:25] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 3 ms to minimize.
[2024-05-28 02:38:25] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
[2024-05-28 02:38:25] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:38:25] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 3 ms to minimize.
[2024-05-28 02:38:25] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2024-05-28 02:38:25] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 3 ms to minimize.
[2024-05-28 02:38:25] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:38:25] [INFO ] Deduced a trap composed of 47 places in 44 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 3410 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-05-28 02:38:28] [INFO ] Deduced a trap composed of 47 places in 55 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-05-28 02:38:31] [INFO ] Deduced a trap composed of 234 places in 376 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 4392 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 7817ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 178 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 71 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 71 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 69 ms. Remains 563 /563 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-05-28 02:38:32] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-05-28 02:38:32] [INFO ] Invariant cache hit.
[2024-05-28 02:38:33] [INFO ] Implicit Places using invariants in 825 ms returned []
[2024-05-28 02:38:33] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-05-28 02:38:33] [INFO ] Invariant cache hit.
[2024-05-28 02:38:34] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:38:49] [INFO ] Implicit Places using invariants and state equation in 16182 ms returned []
Implicit Place search using SMT with State Equation took 17021 ms to find 0 implicit places.
[2024-05-28 02:38:49] [INFO ] Redundant transitions in 58 ms returned []
Running 1381 sub problems to find dead transitions.
[2024-05-28 02:38:49] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-05-28 02:38:49] [INFO ] Invariant cache hit.
[2024-05-28 02:38:49] [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-05-28 02:39:03] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 2 ms to minimize.
[2024-05-28 02:39:03] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 2 ms to minimize.
[2024-05-28 02:39:03] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 5 ms to minimize.
[2024-05-28 02:39:03] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 3 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 3 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 109 places in 204 ms of which 3 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
[2024-05-28 02:39:05] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:39:05] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2024-05-28 02:39:05] [INFO ] Deduced a trap composed of 273 places in 253 ms of which 3 ms to minimize.
[2024-05-28 02:39:06] [INFO ] Deduced a trap composed of 109 places in 393 ms of which 3 ms to minimize.
[2024-05-28 02:39:07] [INFO ] Deduced a trap composed of 220 places in 361 ms of which 4 ms to minimize.
[2024-05-28 02:39:09] [INFO ] Deduced a trap composed of 353 places in 368 ms of which 4 ms to minimize.
[2024-05-28 02:39:11] [INFO ] Deduced a trap composed of 207 places in 397 ms of which 4 ms to minimize.
[2024-05-28 02:39:17] [INFO ] Deduced a trap composed of 242 places in 356 ms of which 4 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 30034 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-05-28 02:39:31] [INFO ] Deduced a trap composed of 207 places in 347 ms of which 5 ms to minimize.
[2024-05-28 02:39:38] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-28 02:39:38] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:39:39] [INFO ] Deduced a trap composed of 82 places in 342 ms of which 4 ms to minimize.
[2024-05-28 02:39:43] [INFO ] Deduced a trap composed of 251 places in 381 ms of which 4 ms to minimize.
[2024-05-28 02:39:44] [INFO ] Deduced a trap composed of 221 places in 701 ms of which 21 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 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: 0/1381 constraints, Known Traps: 26/26 constraints]
After SMT, in 63090ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 63108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80273 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 164 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 94 ms :[(AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 27 reset in 645 ms.
Product exploration explored 100000 steps with 36 reset in 674 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 37 ms. Remains 583 /583 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 02:39:54] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
// Phase 1: matrix 1383 rows 583 cols
[2024-05-28 02:39:54] [INFO ] Computed 46 invariants in 42 ms
[2024-05-28 02:39:54] [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-05-28 02:40:11] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:40:11] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:40:11] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-05-28 02:40:11] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:40:11] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:40:11] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:40:11] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 1 ms to minimize.
[2024-05-28 02:40:11] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:40:11] [INFO ] Deduced a trap composed of 227 places in 271 ms of which 4 ms to minimize.
[2024-05-28 02:40:12] [INFO ] Deduced a trap composed of 246 places in 380 ms of which 4 ms to minimize.
[2024-05-28 02:40:12] [INFO ] Deduced a trap composed of 49 places in 344 ms of which 5 ms to minimize.
[2024-05-28 02:40:13] [INFO ] Deduced a trap composed of 50 places in 379 ms of which 4 ms to minimize.
[2024-05-28 02:40:13] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2024-05-28 02:40:13] [INFO ] Deduced a trap composed of 240 places in 250 ms of which 3 ms to minimize.
[2024-05-28 02:40:13] [INFO ] Deduced a trap composed of 387 places in 253 ms of which 3 ms to minimize.
[2024-05-28 02:40:14] [INFO ] Deduced a trap composed of 226 places in 243 ms of which 2 ms to minimize.
[2024-05-28 02:40:15] [INFO ] Deduced a trap composed of 78 places in 335 ms of which 18 ms to minimize.
[2024-05-28 02:40:15] [INFO ] Deduced a trap composed of 119 places in 256 ms of which 3 ms to minimize.
[2024-05-28 02:40:16] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 3 ms to minimize.
[2024-05-28 02:40:17] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 2 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 20037 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-05-28 02:40:36] [INFO ] Deduced a trap composed of 228 places in 310 ms of which 5 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 20027 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 42986ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 42997ms
[2024-05-28 02:40:37] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-05-28 02:40:37] [INFO ] Invariant cache hit.
[2024-05-28 02:40:38] [INFO ] Implicit Places using invariants in 597 ms returned []
[2024-05-28 02:40:38] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-05-28 02:40:38] [INFO ] Invariant cache hit.
[2024-05-28 02:40:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:40:49] [INFO ] Implicit Places using invariants and state equation in 11512 ms returned []
Implicit Place search using SMT with State Equation took 12123 ms to find 0 implicit places.
[2024-05-28 02:40:49] [INFO ] Redundant transitions in 24 ms returned []
Running 1401 sub problems to find dead transitions.
[2024-05-28 02:40:50] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-05-28 02:40:50] [INFO ] Invariant cache hit.
[2024-05-28 02:40:50] [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-05-28 02:41:05] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-28 02:41:05] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-05-28 02:41:05] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-05-28 02:41:05] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 0 ms to minimize.
[2024-05-28 02:41:05] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:41:06] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:41:06] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 0 ms to minimize.
[2024-05-28 02:41:06] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 3 ms to minimize.
[2024-05-28 02:41:06] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 3 ms to minimize.
[2024-05-28 02:41:06] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-28 02:41:07] [INFO ] Deduced a trap composed of 283 places in 377 ms of which 4 ms to minimize.
[2024-05-28 02:41:07] [INFO ] Deduced a trap composed of 238 places in 360 ms of which 5 ms to minimize.
[2024-05-28 02:41:07] [INFO ] Deduced a trap composed of 217 places in 328 ms of which 4 ms to minimize.
[2024-05-28 02:41:07] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-05-28 02:41:08] [INFO ] Deduced a trap composed of 117 places in 321 ms of which 3 ms to minimize.
[2024-05-28 02:41:09] [INFO ] Deduced a trap composed of 284 places in 353 ms of which 4 ms to minimize.
[2024-05-28 02:41:09] [INFO ] Deduced a trap composed of 218 places in 326 ms of which 4 ms to minimize.
[2024-05-28 02:41:10] [INFO ] Deduced a trap composed of 72 places in 346 ms of which 4 ms to minimize.
[2024-05-28 02:41:12] [INFO ] Deduced a trap composed of 71 places in 238 ms of which 3 ms to minimize.
[2024-05-28 02:41:17] [INFO ] Deduced a trap composed of 382 places in 362 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
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.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 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 2.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 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 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.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 5.0)
(s114 (/ 1.0 2.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 0.0)
(s141 0.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 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 (/ 1.0 2.0))
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 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 1.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 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 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 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 (/ 1.0 2.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 1.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 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.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 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 1.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 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.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 timeout
5.0 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 30022 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 30034 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 62984ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 63034ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 118244 ms. Remains : 583/583 places, 1403/1403 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-01 finished in 642838 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 29 ms. Remains 812 /823 variables (removed 11) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-28 02:41:53] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-05-28 02:41:53] [INFO ] Computed 46 invariants in 24 ms
[2024-05-28 02:41: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-05-28 02:42:13] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 5 ms to minimize.
[2024-05-28 02:42:13] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-05-28 02:42:13] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-28 02:42:13] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 1 ms to minimize.
[2024-05-28 02:42:13] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:42:13] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:42:13] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:42:13] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:42:14] [INFO ] Deduced a trap composed of 198 places in 481 ms of which 5 ms to minimize.
[2024-05-28 02:42:14] [INFO ] Deduced a trap composed of 72 places in 350 ms of which 5 ms to minimize.
[2024-05-28 02:42:15] [INFO ] Deduced a trap composed of 203 places in 417 ms of which 4 ms to minimize.
[2024-05-28 02:42:15] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:42:15] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
SMT process timed out in 22525ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22539ms
[2024-05-28 02:42:15] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:42:15] [INFO ] Invariant cache hit.
[2024-05-28 02:42:16] [INFO ] Implicit Places using invariants in 845 ms returned []
[2024-05-28 02:42:16] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:42:16] [INFO ] Invariant cache hit.
[2024-05-28 02:42:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:42:36] [INFO ] Implicit Places using invariants and state equation in 20175 ms returned []
Implicit Place search using SMT with State Equation took 21024 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-28 02:42:36] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:42:36] [INFO ] Invariant cache hit.
[2024-05-28 02:42:36] [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-05-28 02:42:56] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 4 ms to minimize.
[2024-05-28 02:42:56] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 1 ms to minimize.
[2024-05-28 02:42:56] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:42:57] [INFO ] Deduced a trap composed of 72 places in 495 ms of which 6 ms to minimize.
[2024-05-28 02:42:57] [INFO ] Deduced a trap composed of 427 places in 442 ms of which 5 ms to minimize.
[2024-05-28 02:42:58] [INFO ] Deduced a trap composed of 72 places in 392 ms of which 5 ms to minimize.
[2024-05-28 02:42:58] [INFO ] Deduced a trap composed of 461 places in 333 ms of which 4 ms to minimize.
[2024-05-28 02:42:58] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 1 ms to minimize.
[2024-05-28 02:42:58] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-05-28 02:42:59] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2024-05-28 02:42:59] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:42:59] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-05-28 02:42:59] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:42:59] [INFO ] Deduced a trap composed of 206 places in 414 ms of which 5 ms to minimize.
[2024-05-28 02:43:00] [INFO ] Deduced a trap composed of 81 places in 202 ms of which 3 ms to minimize.
[2024-05-28 02:43:04] [INFO ] Deduced a trap composed of 422 places in 390 ms of which 5 ms to minimize.
[2024-05-28 02:43:06] [INFO ] Deduced a trap composed of 66 places in 332 ms of which 4 ms to minimize.
[2024-05-28 02:43:08] [INFO ] Deduced a trap composed of 432 places in 467 ms of which 6 ms to minimize.
[2024-05-28 02:43:09] [INFO ] Deduced a trap composed of 436 places in 394 ms of which 4 ms to minimize.
[2024-05-28 02:43:09] [INFO ] Deduced a trap composed of 400 places in 347 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 64 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30025 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: 20/20 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, 20/64 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 02:43:35] [INFO ] Deduced a trap composed of 142 places in 518 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 65 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30032 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: 21/21 constraints]
After SMT, in 63199ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 63219ms
Starting structural reductions in LTL mode, iteration 1 : 812/823 places, 1632/1642 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106823 ms. Remains : 812/823 places, 1632/1642 transitions.
Stuttering acceptance computed with spot in 504 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 40932 steps with 536 reset in 350 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-04 finished in 107728 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 36 ms. Remains 812 /823 variables (removed 11) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-28 02:43:41] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:43:41] [INFO ] Invariant cache hit.
[2024-05-28 02:43:41] [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-05-28 02:44:03] [INFO ] Deduced a trap composed of 23 places in 610 ms of which 19 ms to minimize.
[2024-05-28 02:44:03] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:44:03] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 47 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20037 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: 3/3 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, 3/47 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 47 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20052 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: 3/3 constraints]
After SMT, in 42873ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42895ms
[2024-05-28 02:44:23] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:44:23] [INFO ] Invariant cache hit.
[2024-05-28 02:44:24] [INFO ] Implicit Places using invariants in 850 ms returned []
[2024-05-28 02:44:24] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:44:24] [INFO ] Invariant cache hit.
[2024-05-28 02:44:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:44:45] [INFO ] Implicit Places using invariants and state equation in 20916 ms returned []
Implicit Place search using SMT with State Equation took 21769 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-28 02:44:45] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:44:45] [INFO ] Invariant cache hit.
[2024-05-28 02:44:45] [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-05-28 02:45:10] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 5 ms to minimize.
[2024-05-28 02:45:10] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-05-28 02:45:10] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-28 02:45:11] [INFO ] Deduced a trap composed of 72 places in 525 ms of which 6 ms to minimize.
[2024-05-28 02:45:11] [INFO ] Deduced a trap composed of 427 places in 408 ms of which 4 ms to minimize.
[2024-05-28 02:45:12] [INFO ] Deduced a trap composed of 72 places in 327 ms of which 4 ms to minimize.
[2024-05-28 02:45:12] [INFO ] Deduced a trap composed of 461 places in 329 ms of which 4 ms to minimize.
[2024-05-28 02:45:12] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:45:12] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-05-28 02:45:12] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 2 ms to minimize.
[2024-05-28 02:45:12] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:45:13] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:45:13] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 1 ms to minimize.
[2024-05-28 02:45:14] [INFO ] Deduced a trap composed of 206 places in 452 ms of which 6 ms to minimize.
[2024-05-28 02:45:14] [INFO ] Deduced a trap composed of 81 places in 354 ms of which 4 ms to minimize.
[2024-05-28 02:45:18] [INFO ] Deduced a trap composed of 422 places in 532 ms of which 9 ms to minimize.
SMT process timed out in 33268ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 33282ms
Starting structural reductions in LTL mode, iteration 1 : 812/823 places, 1632/1642 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97993 ms. Remains : 812/823 places, 1632/1642 transitions.
Stuttering acceptance computed with spot in 172 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 455 ms.
Product exploration explored 100000 steps with 25000 reset in 474 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 127 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 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 237 steps (0 resets) in 7 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 144 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 227 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 212 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 17 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-28 02:45:21] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:45:21] [INFO ] Invariant cache hit.
[2024-05-28 02:45:21] [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
SMT process timed out in 22677ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22694ms
[2024-05-28 02:45:43] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:45:43] [INFO ] Invariant cache hit.
[2024-05-28 02:45:44] [INFO ] Implicit Places using invariants in 807 ms returned []
[2024-05-28 02:45:44] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:45:44] [INFO ] Invariant cache hit.
[2024-05-28 02:45:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:46:08] [INFO ] Implicit Places using invariants and state equation in 23749 ms returned []
Implicit Place search using SMT with State Equation took 24575 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-28 02:46:08] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:46:08] [INFO ] Invariant cache hit.
[2024-05-28 02:46:08] [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-05-28 02:46:30] [INFO ] Deduced a trap composed of 23 places in 439 ms of which 8 ms to minimize.
[2024-05-28 02:46:30] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 3 ms to minimize.
[2024-05-28 02:46:30] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 3 ms to minimize.
[2024-05-28 02:46:31] [INFO ] Deduced a trap composed of 72 places in 517 ms of which 6 ms to minimize.
[2024-05-28 02:46:32] [INFO ] Deduced a trap composed of 427 places in 722 ms of which 36 ms to minimize.
[2024-05-28 02:46:32] [INFO ] Deduced a trap composed of 72 places in 697 ms of which 21 ms to minimize.
[2024-05-28 02:46:33] [INFO ] Deduced a trap composed of 461 places in 519 ms of which 5 ms to minimize.
[2024-05-28 02:46:33] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:46:33] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2024-05-28 02:46:33] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 1 ms to minimize.
[2024-05-28 02:46:34] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:46:34] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-28 02:46:34] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:46:35] [INFO ] Deduced a trap composed of 206 places in 511 ms of which 6 ms to minimize.
[2024-05-28 02:46:36] [INFO ] Deduced a trap composed of 81 places in 346 ms of which 7 ms to minimize.
[2024-05-28 02:46:40] [INFO ] Deduced a trap composed of 422 places in 511 ms of which 6 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 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.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 2.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 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 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 1.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 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 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 7.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 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 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 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 30033 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-05-28 02:47:08] [INFO ] Deduced a trap composed of 588 places in 539 ms of which 7 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 30045 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 63480ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 63496ms
Finished structural reductions in LTL mode , in 1 iterations and 110797 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 126 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)]
RANDOM walk for 423 steps (0 resets) in 10 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 157 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 316 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 465 ms.
Product exploration explored 100000 steps with 25000 reset in 604 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 217 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 159 ms. Remains 783 /812 variables (removed 29) and now considering 1713/1632 (removed -81) transitions.
Running 1711 sub problems to find dead transitions.
[2024-05-28 02:47:15] [INFO ] Flow matrix only has 1693 transitions (discarded 20 similar events)
// Phase 1: matrix 1693 rows 783 cols
[2024-05-28 02:47:15] [INFO ] Computed 46 invariants in 41 ms
[2024-05-28 02:47:15] [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-05-28 02:47:35] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:47:36] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-28 02:47:36] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 2 ms to minimize.
[2024-05-28 02:47:36] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:47:36] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-05-28 02:47:36] [INFO ] Deduced a trap composed of 34 places in 508 ms of which 5 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-28 02:47:37] [INFO ] Deduced a trap composed of 216 places in 445 ms of which 5 ms to minimize.
[2024-05-28 02:47:37] [INFO ] Deduced a trap composed of 111 places in 465 ms of which 6 ms to minimize.
[2024-05-28 02:47:38] [INFO ] Deduced a trap composed of 48 places in 399 ms of which 4 ms to minimize.
[2024-05-28 02:47:38] [INFO ] Deduced a trap composed of 34 places in 350 ms of which 5 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-28 02:47:39] [INFO ] Deduced a trap composed of 48 places in 368 ms of which 5 ms to minimize.
SMT process timed out in 23986ms, After SMT, problems are : Problem set: 0 solved, 1711 unsolved
Search for dead transitions found 0 dead transitions in 24007ms
[2024-05-28 02:47:39] [INFO ] Redundant transitions in 37 ms returned []
Running 1711 sub problems to find dead transitions.
[2024-05-28 02:47:39] [INFO ] Flow matrix only has 1693 transitions (discarded 20 similar events)
[2024-05-28 02:47:39] [INFO ] Invariant cache hit.
[2024-05-28 02:47:39] [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-05-28 02:48:00] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 2 ms to minimize.
[2024-05-28 02:48:00] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-05-28 02:48:00] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-05-28 02:48:00] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-05-28 02:48:00] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-05-28 02:48:00] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
[2024-05-28 02:48:01] [INFO ] Deduced a trap composed of 316 places in 495 ms of which 6 ms to minimize.
[2024-05-28 02:48:01] [INFO ] Deduced a trap composed of 34 places in 488 ms of which 6 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-28 02:48:02] [INFO ] Deduced a trap composed of 34 places in 477 ms of which 5 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-28 02:48:02] [INFO ] Deduced a trap composed of 49 places in 493 ms of which 6 ms to minimize.
[2024-05-28 02:48:03] [INFO ] Deduced a trap composed of 377 places in 494 ms of which 6 ms to minimize.
[2024-05-28 02:48:04] [INFO ] Deduced a trap composed of 34 places in 505 ms of which 5 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-28 02:48:04] [INFO ] Deduced a trap composed of 49 places in 735 ms of which 20 ms to minimize.
[2024-05-28 02:48:05] [INFO ] Deduced a trap composed of 48 places in 664 ms of which 20 ms to minimize.
[2024-05-28 02:48:06] [INFO ] Deduced a trap composed of 34 places in 686 ms of which 9 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-28 02:48:06] [INFO ] Deduced a trap composed of 49 places in 80 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-05-28 02:48:07] [INFO ] Deduced a trap composed of 216 places in 662 ms of which 9 ms to minimize.
[2024-05-28 02:48:08] [INFO ] Deduced a trap composed of 109 places in 682 ms of which 20 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-05-28 02:48:09] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 3 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-05-28 02:48:10] [INFO ] Deduced a trap composed of 23 places in 352 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
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/64 constraints. Problems are: Problem set: 267 solved, 1444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/2476 variables, and 64 constraints, problems are : Problem set: 267 solved, 1444 unsolved in 30033 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: 20/20 constraints]
Escalating to Integer solving :Problem set: 267 solved, 1444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 8/8 constraints. Problems are: Problem set: 267 solved, 1444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 13/21 constraints. Problems are: Problem set: 267 solved, 1444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 20/41 constraints. Problems are: Problem set: 267 solved, 1444 unsolved
[2024-05-28 02:48:13] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/42 constraints. Problems are: Problem set: 267 solved, 1444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 0/42 constraints. Problems are: Problem set: 267 solved, 1444 unsolved
At refinement iteration 5 (OVERLAPS) 70/694 variables, 7/49 constraints. Problems are: Problem set: 267 solved, 1444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 8/57 constraints. Problems are: Problem set: 267 solved, 1444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 694/2476 variables, and 57 constraints, problems are : Problem set: 267 solved, 1444 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/31 constraints, State Equation: 0/783 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1711 constraints, Known Traps: 21/21 constraints]
After SMT, in 63406ms problems are : Problem set: 267 solved, 1444 unsolved
Search for dead transitions found 267 dead transitions in 63422ms
Found 267 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 267 transitions
Dead transitions reduction (with SMT) removed 267 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 783/812 places, 1446/1632 transitions.
Graph (complete) has 3870 edges and 783 vertex of which 626 are kept as prefixes of interest. Removing 157 places using SCC suffix rule.4 ms
Discarding 157 places :
Also discarding 0 output transitions
Deduced a syphon composed of 53 places in 2 ms
Applied a total of 1 rules in 49 ms. Remains 626 /783 variables (removed 157) and now considering 1446/1446 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 626/812 places, 1446/1632 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87694 ms. Remains : 626/812 places, 1446/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 20 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-28 02:48:42] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-05-28 02:48:42] [INFO ] Computed 46 invariants in 46 ms
[2024-05-28 02:48:42] [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-05-28 02:49:02] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 4 ms to minimize.
[2024-05-28 02:49:02] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 4 ms to minimize.
[2024-05-28 02:49:02] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:49:02] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-05-28 02:49:02] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 1 ms to minimize.
[2024-05-28 02:49:03] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 1 ms to minimize.
[2024-05-28 02:49:03] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-28 02:49:03] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-05-28 02:49:04] [INFO ] Deduced a trap composed of 198 places in 488 ms of which 5 ms to minimize.
[2024-05-28 02:49:04] [INFO ] Deduced a trap composed of 72 places in 553 ms of which 6 ms to minimize.
[2024-05-28 02:49:05] [INFO ] Deduced a trap composed of 203 places in 512 ms of which 5 ms to minimize.
[2024-05-28 02:49:05] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 0 ms to minimize.
[2024-05-28 02:49:05] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 1 ms to minimize.
SMT process timed out in 23060ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23080ms
[2024-05-28 02:49:05] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:49:05] [INFO ] Invariant cache hit.
[2024-05-28 02:49:06] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-05-28 02:49:06] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:49:06] [INFO ] Invariant cache hit.
[2024-05-28 02:49:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:49:27] [INFO ] Implicit Places using invariants and state equation in 20886 ms returned []
Implicit Place search using SMT with State Equation took 21780 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-28 02:49:27] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:49:27] [INFO ] Invariant cache hit.
[2024-05-28 02:49: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-05-28 02:49:48] [INFO ] Deduced a trap composed of 23 places in 350 ms of which 4 ms to minimize.
[2024-05-28 02:49:48] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-05-28 02:49:48] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-05-28 02:49:49] [INFO ] Deduced a trap composed of 72 places in 485 ms of which 5 ms to minimize.
[2024-05-28 02:49:49] [INFO ] Deduced a trap composed of 427 places in 474 ms of which 4 ms to minimize.
[2024-05-28 02:49:50] [INFO ] Deduced a trap composed of 72 places in 494 ms of which 8 ms to minimize.
[2024-05-28 02:49:50] [INFO ] Deduced a trap composed of 461 places in 428 ms of which 4 ms to minimize.
[2024-05-28 02:49:50] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 0 ms to minimize.
[2024-05-28 02:49:50] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:49:51] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-05-28 02:49:51] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:49:51] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:49:51] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:49:52] [INFO ] Deduced a trap composed of 206 places in 450 ms of which 5 ms to minimize.
[2024-05-28 02:49:52] [INFO ] Deduced a trap composed of 81 places in 334 ms of which 4 ms to minimize.
[2024-05-28 02:49:57] [INFO ] Deduced a trap composed of 422 places in 573 ms of which 5 ms to minimize.
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 30079 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-05-28 02:50:26] [INFO ] Deduced a trap composed of 588 places in 516 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 30042 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 62930ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62956ms
Finished structural reductions in LTL mode , in 1 iterations and 107853 ms. Remains : 812/812 places, 1632/1632 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-06 finished in 409651 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 3 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 163 ms. Remains 623 /823 variables (removed 200) and now considering 1443/1642 (removed 199) transitions.
Running 1441 sub problems to find dead transitions.
[2024-05-28 02:50:30] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
// Phase 1: matrix 1423 rows 623 cols
[2024-05-28 02:50:30] [INFO ] Computed 46 invariants in 40 ms
[2024-05-28 02:50:30] [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-05-28 02:50:47] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 1 ms to minimize.
[2024-05-28 02:50:47] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:50:47] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-05-28 02:50:47] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 2 ms to minimize.
[2024-05-28 02:50:47] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-05-28 02:50:47] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 0 ms to minimize.
[2024-05-28 02:50:47] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:50:48] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 1 ms to minimize.
[2024-05-28 02:50:48] [INFO ] Deduced a trap composed of 266 places in 535 ms of which 7 ms to minimize.
[2024-05-28 02:50:48] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:50:49] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:50:50] [INFO ] Deduced a trap composed of 89 places in 442 ms of which 5 ms to minimize.
[2024-05-28 02:50:51] [INFO ] Deduced a trap composed of 58 places in 311 ms of which 3 ms to minimize.
[2024-05-28 02:50:53] [INFO ] Deduced a trap composed of 24 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 58 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 20028 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: 14/14 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, 14/58 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
[2024-05-28 02:51:12] [INFO ] Deduced a trap composed of 58 places in 189 ms of which 2 ms to minimize.
[2024-05-28 02:51:12] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 3 ms to minimize.
[2024-05-28 02:51:12] [INFO ] Deduced a trap composed of 108 places in 252 ms of which 2 ms to minimize.
[2024-05-28 02:51:12] [INFO ] Deduced a trap composed of 37 places in 312 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 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 43222ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 43242ms
[2024-05-28 02:51:14] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-05-28 02:51:14] [INFO ] Invariant cache hit.
[2024-05-28 02:51:14] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-28 02:51:14] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-05-28 02:51:14] [INFO ] Invariant cache hit.
[2024-05-28 02:51:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:51:29] [INFO ] Implicit Places using invariants and state equation in 14685 ms returned []
Implicit Place search using SMT with State Equation took 15296 ms to find 0 implicit places.
[2024-05-28 02:51:29] [INFO ] Redundant transitions in 26 ms returned []
Running 1441 sub problems to find dead transitions.
[2024-05-28 02:51:29] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-05-28 02:51:29] [INFO ] Invariant cache hit.
[2024-05-28 02:51:29] [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-05-28 02:51:46] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 2 ms to minimize.
[2024-05-28 02:51:46] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:51:46] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 2 ms to minimize.
[2024-05-28 02:51:46] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:51:46] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 1 ms to minimize.
[2024-05-28 02:51:46] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:51:46] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:51:47] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:51:47] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 1 ms to minimize.
[2024-05-28 02:51:47] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 1 ms to minimize.
[2024-05-28 02:51:48] [INFO ] Deduced a trap composed of 276 places in 467 ms of which 5 ms to minimize.
[2024-05-28 02:51:49] [INFO ] Deduced a trap composed of 89 places in 439 ms of which 4 ms to minimize.
[2024-05-28 02:51:50] [INFO ] Deduced a trap composed of 67 places in 326 ms of which 3 ms to minimize.
[2024-05-28 02:51:51] [INFO ] Deduced a trap composed of 450 places in 430 ms of which 4 ms to minimize.
[2024-05-28 02:51:51] [INFO ] Deduced a trap composed of 448 places in 379 ms of which 4 ms to minimize.
[2024-05-28 02:51:52] [INFO ] Deduced a trap composed of 301 places in 409 ms of which 4 ms to minimize.
[2024-05-28 02:51:52] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 4 ms to minimize.
[2024-05-28 02:52:00] [INFO ] Deduced a trap composed of 438 places in 431 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2046 variables, and 62 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: 18/18 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, 18/62 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
[2024-05-28 02:52:18] [INFO ] Deduced a trap composed of 266 places in 381 ms of which 4 ms to minimize.
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 30028 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 62509ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 62524ms
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 121270 ms. Remains : 623/823 places, 1443/1642 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-07
Product exploration explored 100000 steps with 2422 reset in 587 ms.
Product exploration explored 100000 steps with 2437 reset in 794 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 81 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 98 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 82 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 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 30 ms. Remains 623 /623 variables (removed 0) and now considering 1443/1443 (removed 0) transitions.
Running 1441 sub problems to find dead transitions.
[2024-05-28 02:52:33] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-05-28 02:52:33] [INFO ] Invariant cache hit.
[2024-05-28 02:52:33] [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-05-28 02:52:49] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 2 ms to minimize.
[2024-05-28 02:52:49] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 2 ms to minimize.
[2024-05-28 02:52:49] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:52:49] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-28 02:52:49] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2024-05-28 02:52:49] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 ms to minimize.
[2024-05-28 02:52:49] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:52:49] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-05-28 02:52:49] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:52:50] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-28 02:52:50] [INFO ] Deduced a trap composed of 276 places in 388 ms of which 5 ms to minimize.
[2024-05-28 02:52:51] [INFO ] Deduced a trap composed of 89 places in 304 ms of which 4 ms to minimize.
[2024-05-28 02:52:52] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 3 ms to minimize.
[2024-05-28 02:52:53] [INFO ] Deduced a trap composed of 450 places in 281 ms of which 3 ms to minimize.
[2024-05-28 02:52:53] [INFO ] Deduced a trap composed of 448 places in 382 ms of which 4 ms to minimize.
[2024-05-28 02:52:54] [INFO ] Deduced a trap composed of 301 places in 391 ms of which 4 ms to minimize.
[2024-05-28 02:52:54] [INFO ] Deduced a trap composed of 23 places in 337 ms of which 6 ms to minimize.
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 20033 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-05-28 02:53:11] [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 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: 0/1441 constraints, Known Traps: 18/18 constraints]
After SMT, in 42591ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 42610ms
[2024-05-28 02:53:16] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-05-28 02:53:16] [INFO ] Invariant cache hit.
[2024-05-28 02:53:16] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-28 02:53:16] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-05-28 02:53:16] [INFO ] Invariant cache hit.
[2024-05-28 02:53:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:53:32] [INFO ] Implicit Places using invariants and state equation in 15145 ms returned []
Implicit Place search using SMT with State Equation took 15725 ms to find 0 implicit places.
[2024-05-28 02:53:32] [INFO ] Redundant transitions in 35 ms returned []
Running 1441 sub problems to find dead transitions.
[2024-05-28 02:53:32] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-05-28 02:53:32] [INFO ] Invariant cache hit.
[2024-05-28 02:53:32] [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-05-28 02:53:48] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 4 ms to minimize.
[2024-05-28 02:53:48] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-05-28 02:53:48] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 1 ms to minimize.
[2024-05-28 02:53:48] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:53:48] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 4 ms to minimize.
[2024-05-28 02:53:48] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:53:48] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:53:48] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:53:48] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-05-28 02:53:49] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 0 ms to minimize.
[2024-05-28 02:53:49] [INFO ] Deduced a trap composed of 276 places in 356 ms of which 5 ms to minimize.
[2024-05-28 02:53:50] [INFO ] Deduced a trap composed of 89 places in 383 ms of which 4 ms to minimize.
[2024-05-28 02:53:51] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 3 ms to minimize.
[2024-05-28 02:53:52] [INFO ] Deduced a trap composed of 450 places in 390 ms of which 5 ms to minimize.
[2024-05-28 02:53:52] [INFO ] Deduced a trap composed of 448 places in 372 ms of which 4 ms to minimize.
[2024-05-28 02:53:53] [INFO ] Deduced a trap composed of 301 places in 382 ms of which 4 ms to minimize.
[2024-05-28 02:53:54] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 4 ms to minimize.
[2024-05-28 02:54:00] [INFO ] Deduced a trap composed of 438 places in 404 ms of which 5 ms to minimize.
[2024-05-28 02:54:04] [INFO ] Deduced a trap composed of 267 places in 369 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 30027 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
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 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(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 1)
(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 0)
(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 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 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 1)
(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 1)
(s193 0)
(s194 1)
(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 10)
(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 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 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 1)
(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 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 1)
(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 1)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 1)
(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 1)
(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 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(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 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 63 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30028 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 63004ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 63025ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121450 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 131 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 127 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 97 steps (0 resets) in 7 ms. (12 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 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2445 reset in 673 ms.
Product exploration explored 100000 steps with 2412 reset in 588 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 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-05-28 02:54:37] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-05-28 02:54:37] [INFO ] Invariant cache hit.
[2024-05-28 02:54:37] [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-05-28 02:54:52] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 3 ms to minimize.
[2024-05-28 02:54:52] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
[2024-05-28 02:54:52] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-28 02:54:53] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-05-28 02:54:53] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2024-05-28 02:54:53] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:54:53] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:54:53] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:54:53] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 0 ms to minimize.
[2024-05-28 02:54:53] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 0 ms to minimize.
[2024-05-28 02:54:54] [INFO ] Deduced a trap composed of 276 places in 355 ms of which 4 ms to minimize.
[2024-05-28 02:54:55] [INFO ] Deduced a trap composed of 89 places in 331 ms of which 4 ms to minimize.
[2024-05-28 02:54:56] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 3 ms to minimize.
[2024-05-28 02:54:57] [INFO ] Deduced a trap composed of 450 places in 261 ms of which 3 ms to minimize.
[2024-05-28 02:54:57] [INFO ] Deduced a trap composed of 448 places in 275 ms of which 3 ms to minimize.
[2024-05-28 02:54:58] [INFO ] Deduced a trap composed of 301 places in 377 ms of which 4 ms to minimize.
[2024-05-28 02:54:58] [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 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-05-28 02:55:13] [INFO ] Deduced a trap composed of 266 places in 423 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 20038 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 42821ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 42834ms
[2024-05-28 02:55:19] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-05-28 02:55:19] [INFO ] Invariant cache hit.
[2024-05-28 02:55:20] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-28 02:55:20] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-05-28 02:55:20] [INFO ] Invariant cache hit.
[2024-05-28 02:55:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:55:35] [INFO ] Implicit Places using invariants and state equation in 14378 ms returned []
Implicit Place search using SMT with State Equation took 15046 ms to find 0 implicit places.
[2024-05-28 02:55:35] [INFO ] Redundant transitions in 36 ms returned []
Running 1441 sub problems to find dead transitions.
[2024-05-28 02:55:35] [INFO ] Flow matrix only has 1423 transitions (discarded 20 similar events)
[2024-05-28 02:55:35] [INFO ] Invariant cache hit.
[2024-05-28 02:55:35] [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-05-28 02:55:51] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 2 ms to minimize.
[2024-05-28 02:55:51] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2024-05-28 02:55:51] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:55:51] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 1 ms to minimize.
[2024-05-28 02:55:51] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-28 02:55:51] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:55:51] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-28 02:55:51] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-28 02:55:51] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:55:52] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:55:52] [INFO ] Deduced a trap composed of 276 places in 327 ms of which 4 ms to minimize.
[2024-05-28 02:55:53] [INFO ] Deduced a trap composed of 89 places in 294 ms of which 4 ms to minimize.
[2024-05-28 02:55:54] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 2 ms to minimize.
[2024-05-28 02:55:55] [INFO ] Deduced a trap composed of 450 places in 327 ms of which 3 ms to minimize.
[2024-05-28 02:55:55] [INFO ] Deduced a trap composed of 448 places in 399 ms of which 5 ms to minimize.
[2024-05-28 02:55:56] [INFO ] Deduced a trap composed of 301 places in 398 ms of which 4 ms to minimize.
[2024-05-28 02:55:56] [INFO ] Deduced a trap composed of 23 places in 341 ms of which 4 ms to minimize.
[2024-05-28 02:56:04] [INFO ] Deduced a trap composed of 438 places in 355 ms of which 6 ms to minimize.
[2024-05-28 02:56:07] [INFO ] Deduced a trap composed of 267 places in 256 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 30027 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 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: 0/1441 constraints, Known Traps: 19/19 constraints]
After SMT, in 63170ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 63184ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121146 ms. Remains : 623/623 places, 1443/1443 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-07 finished in 367722 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 1 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 0 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 69 ms. Remains 555 /823 variables (removed 268) and now considering 1375/1642 (removed 267) transitions.
Running 1373 sub problems to find dead transitions.
[2024-05-28 02:56:38] [INFO ] Flow matrix only has 1355 transitions (discarded 20 similar events)
// Phase 1: matrix 1355 rows 555 cols
[2024-05-28 02:56:38] [INFO ] Computed 46 invariants in 14 ms
[2024-05-28 02:56:38] [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-05-28 02:56:51] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-28 02:56:51] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-05-28 02:56:51] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 0 ms to minimize.
[2024-05-28 02:56:52] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-05-28 02:56:52] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2024-05-28 02:56:52] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 2 ms to minimize.
[2024-05-28 02:56:52] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:56:52] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:56:52] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:56:52] [INFO ] Deduced a trap composed of 50 places in 372 ms of which 5 ms to minimize.
[2024-05-28 02:56:53] [INFO ] Deduced a trap composed of 90 places in 387 ms of which 4 ms to minimize.
[2024-05-28 02:56:53] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2024-05-28 02:56:54] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 3 ms to minimize.
[2024-05-28 02:56:55] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 2 ms to minimize.
[2024-05-28 02:56:55] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
[2024-05-28 02:56:58] [INFO ] Deduced a trap composed of 199 places in 328 ms of which 3 ms to minimize.
[2024-05-28 02:56:58] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 3 ms to minimize.
[2024-05-28 02:57:00] [INFO ] Deduced a trap composed of 383 places in 348 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1910 variables, and 62 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 20026 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: 18/18 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, 18/62 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/1910 variables, and 62 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 20028 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: 18/18 constraints]
After SMT, in 42831ms problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 42841ms
[2024-05-28 02:57:21] [INFO ] Flow matrix only has 1355 transitions (discarded 20 similar events)
[2024-05-28 02:57:21] [INFO ] Invariant cache hit.
[2024-05-28 02:57:21] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-05-28 02:57:21] [INFO ] Flow matrix only has 1355 transitions (discarded 20 similar events)
[2024-05-28 02:57:21] [INFO ] Invariant cache hit.
[2024-05-28 02:57:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:57:36] [INFO ] Implicit Places using invariants and state equation in 14215 ms returned []
Implicit Place search using SMT with State Equation took 14894 ms to find 0 implicit places.
[2024-05-28 02:57:36] [INFO ] Redundant transitions in 24 ms returned []
Running 1373 sub problems to find dead transitions.
[2024-05-28 02:57:36] [INFO ] Flow matrix only has 1355 transitions (discarded 20 similar events)
[2024-05-28 02:57:36] [INFO ] Invariant cache hit.
[2024-05-28 02:57:36] [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-05-28 02:57:49] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
[2024-05-28 02:57:49] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-28 02:57:50] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:57:50] [INFO ] Deduced a trap composed of 46 places in 365 ms of which 5 ms to minimize.
[2024-05-28 02:57:50] [INFO ] Deduced a trap composed of 46 places in 337 ms of which 5 ms to minimize.
[2024-05-28 02:57:51] [INFO ] Deduced a trap composed of 197 places in 330 ms of which 3 ms to minimize.
[2024-05-28 02:57:51] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 2 ms to minimize.
[2024-05-28 02:57:51] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 0 ms to minimize.
[2024-05-28 02:57:51] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 2 ms to minimize.
[2024-05-28 02:57:52] [INFO ] Deduced a trap composed of 46 places in 378 ms of which 4 ms to minimize.
[2024-05-28 02:57:52] [INFO ] Deduced a trap composed of 197 places in 354 ms of which 4 ms to minimize.
[2024-05-28 02:57:52] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:57:52] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:57:52] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:57:53] [INFO ] Deduced a trap composed of 50 places in 386 ms of which 4 ms to minimize.
[2024-05-28 02:57:54] [INFO ] Deduced a trap composed of 94 places in 351 ms of which 4 ms to minimize.
[2024-05-28 02:57:54] [INFO ] Deduced a trap composed of 205 places in 347 ms of which 4 ms to minimize.
[2024-05-28 02:57:54] [INFO ] Deduced a trap composed of 88 places in 371 ms of which 3 ms to minimize.
[2024-05-28 02:58:00] [INFO ] Deduced a trap composed of 211 places in 353 ms of which 4 ms to minimize.
[2024-05-28 02:58:02] [INFO ] Deduced a trap composed of 367 places in 357 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-05-28 02:58:05] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1910 variables, and 65 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30025 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-05-28 02:58:32] [INFO ] Deduced a trap composed of 354 places in 349 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 30023 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 63031ms problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 63049ms
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 120899 ms. Remains : 555/823 places, 1375/1642 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-09
Stuttering criterion allowed to conclude after 1528 steps with 0 reset in 8 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-09 finished in 121013 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 77 ms. Remains 564 /823 variables (removed 259) and now considering 1384/1642 (removed 258) transitions.
Running 1382 sub problems to find dead transitions.
[2024-05-28 02:58:39] [INFO ] Flow matrix only has 1364 transitions (discarded 20 similar events)
// Phase 1: matrix 1364 rows 564 cols
[2024-05-28 02:58:39] [INFO ] Computed 46 invariants in 17 ms
[2024-05-28 02:58:39] [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-05-28 02:58:52] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:58:52] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:58:52] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:58:52] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:58:52] [INFO ] Deduced a trap composed of 197 places in 256 ms of which 4 ms to minimize.
[2024-05-28 02:58:52] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 3 ms to minimize.
[2024-05-28 02:58:53] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 3 ms to minimize.
[2024-05-28 02:58:53] [INFO ] Deduced a trap composed of 47 places in 339 ms of which 4 ms to minimize.
[2024-05-28 02:58:53] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 3 ms to minimize.
[2024-05-28 02:58:54] [INFO ] Deduced a trap composed of 47 places in 366 ms of which 4 ms to minimize.
[2024-05-28 02:58:54] [INFO ] Deduced a trap composed of 206 places in 346 ms of which 4 ms to minimize.
[2024-05-28 02:58:54] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-05-28 02:58:54] [INFO ] Deduced a trap composed of 47 places in 29 ms of which 1 ms to minimize.
[2024-05-28 02:58:55] [INFO ] Deduced a trap composed of 101 places in 254 ms of which 3 ms to minimize.
[2024-05-28 02:58:57] [INFO ] Deduced a trap composed of 127 places in 186 ms of which 2 ms to minimize.
[2024-05-28 02:58:58] [INFO ] Deduced a trap composed of 376 places in 257 ms of which 3 ms to minimize.
[2024-05-28 02:59:00] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 2 ms to minimize.
[2024-05-28 02:59:00] [INFO ] Deduced a trap composed of 76 places in 255 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1928 variables, and 62 constraints, problems are : Problem set: 0 solved, 1382 unsolved in 20033 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: 18/18 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, 18/62 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 62 constraints, problems are : Problem set: 0 solved, 1382 unsolved in 20024 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: 18/18 constraints]
After SMT, in 42084ms problems are : Problem set: 0 solved, 1382 unsolved
Search for dead transitions found 0 dead transitions in 42097ms
[2024-05-28 02:59:21] [INFO ] Flow matrix only has 1364 transitions (discarded 20 similar events)
[2024-05-28 02:59:21] [INFO ] Invariant cache hit.
[2024-05-28 02:59:22] [INFO ] Implicit Places using invariants in 731 ms returned []
[2024-05-28 02:59:22] [INFO ] Flow matrix only has 1364 transitions (discarded 20 similar events)
[2024-05-28 02:59:22] [INFO ] Invariant cache hit.
[2024-05-28 02:59:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:59:33] [INFO ] Implicit Places using invariants and state equation in 10997 ms returned []
Implicit Place search using SMT with State Equation took 11733 ms to find 0 implicit places.
[2024-05-28 02:59:33] [INFO ] Redundant transitions in 26 ms returned []
Running 1382 sub problems to find dead transitions.
[2024-05-28 02:59:33] [INFO ] Flow matrix only has 1364 transitions (discarded 20 similar events)
[2024-05-28 02:59:33] [INFO ] Invariant cache hit.
[2024-05-28 02:59:33] [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-05-28 02:59:46] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-28 02:59:46] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-05-28 02:59:47] [INFO ] Deduced a trap composed of 48 places in 322 ms of which 4 ms to minimize.
[2024-05-28 02:59:47] [INFO ] Deduced a trap composed of 47 places in 332 ms of which 3 ms to minimize.
[2024-05-28 02:59:47] [INFO ] Deduced a trap composed of 47 places in 312 ms of which 4 ms to minimize.
[2024-05-28 02:59:48] [INFO ] Deduced a trap composed of 47 places in 390 ms of which 4 ms to minimize.
[2024-05-28 02:59:48] [INFO ] Deduced a trap composed of 206 places in 307 ms of which 4 ms to minimize.
[2024-05-28 02:59:48] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 2 ms to minimize.
[2024-05-28 02:59:48] [INFO ] Deduced a trap composed of 216 places in 252 ms of which 3 ms to minimize.
[2024-05-28 02:59:49] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:59:49] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:59:49] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:59:49] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2024-05-28 02:59:50] [INFO ] Deduced a trap composed of 58 places in 290 ms of which 3 ms to minimize.
[2024-05-28 02:59:50] [INFO ] Deduced a trap composed of 101 places in 272 ms of which 3 ms to minimize.
[2024-05-28 02:59:54] [INFO ] Deduced a trap composed of 109 places in 194 ms of which 3 ms to minimize.
[2024-05-28 02:59:56] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 2 ms to minimize.
[2024-05-28 03:00:02] [INFO ] Deduced a trap composed of 366 places in 411 ms of which 3 ms to minimize.
[2024-05-28 03:00:02] [INFO ] Deduced a trap composed of 373 places in 366 ms of which 4 ms to minimize.
[2024-05-28 03:00:03] [INFO ] Deduced a trap composed of 364 places in 372 ms of which 4 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 30023 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
[2024-05-28 03:00:36] [INFO ] Deduced a trap composed of 363 places in 322 ms of which 4 ms to minimize.
SMT process timed out in 63006ms, After SMT, problems are : Problem set: 0 solved, 1382 unsolved
Search for dead transitions found 0 dead transitions in 63018ms
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 116969 ms. Remains : 564/823 places, 1384/1642 transitions.
Stuttering acceptance computed with spot in 175 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 9000 steps with 17 reset in 68 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-10 finished in 117231 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 44 ms. Remains 813 /823 variables (removed 10) and now considering 1633/1642 (removed 9) transitions.
Running 1631 sub problems to find dead transitions.
[2024-05-28 03:00:36] [INFO ] Flow matrix only has 1613 transitions (discarded 20 similar events)
// Phase 1: matrix 1613 rows 813 cols
[2024-05-28 03:00:36] [INFO ] Computed 46 invariants in 52 ms
[2024-05-28 03:00:36] [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-05-28 03:00:58] [INFO ] Deduced a trap composed of 72 places in 310 ms of which 4 ms to minimize.
[2024-05-28 03:00:58] [INFO ] Deduced a trap composed of 72 places in 295 ms of which 5 ms to minimize.
[2024-05-28 03:00:58] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 4 ms to minimize.
[2024-05-28 03:00:58] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 2 ms to minimize.
[2024-05-28 03:00:59] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 2 ms to minimize.
[2024-05-28 03:00:59] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-28 03:00:59] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 2 ms to minimize.
[2024-05-28 03:00:59] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-05-28 03:00:59] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 03:00:59] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.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 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 7.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 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 1.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 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 10.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 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 6.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 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 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.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 1.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 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.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 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.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 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.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 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 4.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 9.0)
(s712 0.0)
(s713 1.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 1.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 1.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/2426 variables, and 54 constraints, problems are : Problem set: 0 solved, 1631 unsolved in 20049 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: 10/10 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, 10/54 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/2426 variables, and 54 constraints, problems are : Problem set: 0 solved, 1631 unsolved in 20061 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: 10/10 constraints]
After SMT, in 43261ms problems are : Problem set: 0 solved, 1631 unsolved
Search for dead transitions found 0 dead transitions in 43281ms
[2024-05-28 03:01:19] [INFO ] Flow matrix only has 1613 transitions (discarded 20 similar events)
[2024-05-28 03:01:19] [INFO ] Invariant cache hit.
[2024-05-28 03:01:20] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-28 03:01:20] [INFO ] Flow matrix only has 1613 transitions (discarded 20 similar events)
[2024-05-28 03:01:20] [INFO ] Invariant cache hit.
[2024-05-28 03:01:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:01:51] [INFO ] Performed 789/813 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 03:01:52] [INFO ] Implicit Places using invariants and state equation in 31371 ms returned []
Implicit Place search using SMT with State Equation took 32341 ms to find 0 implicit places.
Running 1631 sub problems to find dead transitions.
[2024-05-28 03:01:52] [INFO ] Flow matrix only has 1613 transitions (discarded 20 similar events)
[2024-05-28 03:01:52] [INFO ] Invariant cache hit.
[2024-05-28 03:01:52] [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-05-28 03:02:12] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 5 ms to minimize.
[2024-05-28 03:02:13] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-28 03:02:13] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 2 ms to minimize.
[2024-05-28 03:02:13] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-28 03:02:13] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-05-28 03:02:13] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-05-28 03:02:13] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-28 03:02:13] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-28 03:02:13] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-28 03:02:13] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-28 03:02:14] [INFO ] Deduced a trap composed of 72 places in 431 ms of which 6 ms to minimize.
[2024-05-28 03:02:15] [INFO ] Deduced a trap composed of 152 places in 412 ms of which 5 ms to minimize.
[2024-05-28 03:02:15] [INFO ] Deduced a trap composed of 201 places in 363 ms of which 4 ms to minimize.
[2024-05-28 03:02:16] [INFO ] Deduced a trap composed of 414 places in 385 ms of which 5 ms to minimize.
[2024-05-28 03:02:17] [INFO ] Deduced a trap composed of 414 places in 398 ms of which 5 ms to minimize.
[2024-05-28 03:02:18] [INFO ] Deduced a trap composed of 66 places in 363 ms of which 4 ms to minimize.
[2024-05-28 03:02:19] [INFO ] Deduced a trap composed of 99 places in 191 ms of which 3 ms to minimize.
[2024-05-28 03:02:20] [INFO ] Deduced a trap composed of 118 places in 204 ms of which 3 ms to minimize.
[2024-05-28 03:02:22] [INFO ] Deduced a trap composed of 423 places in 1088 ms of which 6 ms to minimize.
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 30026 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-05-28 03:02:52] [INFO ] Deduced a trap composed of 573 places in 582 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/2426 variables, and 64 constraints, problems are : Problem set: 0 solved, 1631 unsolved in 30071 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: 20/20 constraints]
After SMT, in 62944ms problems are : Problem set: 0 solved, 1631 unsolved
Search for dead transitions found 0 dead transitions in 62967ms
Starting structural reductions in LTL mode, iteration 1 : 813/823 places, 1633/1642 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138657 ms. Remains : 813/823 places, 1633/1642 transitions.
Stuttering acceptance computed with spot in 200 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 13118 steps with 0 reset in 66 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-12 finished in 138960 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 159 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 2 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 98 ms. Remains 573 /823 variables (removed 250) and now considering 1393/1642 (removed 249) transitions.
Running 1391 sub problems to find dead transitions.
[2024-05-28 03:02:56] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
// Phase 1: matrix 1373 rows 573 cols
[2024-05-28 03:02:56] [INFO ] Computed 46 invariants in 42 ms
[2024-05-28 03:02: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-05-28 03:03:10] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2024-05-28 03:03:10] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-05-28 03:03:10] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-28 03:03:10] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-28 03:03:10] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-28 03:03:10] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-28 03:03:10] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-28 03:03:11] [INFO ] Deduced a trap composed of 216 places in 334 ms of which 3 ms to minimize.
[2024-05-28 03:03:11] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-28 03:03:11] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2024-05-28 03:03:11] [INFO ] Deduced a trap composed of 68 places in 172 ms of which 2 ms to minimize.
[2024-05-28 03:03:11] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 0 ms to minimize.
[2024-05-28 03:03:12] [INFO ] Deduced a trap composed of 228 places in 385 ms of which 4 ms to minimize.
[2024-05-28 03:03:13] [INFO ] Deduced a trap composed of 113 places in 326 ms of which 4 ms to minimize.
[2024-05-28 03:03:19] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 3 ms to minimize.
SMT process timed out in 23098ms, After SMT, problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 23110ms
[2024-05-28 03:03:19] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:03:19] [INFO ] Invariant cache hit.
[2024-05-28 03:03:19] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-05-28 03:03:19] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:03:19] [INFO ] Invariant cache hit.
[2024-05-28 03:03:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:03:37] [INFO ] Implicit Places using invariants and state equation in 17916 ms returned []
Implicit Place search using SMT with State Equation took 18534 ms to find 0 implicit places.
Running 1391 sub problems to find dead transitions.
[2024-05-28 03:03:37] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:03:37] [INFO ] Invariant cache hit.
[2024-05-28 03:03:37] [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-05-28 03:03:51] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-05-28 03:03:51] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:03:51] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-28 03:03:51] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-28 03:03:51] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-28 03:03:51] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:03:52] [INFO ] Deduced a trap composed of 48 places in 369 ms of which 4 ms to minimize.
[2024-05-28 03:03:52] [INFO ] Deduced a trap composed of 216 places in 361 ms of which 4 ms to minimize.
[2024-05-28 03:03:52] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-28 03:03:52] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-28 03:03:52] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 3 ms to minimize.
[2024-05-28 03:03:53] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-28 03:03:54] [INFO ] Deduced a trap composed of 68 places in 383 ms of which 4 ms to minimize.
[2024-05-28 03:03:54] [INFO ] Deduced a trap composed of 109 places in 330 ms of which 3 ms to minimize.
[2024-05-28 03:03:56] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 2 ms to minimize.
[2024-05-28 03:04:02] [INFO ] Deduced a trap composed of 372 places in 358 ms of which 4 ms to minimize.
[2024-05-28 03:04:08] [INFO ] Deduced a trap composed of 245 places in 303 ms of which 3 ms to minimize.
[2024-05-28 03:04:08] [INFO ] Deduced a trap composed of 259 places in 288 ms of which 3 ms to minimize.
[2024-05-28 03:04:09] [INFO ] Deduced a trap composed of 257 places in 352 ms of which 3 ms to minimize.
[2024-05-28 03:04:09] [INFO ] Deduced a trap composed of 247 places in 376 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1946 variables, and 64 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 30026 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: 20/20 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, 20/64 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-05-28 03:04:19] [INFO ] Deduced a trap composed of 226 places in 386 ms of which 5 ms to minimize.
[2024-05-28 03:04:27] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 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 30026 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 62526ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 62544ms
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 104296 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 365 ms.
Product exploration explored 100000 steps with 25000 reset in 390 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 80 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 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 288 steps (0 resets) in 7 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 98 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 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 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 12 ms. Remains 573 /573 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
Running 1391 sub problems to find dead transitions.
[2024-05-28 03:04:41] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:04:41] [INFO ] Invariant cache hit.
[2024-05-28 03:04:41] [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-05-28 03:04:56] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-28 03:04:56] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-28 03:04:56] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-05-28 03:04:56] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2024-05-28 03:04:56] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-28 03:04:56] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-28 03:04:56] [INFO ] Deduced a trap composed of 48 places in 337 ms of which 4 ms to minimize.
[2024-05-28 03:04:57] [INFO ] Deduced a trap composed of 216 places in 350 ms of which 5 ms to minimize.
[2024-05-28 03:04:57] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-28 03:04:57] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-28 03:04:57] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 3 ms to minimize.
[2024-05-28 03:04:57] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-28 03:04:58] [INFO ] Deduced a trap composed of 68 places in 379 ms of which 4 ms to minimize.
[2024-05-28 03:04:59] [INFO ] Deduced a trap composed of 109 places in 345 ms of which 3 ms to minimize.
[2024-05-28 03:05:00] [INFO ] Deduced a trap composed of 37 places in 197 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 20023 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-05-28 03:05:21] [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 20043 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 43442ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 43465ms
[2024-05-28 03:05:25] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:05:25] [INFO ] Invariant cache hit.
[2024-05-28 03:05:25] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-28 03:05:25] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:05:25] [INFO ] Invariant cache hit.
[2024-05-28 03:05:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:05:44] [INFO ] Implicit Places using invariants and state equation in 18476 ms returned []
Implicit Place search using SMT with State Equation took 19103 ms to find 0 implicit places.
Running 1391 sub problems to find dead transitions.
[2024-05-28 03:05:44] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:05:44] [INFO ] Invariant cache hit.
[2024-05-28 03:05:44] [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-05-28 03:05:59] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2024-05-28 03:05:59] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:05:59] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-28 03:05:59] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 0 ms to minimize.
[2024-05-28 03:05:59] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-28 03:05:59] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:06:00] [INFO ] Deduced a trap composed of 48 places in 307 ms of which 3 ms to minimize.
[2024-05-28 03:06:00] [INFO ] Deduced a trap composed of 216 places in 311 ms of which 4 ms to minimize.
[2024-05-28 03:06:00] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-28 03:06:00] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 0 ms to minimize.
[2024-05-28 03:06:00] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 2 ms to minimize.
[2024-05-28 03:06:01] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:06:02] [INFO ] Deduced a trap composed of 68 places in 287 ms of which 4 ms to minimize.
[2024-05-28 03:06:02] [INFO ] Deduced a trap composed of 109 places in 274 ms of which 3 ms to minimize.
[2024-05-28 03:06:03] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
[2024-05-28 03:06:09] [INFO ] Deduced a trap composed of 372 places in 373 ms of which 5 ms to minimize.
[2024-05-28 03:06:15] [INFO ] Deduced a trap composed of 245 places in 309 ms of which 4 ms to minimize.
[2024-05-28 03:06:16] [INFO ] Deduced a trap composed of 259 places in 317 ms of which 4 ms to minimize.
[2024-05-28 03:06:16] [INFO ] Deduced a trap composed of 257 places in 388 ms of which 4 ms to minimize.
[2024-05-28 03:06:17] [INFO ] Deduced a trap composed of 247 places in 271 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1946 variables, and 64 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 30026 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: 20/20 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, 20/64 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-05-28 03:06:27] [INFO ] Deduced a trap composed of 226 places in 346 ms of which 3 ms to minimize.
[2024-05-28 03:06:35] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 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 30023 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 63301ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 63314ms
Finished structural reductions in LTL mode , in 1 iterations and 125906 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 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 225 steps (0 resets) in 5 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 93 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 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 406 ms.
Product exploration explored 100000 steps with 25000 reset in 416 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 161 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 27 ms. Remains 573 /573 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
Running 1391 sub problems to find dead transitions.
[2024-05-28 03:06:49] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:06:49] [INFO ] Invariant cache hit.
[2024-05-28 03:06:49] [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-05-28 03:07:03] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-28 03:07:03] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2024-05-28 03:07:03] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-05-28 03:07:03] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-05-28 03:07:04] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-28 03:07:04] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-28 03:07:04] [INFO ] Deduced a trap composed of 48 places in 279 ms of which 3 ms to minimize.
[2024-05-28 03:07:04] [INFO ] Deduced a trap composed of 216 places in 288 ms of which 3 ms to minimize.
[2024-05-28 03:07:04] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 0 ms to minimize.
[2024-05-28 03:07:04] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2024-05-28 03:07:05] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 2 ms to minimize.
[2024-05-28 03:07:05] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-28 03:07:06] [INFO ] Deduced a trap composed of 68 places in 267 ms of which 3 ms to minimize.
[2024-05-28 03:07:06] [INFO ] Deduced a trap composed of 109 places in 296 ms of which 3 ms to minimize.
[2024-05-28 03:07:07] [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 20022 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-05-28 03:07:28] [INFO ] Deduced a trap composed of 74 places in 287 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 20024 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 43091ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 43106ms
[2024-05-28 03:07:32] [INFO ] Redundant transitions in 26 ms returned []
Running 1391 sub problems to find dead transitions.
[2024-05-28 03:07:32] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:07:32] [INFO ] Invariant cache hit.
[2024-05-28 03:07:32] [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-05-28 03:07:46] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2024-05-28 03:07:46] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:07:46] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 0 ms to minimize.
[2024-05-28 03:07:46] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 0 ms to minimize.
[2024-05-28 03:07:46] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:07:46] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-28 03:07:46] [INFO ] Deduced a trap composed of 48 places in 298 ms of which 4 ms to minimize.
[2024-05-28 03:07:46] [INFO ] Deduced a trap composed of 216 places in 275 ms of which 4 ms to minimize.
[2024-05-28 03:07:47] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-28 03:07:47] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-28 03:07:47] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 2 ms to minimize.
[2024-05-28 03:07:47] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-28 03:07:48] [INFO ] Deduced a trap composed of 68 places in 361 ms of which 3 ms to minimize.
[2024-05-28 03:07:48] [INFO ] Deduced a trap composed of 109 places in 295 ms of which 4 ms to minimize.
[2024-05-28 03:07:50] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 3 ms to minimize.
[2024-05-28 03:07:55] [INFO ] Deduced a trap composed of 372 places in 265 ms of which 3 ms to minimize.
[2024-05-28 03:08:00] [INFO ] Deduced a trap composed of 245 places in 266 ms of which 3 ms to minimize.
[2024-05-28 03:08:01] [INFO ] Deduced a trap composed of 259 places in 295 ms of which 3 ms to minimize.
[2024-05-28 03:08:01] [INFO ] Deduced a trap composed of 257 places in 276 ms of which 3 ms to minimize.
[2024-05-28 03:08:02] [INFO ] Deduced a trap composed of 247 places in 277 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-05-28 03:08:03] [INFO ] Deduced a trap composed of 207 places in 339 ms of which 4 ms to minimize.
[2024-05-28 03:08:05] [INFO ] Deduced a trap composed of 226 places in 283 ms of which 3 ms to minimize.
SMT process timed out in 32687ms, After SMT, problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 32699ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75876 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 7 ms. Remains 573 /573 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
Running 1391 sub problems to find dead transitions.
[2024-05-28 03:08:05] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:08:05] [INFO ] Invariant cache hit.
[2024-05-28 03:08:05] [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-05-28 03:08:19] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-28 03:08:19] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:08:19] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-05-28 03:08:19] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-28 03:08:19] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 0 ms to minimize.
[2024-05-28 03:08:19] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-28 03:08:19] [INFO ] Deduced a trap composed of 48 places in 273 ms of which 3 ms to minimize.
[2024-05-28 03:08:20] [INFO ] Deduced a trap composed of 216 places in 283 ms of which 4 ms to minimize.
[2024-05-28 03:08:20] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2024-05-28 03:08:20] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 0 ms to minimize.
[2024-05-28 03:08:20] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 2 ms to minimize.
[2024-05-28 03:08:20] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 0 ms to minimize.
[2024-05-28 03:08:21] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 3 ms to minimize.
[2024-05-28 03:08:21] [INFO ] Deduced a trap composed of 109 places in 302 ms of which 4 ms to minimize.
[2024-05-28 03:08:23] [INFO ] Deduced a trap composed of 37 places in 153 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 20020 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-05-28 03:08:43] [INFO ] Deduced a trap composed of 74 places in 207 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 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: 0/1391 constraints, Known Traps: 16/16 constraints]
After SMT, in 42660ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 42675ms
[2024-05-28 03:08:48] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:08:48] [INFO ] Invariant cache hit.
[2024-05-28 03:08:48] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-05-28 03:08:48] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:08:48] [INFO ] Invariant cache hit.
[2024-05-28 03:08:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:09:06] [INFO ] Implicit Places using invariants and state equation in 17458 ms returned []
Implicit Place search using SMT with State Equation took 18053 ms to find 0 implicit places.
Running 1391 sub problems to find dead transitions.
[2024-05-28 03:09:06] [INFO ] Flow matrix only has 1373 transitions (discarded 20 similar events)
[2024-05-28 03:09:06] [INFO ] Invariant cache hit.
[2024-05-28 03:09:06] [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-05-28 03:09:19] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-05-28 03:09:20] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2024-05-28 03:09:20] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-28 03:09:20] [INFO ] Deduced a trap composed of 48 places in 29 ms of which 1 ms to minimize.
[2024-05-28 03:09:20] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-28 03:09:20] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 0 ms to minimize.
[2024-05-28 03:09:20] [INFO ] Deduced a trap composed of 48 places in 301 ms of which 3 ms to minimize.
[2024-05-28 03:09:20] [INFO ] Deduced a trap composed of 216 places in 283 ms of which 3 ms to minimize.
[2024-05-28 03:09:21] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 0 ms to minimize.
[2024-05-28 03:09:21] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-05-28 03:09:21] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 2 ms to minimize.
[2024-05-28 03:09:21] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-05-28 03:09:22] [INFO ] Deduced a trap composed of 68 places in 279 ms of which 3 ms to minimize.
[2024-05-28 03:09:22] [INFO ] Deduced a trap composed of 109 places in 279 ms of which 4 ms to minimize.
[2024-05-28 03:09:23] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-05-28 03:09:29] [INFO ] Deduced a trap composed of 372 places in 273 ms of which 3 ms to minimize.
[2024-05-28 03:09:35] [INFO ] Deduced a trap composed of 245 places in 270 ms of which 3 ms to minimize.
[2024-05-28 03:09:35] [INFO ] Deduced a trap composed of 259 places in 290 ms of which 4 ms to minimize.
[2024-05-28 03:09:35] [INFO ] Deduced a trap composed of 257 places in 274 ms of which 3 ms to minimize.
[2024-05-28 03:09:36] [INFO ] Deduced a trap composed of 247 places in 267 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-05-28 03:09:37] [INFO ] Deduced a trap composed of 207 places in 274 ms of which 4 ms to minimize.
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 30026 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-05-28 03:09:55] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 4 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 30019 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 62649ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 62664ms
Finished structural reductions in LTL mode , in 1 iterations and 123405 ms. Remains : 573/573 places, 1393/1393 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-06 finished in 433148 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-05-28 03:10:09] [INFO ] Flatten gal took : 147 ms
[2024-05-28 03:10:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 03:10:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 823 places, 1642 transitions and 7131 arcs took 11 ms.
Total runtime 2514996 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S02J06T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 823
TRANSITIONS: 1642
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.038s, Sys 0.000s]

SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]

----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 4246
MODEL NAME: /home/mcc/execution/415/model
823 places, 1642 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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="greatspnxred"
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 greatspnxred"
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 r289-tajo-171654445500259"
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 ;