Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 20K Apr 11 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 340K Apr 11 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 17:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 374K Apr 11 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 11 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 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 11M 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-S06J06T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717256258022

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:37:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:37:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:37:39] [INFO ] Load time of PNML (sax parser for PT used): 572 ms
[2024-06-01 15:37:40] [INFO ] Transformed 700 places.
[2024-06-01 15:37:40] [INFO ] Transformed 10740 transitions.
[2024-06-01 15:37:40] [INFO ] Parsed PT model containing 700 places and 10740 transitions and 89778 arcs in 787 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 204 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Applied a total of 6 rules in 136 ms. Remains 694 /700 variables (removed 6) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-06-01 15:37:40] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 694 cols
[2024-06-01 15:37:40] [INFO ] Computed 52 invariants in 241 ms
[2024-06-01 15:37:40] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 37820ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 37883ms
[2024-06-01 15:38:18] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 15:38:18] [INFO ] Invariant cache hit.
[2024-06-01 15:38:19] [INFO ] Implicit Places using invariants in 758 ms returned [64, 183, 469, 533, 669, 674]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 779 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 688/700 places, 2670/2670 transitions.
Applied a total of 0 rules in 27 ms. Remains 688 /688 variables (removed 0) and now considering 2670/2670 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38890 ms. Remains : 688/700 places, 2670/2670 transitions.
Support contains 204 out of 688 places after structural reductions.
[2024-06-01 15:38:19] [INFO ] Flatten gal took : 277 ms
[2024-06-01 15:38:19] [INFO ] Flatten gal took : 169 ms
[2024-06-01 15:38:20] [INFO ] Input system was already deterministic with 2670 transitions.
RANDOM walk for 40000 steps (258 resets) in 3053 ms. (13 steps per ms) remains 7/26 properties
BEST_FIRST walk for 40003 steps (125 resets) in 293 ms. (136 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (99 resets) in 308 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (82 resets) in 443 ms. (90 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (92 resets) in 770 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (74 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 324 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (83 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
[2024-06-01 15:38:22] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 688 cols
[2024-06-01 15:38:22] [INFO ] Computed 46 invariants in 106 ms
[2024-06-01 15:38:22] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 87/145 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/175 variables, 6/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 108/283 variables, 4/16 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 7 (OVERLAPS) 392/675 variables, 21/37 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 0/37 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/677 variables, 2/39 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/677 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 9/686 variables, 6/45 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-06-01 15:38:23] [INFO ] Deduced a trap composed of 94 places in 513 ms of which 37 ms to minimize.
[2024-06-01 15:38:23] [INFO ] Deduced a trap composed of 94 places in 506 ms of which 5 ms to minimize.
[2024-06-01 15:38:24] [INFO ] Deduced a trap composed of 94 places in 451 ms of which 4 ms to minimize.
[2024-06-01 15:38:24] [INFO ] Deduced a trap composed of 122 places in 425 ms of which 4 ms to minimize.
[2024-06-01 15:38:24] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 1 ms to minimize.
[2024-06-01 15:38:24] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 6/51 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 0/51 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3320/3322 variables, and 737 constraints, problems are : Problem set: 4 solved, 3 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 686/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/34 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 601/635 variables, 13/17 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/659 variables, 14/31 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 0/31 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 9 (OVERLAPS) 27/686 variables, 14/45 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/686 variables, 6/51 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-06-01 15:38:28] [INFO ] Deduced a trap composed of 94 places in 784 ms of which 4 ms to minimize.
[2024-06-01 15:38:29] [INFO ] Deduced a trap composed of 389 places in 757 ms of which 6 ms to minimize.
[2024-06-01 15:38:30] [INFO ] Deduced a trap composed of 395 places in 529 ms of which 4 ms to minimize.
[2024-06-01 15:38:30] [INFO ] Deduced a trap composed of 411 places in 491 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 4/55 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/55 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3320/3322 variables, and 741 constraints, problems are : Problem set: 5 solved, 2 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 686/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 10/10 constraints]
After SMT, in 10247ms problems are : Problem set: 5 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 688 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 688 transition count 2619
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 637 transition count 2618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 636 transition count 2618
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 104 place count 636 transition count 2533
Deduced a syphon composed of 85 places in 3 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 274 place count 551 transition count 2533
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 277 place count 548 transition count 2530
Iterating global reduction 3 with 3 rules applied. Total rules applied 280 place count 548 transition count 2530
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 422 place count 477 transition count 2459
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 434 place count 477 transition count 2447
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 446 place count 465 transition count 2447
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 447 place count 465 transition count 2447
Applied a total of 447 rules in 809 ms. Remains 465 /688 variables (removed 223) and now considering 2447/2670 (removed 223) transitions.
Running 2441 sub problems to find dead transitions.
[2024-06-01 15:38:33] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
// Phase 1: matrix 2411 rows 465 cols
[2024-06-01 15:38:33] [INFO ] Computed 46 invariants in 102 ms
[2024-06-01 15:38:33] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
[2024-06-01 15:39:14] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/2876 variables, and 36 constraints, problems are : Problem set: 0 solved, 2441 unsolved in 20114 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/465 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2441/1100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
[2024-06-01 15:39:22] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 5 ms to minimize.
[2024-06-01 15:39:23] [INFO ] Deduced a trap composed of 56 places in 653 ms of which 3 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 67 places in 687 ms of which 2 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 1 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:39:25] [INFO ] Deduced a trap composed of 29 places in 506 ms of which 1 ms to minimize.
[2024-06-01 15:39:26] [INFO ] Deduced a trap composed of 29 places in 467 ms of which 1 ms to minimize.
[2024-06-01 15:39:27] [INFO ] Deduced a trap composed of 32 places in 519 ms of which 4 ms to minimize.
[2024-06-01 15:39:27] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/2876 variables, and 46 constraints, problems are : Problem set: 0 solved, 2441 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/465 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1100 constraints, Known Traps: 11/11 constraints]
After SMT, in 61426ms problems are : Problem set: 0 solved, 2441 unsolved
Search for dead transitions found 0 dead transitions in 61479ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62309 ms. Remains : 465/688 places, 2447/2670 transitions.
RANDOM walk for 40000 steps (458 resets) in 972 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (131 resets) in 346 ms. (115 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (51 resets) in 286 ms. (139 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 74783 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 74783 steps, saw 36660 distinct states, run finished after 3005 ms. (steps per millisecond=24 ) properties seen :0
[2024-06-01 15:39:38] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
[2024-06-01 15:39:38] [INFO ] Invariant cache hit.
[2024-06-01 15:39:38] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 360/376 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/432 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 30/462 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:39:38] [INFO ] Deduced a trap composed of 57 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:39:38] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:39:38] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:39:39] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/463 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2411/2874 variables, 463/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2874 variables, 168/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:39:44] [INFO ] Deduced a trap composed of 37 places in 509 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2874 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2874 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/2876 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2876 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2876 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2876 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2876/2876 variables, and 684 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6452 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 465/465 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 360/376 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/432 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:39:45] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 1 ms to minimize.
[2024-06-01 15:39:45] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:39:45] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/462 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:39:46] [INFO ] Deduced a trap composed of 248 places in 849 ms of which 2 ms to minimize.
[2024-06-01 15:39:47] [INFO ] Deduced a trap composed of 235 places in 693 ms of which 4 ms to minimize.
[2024-06-01 15:39:47] [INFO ] Deduced a trap composed of 221 places in 562 ms of which 2 ms to minimize.
[2024-06-01 15:39:48] [INFO ] Deduced a trap composed of 243 places in 528 ms of which 3 ms to minimize.
[2024-06-01 15:39:48] [INFO ] Deduced a trap composed of 210 places in 571 ms of which 3 ms to minimize.
[2024-06-01 15:39:49] [INFO ] Deduced a trap composed of 224 places in 810 ms of which 3 ms to minimize.
[2024-06-01 15:39:50] [INFO ] Deduced a trap composed of 242 places in 685 ms of which 3 ms to minimize.
[2024-06-01 15:39:51] [INFO ] Deduced a trap composed of 229 places in 750 ms of which 3 ms to minimize.
[2024-06-01 15:39:51] [INFO ] Deduced a trap composed of 205 places in 687 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2411/2874 variables, 463/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2874 variables, 168/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2874 variables, 2/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2874 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/2876 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2876 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2876 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:40:21] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 3 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/2876 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2876 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2876/2876 variables, and 699 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45041 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 465/465 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints]
After SMT, in 51524ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 2447/2447 transitions.
Applied a total of 0 rules in 114 ms. Remains 465 /465 variables (removed 0) and now considering 2447/2447 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 465/465 places, 2447/2447 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 2447/2447 transitions.
Applied a total of 0 rules in 79 ms. Remains 465 /465 variables (removed 0) and now considering 2447/2447 (removed 0) transitions.
[2024-06-01 15:40:30] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
[2024-06-01 15:40:30] [INFO ] Invariant cache hit.
[2024-06-01 15:40:31] [INFO ] Implicit Places using invariants in 1065 ms returned []
[2024-06-01 15:40:31] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
[2024-06-01 15:40:31] [INFO ] Invariant cache hit.
[2024-06-01 15:40:33] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:40:49] [INFO ] Implicit Places using invariants and state equation in 18415 ms returned []
Implicit Place search using SMT with State Equation took 19483 ms to find 0 implicit places.
[2024-06-01 15:40:49] [INFO ] Redundant transitions in 191 ms returned []
Running 2441 sub problems to find dead transitions.
[2024-06-01 15:40:49] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
[2024-06-01 15:40:49] [INFO ] Invariant cache hit.
[2024-06-01 15:40:49] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
[2024-06-01 15:41:27] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 3 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/2876 variables, and 37 constraints, problems are : Problem set: 0 solved, 2441 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/465 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2441/1100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
[2024-06-01 15:41:44] [INFO ] Deduced a trap composed of 29 places in 658 ms of which 4 ms to minimize.
[2024-06-01 15:41:45] [INFO ] Deduced a trap composed of 57 places in 708 ms of which 3 ms to minimize.
[2024-06-01 15:41:46] [INFO ] Deduced a trap composed of 57 places in 600 ms of which 3 ms to minimize.
[2024-06-01 15:41:46] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 9)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 4)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 4)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 3)
(s85 0)
(s86 0)
(s87 0)
(s89 1)
(s90 2)
(s91 0)
(s92 1)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 3)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 2)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 4)
(s121 1)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 4)
(s129 10)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 2)
(s139 0)
(s140 1)
(s141 1)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 1)
(s155 2)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 1)
(s175 0)
(s176 1)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 1)
(s183 0)
(s184 0)
(s185 6)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 2)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 4)
(s203 0)
(s204 0)
(s205 1)
(s206 4)
(s207 1)
(s208 0)
(s209 3)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 3)
(s221 0)
(s222 1)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)timeout

(s232 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/2876 variables, and 41 constraints, problems are : Problem set: 0 solved, 2441 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/465 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1100 constraints, Known Traps: 6/6 constraints]
After SMT, in 82009ms problems are : Problem set: 0 solved, 2441 unsolved
Search for dead transitions found 0 dead transitions in 82039ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101816 ms. Remains : 465/465 places, 2447/2447 transitions.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 688 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 279 place count 547 transition count 2529
Iterating global reduction 2 with 3 rules applied. Total rules applied 282 place count 547 transition count 2529
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 426 place count 475 transition count 2457
Applied a total of 426 rules in 261 ms. Remains 475 /688 variables (removed 213) and now considering 2457/2670 (removed 213) transitions.
Running 2451 sub problems to find dead transitions.
[2024-06-01 15:42:12] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
// Phase 1: matrix 2421 rows 475 cols
[2024-06-01 15:42:12] [INFO ] Computed 46 invariants in 83 ms
[2024-06-01 15:42:12] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 15:42:51] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:42:51] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:42:54] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 38 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 15:43:06] [INFO ] Deduced a trap composed of 59 places in 440 ms of which 3 ms to minimize.
[2024-06-01 15:43:06] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:43:06] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 65381ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 65414ms
[2024-06-01 15:43:17] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 15:43:17] [INFO ] Invariant cache hit.
[2024-06-01 15:43:18] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-06-01 15:43:18] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 15:43:18] [INFO ] Invariant cache hit.
[2024-06-01 15:43:19] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:43:37] [INFO ] Implicit Places using invariants and state equation in 18756 ms returned []
Implicit Place search using SMT with State Equation took 19341 ms to find 0 implicit places.
[2024-06-01 15:43:37] [INFO ] Redundant transitions in 184 ms returned []
Running 2451 sub problems to find dead transitions.
[2024-06-01 15:43:37] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 15:43:37] [INFO ] Invariant cache hit.
[2024-06-01 15:43:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 15:44:08] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:44:10] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 15:44:28] [INFO ] Deduced a trap composed of 29 places in 608 ms of which 3 ms to minimize.
[2024-06-01 15:44:28] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:44:28] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:44:29] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 15:44:48] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:44:49] [INFO ] Deduced a trap composed of 35 places in 350 ms of which 2 ms to minimize.
[2024-06-01 15:44:52] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 0 ms to minimize.
[2024-06-01 15:44:52] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 45 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 10/10 constraints]
After SMT, in 78147ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 78167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 475/688 places, 2457/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163400 ms. Remains : 475/688 places, 2457/2670 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-00
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-00 finished in 163661 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(X(X(p0))) U p1))'
Support contains 56 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Applied a total of 12 rules in 41 ms. Remains 682 /688 variables (removed 6) and now considering 2664/2670 (removed 6) transitions.
Running 2658 sub problems to find dead transitions.
[2024-06-01 15:44:55] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
// Phase 1: matrix 2628 rows 682 cols
[2024-06-01 15:44:55] [INFO ] Computed 46 invariants in 52 ms
[2024-06-01 15:44:55] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
SMT process timed out in 40440ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 40462ms
[2024-06-01 15:45:36] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-06-01 15:45:36] [INFO ] Invariant cache hit.
[2024-06-01 15:45:37] [INFO ] Implicit Places using invariants in 1353 ms returned []
[2024-06-01 15:45:37] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-06-01 15:45:37] [INFO ] Invariant cache hit.
[2024-06-01 15:45:42] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:46:11] [INFO ] Implicit Places using invariants and state equation in 33878 ms returned []
Implicit Place search using SMT with State Equation took 35241 ms to find 0 implicit places.
Running 2658 sub problems to find dead transitions.
[2024-06-01 15:46:11] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-06-01 15:46:11] [INFO ] Invariant cache hit.
[2024-06-01 15:46:11] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/676 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
[2024-06-01 15:46:52] [INFO ] Deduced a trap composed of 161 places in 387 ms of which 4 ms to minimize.
[2024-06-01 15:46:53] [INFO ] Deduced a trap composed of 123 places in 376 ms of which 4 ms to minimize.
[2024-06-01 15:46:53] [INFO ] Deduced a trap composed of 151 places in 331 ms of which 3 ms to minimize.
[2024-06-01 15:46:54] [INFO ] Deduced a trap composed of 15 places in 288 ms of which 2 ms to minimize.
[2024-06-01 15:46:55] [INFO ] Deduced a trap composed of 319 places in 509 ms of which 5 ms to minimize.
[2024-06-01 15:46:57] [INFO ] Deduced a trap composed of 337 places in 383 ms of which 4 ms to minimize.
[2024-06-01 15:46:57] [INFO ] Deduced a trap composed of 343 places in 455 ms of which 4 ms to minimize.
[2024-06-01 15:46:58] [INFO ] Deduced a trap composed of 319 places in 463 ms of which 3 ms to minimize.
[2024-06-01 15:46:58] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/3310 variables, and 48 constraints, problems are : Problem set: 0 solved, 2658 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 22/23 constraints, Generalized P Invariants (flows): 17/23 constraints, State Equation: 0/682 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2658/1404 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/676 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
[2024-06-01 15:47:17] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:47:20] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:47:20] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 4 ms to minimize.
[2024-06-01 15:47:20] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 1 ms to minimize.
[2024-06-01 15:47:29] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/3310 variables, and 53 constraints, problems are : Problem set: 0 solved, 2658 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 22/23 constraints, Generalized P Invariants (flows): 17/23 constraints, State Equation: 0/682 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1404 constraints, Known Traps: 14/14 constraints]
After SMT, in 77885ms problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 77923ms
Starting structural reductions in LTL mode, iteration 1 : 682/688 places, 2664/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153688 ms. Remains : 682/688 places, 2664/2670 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 822 steps with 9 reset in 20 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-01 finished in 153898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 20 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 81 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-06-01 15:47:29] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 676 cols
[2024-06-01 15:47:29] [INFO ] Computed 46 invariants in 92 ms
[2024-06-01 15:47:29] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-06-01 15:48:09] [INFO ] Deduced a trap composed of 145 places in 290 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/3298 variables, and 40 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2652/1398 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2652 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-06-01 15:48:21] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 3 ms to minimize.
[2024-06-01 15:48:22] [INFO ] Deduced a trap composed of 3 places in 374 ms of which 2 ms to minimize.
[2024-06-01 15:48:24] [INFO ] Deduced a trap composed of 290 places in 334 ms of which 2 ms to minimize.
[2024-06-01 15:48:24] [INFO ] Deduced a trap composed of 318 places in 326 ms of which 3 ms to minimize.
[2024-06-01 15:48:25] [INFO ] Deduced a trap composed of 117 places in 303 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/3298 variables, and 45 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1398 constraints, Known Traps: 6/6 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
[2024-06-01 15:48:29] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 15:48:29] [INFO ] Invariant cache hit.
[2024-06-01 15:48:30] [INFO ] Implicit Places using invariants in 836 ms returned []
[2024-06-01 15:48:30] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 15:48:30] [INFO ] Invariant cache hit.
[2024-06-01 15:48:32] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:49:01] [INFO ] Implicit Places using invariants and state equation in 30224 ms returned []
Implicit Place search using SMT with State Equation took 31065 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-06-01 15:49:01] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 15:49:01] [INFO ] Invariant cache hit.
[2024-06-01 15:49:01] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-06-01 15:49:41] [INFO ] Deduced a trap composed of 182 places in 425 ms of which 4 ms to minimize.
[2024-06-01 15:49:42] [INFO ] Deduced a trap composed of 146 places in 377 ms of which 3 ms to minimize.
[2024-06-01 15:49:42] [INFO ] Deduced a trap composed of 145 places in 329 ms of which 3 ms to minimize.
[2024-06-01 15:49:43] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 2 ms to minimize.
[2024-06-01 15:49:44] [INFO ] Deduced a trap composed of 324 places in 442 ms of which 3 ms to minimize.
[2024-06-01 15:49:45] [INFO ] Deduced a trap composed of 3 places in 466 ms of which 3 ms to minimize.
[2024-06-01 15:49:47] [INFO ] Deduced a trap composed of 319 places in 473 ms of which 5 ms to minimize.
[2024-06-01 15:49:47] [INFO ] Deduced a trap composed of 318 places in 423 ms of which 4 ms to minimize.
[2024-06-01 15:49:48] [INFO ] Deduced a trap composed of 142 places in 370 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/3298 variables, and 48 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2652/1398 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2652 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/3298 variables, and 48 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1398 constraints, Known Traps: 9/9 constraints]
After SMT, in 77830ms problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 77866ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169242 ms. Remains : 676/688 places, 2658/2670 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-03 finished in 169431 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 43 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Applied a total of 0 rules in 23 ms. Remains 688 /688 variables (removed 0) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-06-01 15:50:19] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 688 cols
[2024-06-01 15:50:19] [INFO ] Computed 46 invariants in 111 ms
[2024-06-01 15:50:19] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 43316ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 43347ms
[2024-06-01 15:51:02] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 15:51:02] [INFO ] Invariant cache hit.
[2024-06-01 15:51:03] [INFO ] Implicit Places using invariants in 735 ms returned []
[2024-06-01 15:51:03] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 15:51:03] [INFO ] Invariant cache hit.
[2024-06-01 15:51:05] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:51:36] [INFO ] Performed 466/688 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:51:41] [INFO ] Implicit Places using invariants and state equation in 38255 ms returned []
Implicit Place search using SMT with State Equation took 38995 ms to find 0 implicit places.
Running 2664 sub problems to find dead transitions.
[2024-06-01 15:51:41] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 15:51:41] [INFO ] Invariant cache hit.
[2024-06-01 15:51:41] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
[2024-06-01 15:52:22] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 3 ms to minimize.
[2024-06-01 15:52:24] [INFO ] Deduced a trap composed of 122 places in 192 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/3322 variables, and 37 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2664/1410 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
[2024-06-01 15:52:43] [INFO ] Deduced a trap composed of 94 places in 531 ms of which 4 ms to minimize.
[2024-06-01 15:52:43] [INFO ] Deduced a trap composed of 94 places in 518 ms of which 3 ms to minimize.
[2024-06-01 15:52:44] [INFO ] Deduced a trap composed of 35 places in 474 ms of which 3 ms to minimize.
[2024-06-01 15:52:44] [INFO ] Deduced a trap composed of 47 places in 405 ms of which 3 ms to minimize.
[2024-06-01 15:52:44] [INFO ] Deduced a trap composed of 94 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:52:44] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:52:45] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/3322 variables, and 44 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1410 constraints, Known Traps: 9/9 constraints]
After SMT, in 78932ms problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 78962ms
Finished structural reductions in LTL mode , in 1 iterations and 161343 ms. Remains : 688/688 places, 2670/2670 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-05
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-05 finished in 161531 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))||G((p1&&F(p2)))))'
Support contains 15 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 688 transition count 2622
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 640 transition count 2622
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 96 place count 640 transition count 2538
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 264 place count 556 transition count 2538
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 553 transition count 2535
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 553 transition count 2535
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 402 place count 487 transition count 2469
Applied a total of 402 rules in 272 ms. Remains 487 /688 variables (removed 201) and now considering 2469/2670 (removed 201) transitions.
Running 2463 sub problems to find dead transitions.
[2024-06-01 15:53:00] [INFO ] Flow matrix only has 2433 transitions (discarded 36 similar events)
// Phase 1: matrix 2433 rows 487 cols
[2024-06-01 15:53:00] [INFO ] Computed 46 invariants in 36 ms
[2024-06-01 15:53:00] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
[2024-06-01 15:53:32] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 4 ms to minimize.
[2024-06-01 15:53:32] [INFO ] Deduced a trap composed of 67 places in 356 ms of which 3 ms to minimize.
[2024-06-01 15:53:35] [INFO ] Deduced a trap composed of 41 places in 260 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/2920 variables, and 42 constraints, problems are : Problem set: 0 solved, 2463 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/487 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2463/1209 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
[2024-06-01 15:53:52] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:53:52] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:53:53] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:53:55] [INFO ] Deduced a trap composed of 156 places in 377 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/2920 variables, and 46 constraints, problems are : Problem set: 0 solved, 2463 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/487 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1209 constraints, Known Traps: 7/7 constraints]
After SMT, in 57162ms problems are : Problem set: 0 solved, 2463 unsolved
Search for dead transitions found 0 dead transitions in 57195ms
[2024-06-01 15:53:58] [INFO ] Flow matrix only has 2433 transitions (discarded 36 similar events)
[2024-06-01 15:53:58] [INFO ] Invariant cache hit.
[2024-06-01 15:53:58] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-06-01 15:53:58] [INFO ] Flow matrix only has 2433 transitions (discarded 36 similar events)
[2024-06-01 15:53:58] [INFO ] Invariant cache hit.
[2024-06-01 15:54:00] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:54:29] [INFO ] Implicit Places using invariants and state equation in 30508 ms returned []
Implicit Place search using SMT with State Equation took 31120 ms to find 0 implicit places.
[2024-06-01 15:54:29] [INFO ] Redundant transitions in 151 ms returned []
Running 2463 sub problems to find dead transitions.
[2024-06-01 15:54:29] [INFO ] Flow matrix only has 2433 transitions (discarded 36 similar events)
[2024-06-01 15:54:29] [INFO ] Invariant cache hit.
[2024-06-01 15:54:29] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
[2024-06-01 15:55:01] [INFO ] Deduced a trap composed of 15 places in 335 ms of which 2 ms to minimize.
[2024-06-01 15:55:02] [INFO ] Deduced a trap composed of 67 places in 365 ms of which 2 ms to minimize.
[2024-06-01 15:55:02] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 1 ms to minimize.
(s209 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.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 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.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 1.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 1.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.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 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 2.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 2.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 8.0)
(s136 1.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 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 1.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 1.0)
(s162 1.0)
(s163 2.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 1.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 1.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 4.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 2.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0timeout
)
(s210 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/2920 variables, and 42 constraints, problems are : Problem set: 0 solved, 2463 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/487 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2463/1209 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
[2024-06-01 15:55:20] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 1 ms to minimize.
[2024-06-01 15:55:20] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:55:20] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:55:20] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:55:21] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:55:31] [INFO ] Deduced a trap composed of 157 places in 342 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/2920 variables, and 48 constraints, problems are : Problem set: 0 solved, 2463 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/487 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1209 constraints, Known Traps: 9/9 constraints]
After SMT, in 76530ms problems are : Problem set: 0 solved, 2463 unsolved
Search for dead transitions found 0 dead transitions in 76555ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/688 places, 2469/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165321 ms. Remains : 487/688 places, 2469/2670 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-06
Stuttering criterion allowed to conclude after 190 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-06 finished in 165436 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 1 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 688 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 279 place count 547 transition count 2529
Iterating global reduction 2 with 3 rules applied. Total rules applied 282 place count 547 transition count 2529
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 426 place count 475 transition count 2457
Applied a total of 426 rules in 166 ms. Remains 475 /688 variables (removed 213) and now considering 2457/2670 (removed 213) transitions.
Running 2451 sub problems to find dead transitions.
[2024-06-01 15:55:46] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
// Phase 1: matrix 2421 rows 475 cols
[2024-06-01 15:55:46] [INFO ] Computed 46 invariants in 43 ms
[2024-06-01 15:55:46] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 15:56:17] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:56:17] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:56:19] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 38 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 15:56:32] [INFO ] Deduced a trap composed of 59 places in 607 ms of which 3 ms to minimize.
[2024-06-01 15:56:32] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 1 ms to minimize.
[2024-06-01 15:56:33] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 57409ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 57441ms
[2024-06-01 15:56:43] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 15:56:43] [INFO ] Invariant cache hit.
[2024-06-01 15:56:44] [INFO ] Implicit Places using invariants in 817 ms returned []
[2024-06-01 15:56:44] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 15:56:44] [INFO ] Invariant cache hit.
[2024-06-01 15:56:45] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:57:11] [INFO ] Implicit Places using invariants and state equation in 27208 ms returned []
Implicit Place search using SMT with State Equation took 28029 ms to find 0 implicit places.
[2024-06-01 15:57:11] [INFO ] Redundant transitions in 73 ms returned []
Running 2451 sub problems to find dead transitions.
[2024-06-01 15:57:11] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 15:57:11] [INFO ] Invariant cache hit.
[2024-06-01 15:57:11] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 15:57:44] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:57:46] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 15:58:01] [INFO ] Deduced a trap composed of 29 places in 375 ms of which 2 ms to minimize.
[2024-06-01 15:58:01] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 0 ms to minimize.
[2024-06-01 15:58:01] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 0 ms to minimize.
[2024-06-01 15:58:01] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 15:58:20] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:58:21] [INFO ] Deduced a trap composed of 35 places in 346 ms of which 2 ms to minimize.
[2024-06-01 15:58:23] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:58:24] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 45 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 10/10 constraints]
After SMT, in 76909ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 76928ms
Starting structural reductions in SI_LTL mode, iteration 1 : 475/688 places, 2457/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162663 ms. Remains : 475/688 places, 2457/2670 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-08
Product exploration explored 100000 steps with 1113 reset in 790 ms.
Product exploration explored 100000 steps with 1169 reset in 1031 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 123 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4022 steps (47 resets) in 69 ms. (57 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 137 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 2457/2457 transitions.
Applied a total of 0 rules in 52 ms. Remains 475 /475 variables (removed 0) and now considering 2457/2457 (removed 0) transitions.
Running 2451 sub problems to find dead transitions.
[2024-06-01 15:58:31] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 15:58:31] [INFO ] Invariant cache hit.
[2024-06-01 15:58:31] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 15:59:01] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:59:03] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 15:59:10] [INFO ] Deduced a trap composed of 29 places in 517 ms of which 3 ms to minimize.
[2024-06-01 15:59:11] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 1 ms to minimize.
[2024-06-01 15:59:11] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:59:11] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 57017ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 57037ms
[2024-06-01 15:59:28] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 15:59:28] [INFO ] Invariant cache hit.
[2024-06-01 15:59:29] [INFO ] Implicit Places using invariants in 758 ms returned []
[2024-06-01 15:59:29] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 15:59:29] [INFO ] Invariant cache hit.
[2024-06-01 15:59:30] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:59:57] [INFO ] Implicit Places using invariants and state equation in 28360 ms returned []
Implicit Place search using SMT with State Equation took 29120 ms to find 0 implicit places.
[2024-06-01 15:59:57] [INFO ] Redundant transitions in 109 ms returned []
Running 2451 sub problems to find dead transitions.
[2024-06-01 15:59:57] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 15:59:57] [INFO ] Invariant cache hit.
[2024-06-01 15:59:57] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 16:00:34] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:00:37] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 16:00:52] [INFO ] Deduced a trap composed of 29 places in 403 ms of which 2 ms to minimize.
[2024-06-01 16:00:53] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 0 ms to minimize.
[2024-06-01 16:00:53] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 0 ms to minimize.
[2024-06-01 16:00:53] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 35 places in 338 ms of which 2 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 45 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 10/10 constraints]
After SMT, in 82386ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 82418ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 168763 ms. Remains : 475/475 places, 2457/2457 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 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1696 steps (18 resets) in 23 ms. (70 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 125 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1145 reset in 931 ms.
Product exploration explored 100000 steps with 1128 reset in 732 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 2457/2457 transitions.
Applied a total of 0 rules in 41 ms. Remains 475 /475 variables (removed 0) and now considering 2457/2457 (removed 0) transitions.
Running 2451 sub problems to find dead transitions.
[2024-06-01 16:01:22] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 16:01:22] [INFO ] Invariant cache hit.
[2024-06-01 16:01:22] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 16:01:54] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:01:56] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 29 places in 458 ms of which 3 ms to minimize.
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 57323ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 57341ms
[2024-06-01 16:02:19] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 16:02:19] [INFO ] Invariant cache hit.
[2024-06-01 16:02:20] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-06-01 16:02:20] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 16:02:20] [INFO ] Invariant cache hit.
[2024-06-01 16:02:21] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:02:46] [INFO ] Implicit Places using invariants and state equation in 26543 ms returned []
Implicit Place search using SMT with State Equation took 27120 ms to find 0 implicit places.
[2024-06-01 16:02:46] [INFO ] Redundant transitions in 136 ms returned []
Running 2451 sub problems to find dead transitions.
[2024-06-01 16:02:46] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-06-01 16:02:46] [INFO ] Invariant cache hit.
[2024-06-01 16:02:46] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 16:03:18] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-06-01 16:03:20] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 16:03:36] [INFO ] Deduced a trap composed of 29 places in 356 ms of which 2 ms to minimize.
[2024-06-01 16:03:36] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:03:36] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 0 ms to minimize.
[2024-06-01 16:03:37] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-06-01 16:03:59] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:03:59] [INFO ] Deduced a trap composed of 35 places in 365 ms of which 2 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 0 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 45 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 10/10 constraints]
After SMT, in 76964ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 76998ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 161665 ms. Remains : 475/475 places, 2457/2457 transitions.
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-08 finished in 498171 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 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 688 transition count 2617
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 635 transition count 2617
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 106 place count 635 transition count 2533
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 274 place count 551 transition count 2533
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 277 place count 548 transition count 2530
Iterating global reduction 2 with 3 rules applied. Total rules applied 280 place count 548 transition count 2530
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 420 place count 478 transition count 2460
Applied a total of 420 rules in 152 ms. Remains 478 /688 variables (removed 210) and now considering 2460/2670 (removed 210) transitions.
Running 2454 sub problems to find dead transitions.
[2024-06-01 16:04:04] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
// Phase 1: matrix 2424 rows 478 cols
[2024-06-01 16:04:04] [INFO ] Computed 46 invariants in 74 ms
[2024-06-01 16:04:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:04:35] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:04:36] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 58 places in 426 ms of which 2 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 30 places in 433 ms of which 2 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:04:49] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 42 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 7/7 constraints]
After SMT, in 57923ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 57942ms
[2024-06-01 16:05:02] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-06-01 16:05:02] [INFO ] Invariant cache hit.
[2024-06-01 16:05:02] [INFO ] Implicit Places using invariants in 599 ms returned []
[2024-06-01 16:05:02] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-06-01 16:05:02] [INFO ] Invariant cache hit.
[2024-06-01 16:05:04] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:05:31] [INFO ] Implicit Places using invariants and state equation in 28485 ms returned []
Implicit Place search using SMT with State Equation took 29088 ms to find 0 implicit places.
[2024-06-01 16:05:31] [INFO ] Redundant transitions in 142 ms returned []
Running 2454 sub problems to find dead transitions.
[2024-06-01 16:05:31] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-06-01 16:05:31] [INFO ] Invariant cache hit.
[2024-06-01 16:05:31] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:06:02] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:06:03] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:06:21] [INFO ] Deduced a trap composed of 38 places in 369 ms of which 2 ms to minimize.
[2024-06-01 16:06:21] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
[2024-06-01 16:06:21] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:06:42] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 0 ms to minimize.
[2024-06-01 16:06:48] [INFO ] Deduced a trap composed of 30 places in 372 ms of which 2 ms to minimize.
[2024-06-01 16:06:48] [INFO ] Deduced a trap composed of 56 places in 316 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 9)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 4)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 3)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 8)
(s132 0)
(s133 1)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 6)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 4)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 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 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(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 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 46 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 11/11 constraints]
After SMT, in 77721ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 77764ms
Starting structural reductions in SI_LTL mode, iteration 1 : 478/688 places, 2460/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165107 ms. Remains : 478/688 places, 2460/2670 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-09
Product exploration explored 100000 steps with 976 reset in 773 ms.
Product exploration explored 100000 steps with 1024 reset in 771 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 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 11448 steps (111 resets) in 142 ms. (80 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 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 2460/2460 transitions.
Applied a total of 0 rules in 49 ms. Remains 478 /478 variables (removed 0) and now considering 2460/2460 (removed 0) transitions.
Running 2454 sub problems to find dead transitions.
[2024-06-01 16:06:51] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-06-01 16:06:51] [INFO ] Invariant cache hit.
[2024-06-01 16:06:51] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:07:23] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:07:24] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:07:31] [INFO ] Deduced a trap composed of 38 places in 549 ms of which 2 ms to minimize.
[2024-06-01 16:07:31] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:07:31] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 0 ms to minimize.
[2024-06-01 16:07:40] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:07:41] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:07:41] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 43 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 8/8 constraints]
After SMT, in 57361ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 57379ms
[2024-06-01 16:07:48] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-06-01 16:07:48] [INFO ] Invariant cache hit.
[2024-06-01 16:07:49] [INFO ] Implicit Places using invariants in 788 ms returned []
[2024-06-01 16:07:49] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-06-01 16:07:49] [INFO ] Invariant cache hit.
[2024-06-01 16:07:51] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:08:16] [INFO ] Implicit Places using invariants and state equation in 27198 ms returned []
Implicit Place search using SMT with State Equation took 27987 ms to find 0 implicit places.
[2024-06-01 16:08:16] [INFO ] Redundant transitions in 153 ms returned []
Running 2454 sub problems to find dead transitions.
[2024-06-01 16:08:16] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-06-01 16:08:16] [INFO ] Invariant cache hit.
[2024-06-01 16:08:16] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:08:48] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:08:49] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:09:06] [INFO ] Deduced a trap composed of 38 places in 565 ms of which 4 ms to minimize.
[2024-06-01 16:09:07] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 1 ms to minimize.
[2024-06-01 16:09:07] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:09:30] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 44 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 9/9 constraints]
After SMT, in 77236ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 77270ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 162863 ms. Remains : 478/478 places, 2460/2460 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 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 12876 steps (126 resets) in 165 ms. (77 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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1052 reset in 922 ms.
Product exploration explored 100000 steps with 998 reset in 769 ms.
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 2460/2460 transitions.
Applied a total of 0 rules in 39 ms. Remains 478 /478 variables (removed 0) and now considering 2460/2460 (removed 0) transitions.
Running 2454 sub problems to find dead transitions.
[2024-06-01 16:09:36] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-06-01 16:09:36] [INFO ] Invariant cache hit.
[2024-06-01 16:09:36] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:10:07] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:10:08] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:10:16] [INFO ] Deduced a trap composed of 38 places in 376 ms of which 1 ms to minimize.
[2024-06-01 16:10:16] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2024-06-01 16:10:16] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 0 ms to minimize.
[2024-06-01 16:10:25] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:10:25] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:10:25] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 43 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 8/8 constraints]
After SMT, in 57296ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 57315ms
[2024-06-01 16:10:33] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-06-01 16:10:33] [INFO ] Invariant cache hit.
[2024-06-01 16:10:34] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-06-01 16:10:34] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-06-01 16:10:34] [INFO ] Invariant cache hit.
[2024-06-01 16:10:35] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:11:00] [INFO ] Implicit Places using invariants and state equation in 26704 ms returned []
Implicit Place search using SMT with State Equation took 27207 ms to find 0 implicit places.
[2024-06-01 16:11:01] [INFO ] Redundant transitions in 73 ms returned []
Running 2454 sub problems to find dead transitions.
[2024-06-01 16:11:01] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-06-01 16:11:01] [INFO ] Invariant cache hit.
[2024-06-01 16:11:01] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:11:32] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:11:33] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:11:50] [INFO ] Deduced a trap composed of 38 places in 450 ms of which 2 ms to minimize.
[2024-06-01 16:11:50] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2024-06-01 16:11:51] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:12:00] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 0 ms to minimize.
[2024-06-01 16:12:00] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:12:00] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 16:12:11] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:12:17] [INFO ] Deduced a trap composed of 30 places in 342 ms of which 1 ms to minimize.
[2024-06-01 16:12:17] [INFO ] Deduced a trap composed of 56 places in 274 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 46 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 11/11 constraints]
After SMT, in 77539ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 77573ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 162228 ms. Remains : 478/478 places, 2460/2460 transitions.
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-09 finished in 494533 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)&&F(G(p1)))))'
Support contains 3 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 688 transition count 2623
Reduce places removed 47 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 53 rules applied. Total rules applied 100 place count 641 transition count 2617
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 635 transition count 2617
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 106 place count 635 transition count 2533
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 274 place count 551 transition count 2533
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 278 place count 547 transition count 2529
Iterating global reduction 3 with 4 rules applied. Total rules applied 282 place count 547 transition count 2529
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 424 place count 476 transition count 2458
Applied a total of 424 rules in 196 ms. Remains 476 /688 variables (removed 212) and now considering 2458/2670 (removed 212) transitions.
Running 2452 sub problems to find dead transitions.
[2024-06-01 16:12:18] [INFO ] Flow matrix only has 2422 transitions (discarded 36 similar events)
// Phase 1: matrix 2422 rows 476 cols
[2024-06-01 16:12:19] [INFO ] Computed 46 invariants in 36 ms
[2024-06-01 16:12:19] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
[2024-06-01 16:12:51] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:12:52] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-06-01 16:12:52] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:12:52] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:12:53] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/2898 variables, and 40 constraints, problems are : Problem set: 0 solved, 2452 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2452/1198 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/2898 variables, and 40 constraints, problems are : Problem set: 0 solved, 2452 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1198 constraints, Known Traps: 5/5 constraints]
After SMT, in 57538ms problems are : Problem set: 0 solved, 2452 unsolved
Search for dead transitions found 0 dead transitions in 57556ms
[2024-06-01 16:13:16] [INFO ] Flow matrix only has 2422 transitions (discarded 36 similar events)
[2024-06-01 16:13:16] [INFO ] Invariant cache hit.
[2024-06-01 16:13:17] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-06-01 16:13:17] [INFO ] Flow matrix only has 2422 transitions (discarded 36 similar events)
[2024-06-01 16:13:17] [INFO ] Invariant cache hit.
[2024-06-01 16:13:18] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:13:36] [INFO ] Implicit Places using invariants and state equation in 19152 ms returned []
Implicit Place search using SMT with State Equation took 19717 ms to find 0 implicit places.
[2024-06-01 16:13:36] [INFO ] Redundant transitions in 73 ms returned []
Running 2452 sub problems to find dead transitions.
[2024-06-01 16:13:36] [INFO ] Flow matrix only has 2422 transitions (discarded 36 similar events)
[2024-06-01 16:13:36] [INFO ] Invariant cache hit.
[2024-06-01 16:13:36] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
[2024-06-01 16:14:06] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-06-01 16:14:06] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:14:07] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/2898 variables, and 38 constraints, problems are : Problem set: 0 solved, 2452 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2452/1198 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
[2024-06-01 16:14:29] [INFO ] Deduced a trap composed of 59 places in 597 ms of which 2 ms to minimize.
[2024-06-01 16:14:29] [INFO ] Deduced a trap composed of 42 places in 595 ms of which 3 ms to minimize.
[2024-06-01 16:14:29] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:14:30] [INFO ] Deduced a trap composed of 35 places in 550 ms of which 3 ms to minimize.
[2024-06-01 16:14:31] [INFO ] Deduced a trap composed of 29 places in 466 ms of which 2 ms to minimize.
[2024-06-01 16:14:31] [INFO ] Deduced a trap composed of 29 places in 422 ms of which 3 ms to minimize.
[2024-06-01 16:14:31] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 3 ms to minimize.
[2024-06-01 16:14:31] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/2898 variables, and 46 constraints, problems are : Problem set: 0 solved, 2452 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1198 constraints, Known Traps: 11/11 constraints]
After SMT, in 77125ms problems are : Problem set: 0 solved, 2452 unsolved
Search for dead transitions found 0 dead transitions in 77157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 476/688 places, 2458/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154738 ms. Remains : 476/688 places, 2458/2670 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-10
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-10 finished in 154851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||(p1&&F(p0))))'
Support contains 4 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 688 transition count 2621
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 639 transition count 2620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 638 transition count 2620
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 100 place count 638 transition count 2534
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 272 place count 552 transition count 2534
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 275 place count 549 transition count 2531
Iterating global reduction 3 with 3 rules applied. Total rules applied 278 place count 549 transition count 2531
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 406 place count 485 transition count 2467
Applied a total of 406 rules in 156 ms. Remains 485 /688 variables (removed 203) and now considering 2467/2670 (removed 203) transitions.
Running 2461 sub problems to find dead transitions.
[2024-06-01 16:14:53] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
// Phase 1: matrix 2431 rows 485 cols
[2024-06-01 16:14:53] [INFO ] Computed 46 invariants in 82 ms
[2024-06-01 16:14:53] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-06-01 16:15:27] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:15:28] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 37 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-06-01 16:15:33] [INFO ] Deduced a trap composed of 29 places in 654 ms of which 2 ms to minimize.
[2024-06-01 16:15:34] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 1 ms to minimize.
[2024-06-01 16:15:34] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2024-06-01 16:15:34] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 0 ms to minimize.
[2024-06-01 16:15:34] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:15:37] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:15:37] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:15:40] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 4)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s91 1)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 3)
(s124 1)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 10)
(s134 1)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 1)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 6)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 3)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 1)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 1)
(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 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 9)
(s324 1)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 1)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(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 1)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 1)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 4)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 1)
(s428 3)
(s429 1)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s439 0)
(s440 0)
(s441 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 45 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 10/10 constraints]
After SMT, in 57216ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 57233ms
[2024-06-01 16:15:50] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-06-01 16:15:50] [INFO ] Invariant cache hit.
[2024-06-01 16:15:51] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-06-01 16:15:51] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-06-01 16:15:51] [INFO ] Invariant cache hit.
[2024-06-01 16:15:53] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:16:24] [INFO ] Performed 444/485 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 16:16:25] [INFO ] Implicit Places using invariants and state equation in 34101 ms returned []
Implicit Place search using SMT with State Equation took 34640 ms to find 0 implicit places.
[2024-06-01 16:16:25] [INFO ] Redundant transitions in 91 ms returned []
Running 2461 sub problems to find dead transitions.
[2024-06-01 16:16:25] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-06-01 16:16:25] [INFO ] Invariant cache hit.
[2024-06-01 16:16:25] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-06-01 16:17:05] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:17:05] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:17:05] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:17:06] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 4.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 4.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 3.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s91 1.0)
(s92 2.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 3.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 2.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 4.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 4.0)
(s133 10.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 2.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 2.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 6.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 2.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 4.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 4.0)
(s213 1.0)
(s214 0.0)
(s215 3.0)
(s216 0.0)
(s217 1.0)
(s218 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 39 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-06-01 16:17:24] [INFO ] Deduced a trap composed of 60 places in 398 ms of which 2 ms to minimize.
[2024-06-01 16:17:24] [INFO ] Deduced a trap composed of 58 places in 406 ms of which 3 ms to minimize.
[2024-06-01 16:17:24] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2024-06-01 16:17:24] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:17:26] [INFO ] Deduced a trap composed of 29 places in 328 ms of which 2 ms to minimize.
[2024-06-01 16:17:26] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:17:36] [INFO ] Deduced a trap composed of 35 places in 360 ms of which 2 ms to minimize.
[2024-06-01 16:17:36] [INFO ] Deduced a trap composed of 54 places in 344 ms of which 15 ms to minimize.
[2024-06-01 16:17:37] [INFO ] Deduced a trap composed of 29 places in 302 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/479 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 1)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 4)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 4)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 3)
(s87 0)
(s88 1)
(s89 0)
(s91 1)
(s92 2)
(s93 1)
(s94 1)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 3)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 2)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 3)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 4)
(s133 6)
(s134 1)
(s135 1)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 2)
(s144 0)
(s145 1)
(s146 1)
(s147 0)
(s148 1)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 1)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 1)
(s188 0)
(s189 0)
(s190 5)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 48 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 13/13 constraints]
After SMT, in 85326ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 85344ms
Starting structural reductions in SI_LTL mode, iteration 1 : 485/688 places, 2467/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177486 ms. Remains : 485/688 places, 2467/2670 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-11
Product exploration explored 100000 steps with 1962 reset in 836 ms.
Product exploration explored 100000 steps with 1957 reset in 827 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 126 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40002 steps (393 resets) in 553 ms. (72 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (64 resets) in 653 ms. (61 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (56 resets) in 720 ms. (55 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (56 resets) in 479 ms. (83 steps per ms) remains 3/3 properties
[2024-06-01 16:17:53] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-06-01 16:17:53] [INFO ] Invariant cache hit.
[2024-06-01 16:17:53] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 330/340 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 75/415 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 7 (OVERLAPS) 68/483 variables, 23/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 16:17:54] [INFO ] Deduced a trap composed of 35 places in 366 ms of which 3 ms to minimize.
[2024-06-01 16:17:54] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:17:54] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 1 ms to minimize.
[2024-06-01 16:17:54] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-06-01 16:17:54] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/2916 variables, and 533 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4238 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 483/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 330/340 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 75/415 variables, 19/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 68/483 variables, 23/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 16:17:58] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 1/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/2916 variables, and 534 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3906 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 483/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 8160ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 102 ms.
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 2467/2467 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 485 transition count 2455
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 473 transition count 2455
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 473 transition count 2455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 472 transition count 2454
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 472 transition count 2454
Applied a total of 28 rules in 211 ms. Remains 472 /485 variables (removed 13) and now considering 2454/2467 (removed 13) transitions.
Running 2448 sub problems to find dead transitions.
[2024-06-01 16:18:02] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
// Phase 1: matrix 2418 rows 472 cols
[2024-06-01 16:18:02] [INFO ] Computed 46 invariants in 89 ms
[2024-06-01 16:18:02] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 16:18:34] [INFO ] Deduced a trap composed of 147 places in 412 ms of which 2 ms to minimize.
[2024-06-01 16:18:35] [INFO ] Deduced a trap composed of 139 places in 336 ms of which 2 ms to minimize.
[2024-06-01 16:18:35] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 1 ms to minimize.
[2024-06-01 16:18:36] [INFO ] Deduced a trap composed of 57 places in 367 ms of which 2 ms to minimize.
[2024-06-01 16:18:37] [INFO ] Deduced a trap composed of 148 places in 271 ms of which 2 ms to minimize.
[2024-06-01 16:18:37] [INFO ] Deduced a trap composed of 157 places in 273 ms of which 2 ms to minimize.
[2024-06-01 16:18:38] [INFO ] Deduced a trap composed of 159 places in 225 ms of which 1 ms to minimize.
[2024-06-01 16:18:38] [INFO ] Deduced a trap composed of 153 places in 313 ms of which 2 ms to minimize.
[2024-06-01 16:18:41] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 4 ms to minimize.
SMT process timed out in 39145ms, After SMT, problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 39167ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39382 ms. Remains : 472/485 places, 2454/2467 transitions.
RANDOM walk for 40000 steps (398 resets) in 1630 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (72 resets) in 488 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (58 resets) in 475 ms. (84 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 82865 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 82865 steps, saw 38011 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-06-01 16:18:45] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 16:18:45] [INFO ] Invariant cache hit.
[2024-06-01 16:18:45] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/254 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/355 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/469 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 34 places in 548 ms of which 4 ms to minimize.
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 2 ms to minimize.
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 2 ms to minimize.
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 1 ms to minimize.
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/470 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2418/2888 variables, 470/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2888 variables, 168/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2888 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/2890 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2890 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2890 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2890 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2890/2890 variables, and 691 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7977 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 472/472 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/254 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/355 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/469 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:18:53] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/470 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2418/2888 variables, 470/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2888 variables, 168/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2888 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2888 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/2890 variables, 2/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2890 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2890 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2890 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2890/2890 variables, and 694 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9195 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 472/472 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 17187ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 445 ms.
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 58 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 472/472 places, 2454/2454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 58 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
[2024-06-01 16:19:03] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 16:19:03] [INFO ] Invariant cache hit.
[2024-06-01 16:19:03] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-06-01 16:19:03] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 16:19:03] [INFO ] Invariant cache hit.
[2024-06-01 16:19:05] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:19:23] [INFO ] Implicit Places using invariants and state equation in 19842 ms returned []
Implicit Place search using SMT with State Equation took 20687 ms to find 0 implicit places.
[2024-06-01 16:19:23] [INFO ] Redundant transitions in 143 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-06-01 16:19:23] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 16:19:23] [INFO ] Invariant cache hit.
[2024-06-01 16:19:23] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 16:19:57] [INFO ] Deduced a trap composed of 147 places in 335 ms of which 2 ms to minimize.
[2024-06-01 16:19:57] [INFO ] Deduced a trap composed of 139 places in 313 ms of which 2 ms to minimize.
[2024-06-01 16:19:58] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 1 ms to minimize.
[2024-06-01 16:19:58] [INFO ] Deduced a trap composed of 57 places in 393 ms of which 2 ms to minimize.
[2024-06-01 16:19:59] [INFO ] Deduced a trap composed of 149 places in 327 ms of which 2 ms to minimize.
[2024-06-01 16:20:00] [INFO ] Deduced a trap composed of 161 places in 288 ms of which 2 ms to minimize.
[2024-06-01 16:20:00] [INFO ] Deduced a trap composed of 158 places in 279 ms of which 2 ms to minimize.
[2024-06-01 16:20:01] [INFO ] Deduced a trap composed of 148 places in 261 ms of which 2 ms to minimize.
[2024-06-01 16:20:01] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
[2024-06-01 16:20:05] [INFO ] Deduced a trap composed of 56 places in 202 ms of which 2 ms to minimize.
[2024-06-01 16:20:10] [INFO ] Deduced a trap composed of 161 places in 282 ms of which 2 ms to minimize.
[2024-06-01 16:20:10] [INFO ] Deduced a trap composed of 152 places in 268 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 51 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1107 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 16:20:16] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
[2024-06-01 16:20:16] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:20:18] [INFO ] Deduced a trap composed of 39 places in 317 ms of which 3 ms to minimize.
[2024-06-01 16:20:18] [INFO ] Deduced a trap composed of 34 places in 277 ms of which 2 ms to minimize.
[2024-06-01 16:20:19] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 1 ms to minimize.
[2024-06-01 16:20:19] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 1 ms to minimize.
[2024-06-01 16:20:19] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:20:21] [INFO ] Deduced a trap composed of 159 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:20:21] [INFO ] Deduced a trap composed of 155 places in 229 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 60 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1107 constraints, Known Traps: 21/21 constraints]
After SMT, in 79050ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 79083ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99990 ms. Remains : 472/472 places, 2454/2454 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 209 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 2467/2467 transitions.
Applied a total of 0 rules in 71 ms. Remains 485 /485 variables (removed 0) and now considering 2467/2467 (removed 0) transitions.
Running 2461 sub problems to find dead transitions.
[2024-06-01 16:20:43] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
// Phase 1: matrix 2431 rows 485 cols
[2024-06-01 16:20:44] [INFO ] Computed 46 invariants in 79 ms
[2024-06-01 16:20:44] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-06-01 16:21:24] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:21:25] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 4.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 (/ 2.0 3.0))
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 4.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 (/ 1.0 3.0))
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 3.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s91 1.0)
(s92 2.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 3.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 2.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 4.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)timeout

(s128 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 37 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-06-01 16:21:31] [INFO ] Deduced a trap composed of 29 places in 415 ms of which 2 ms to minimize.
[2024-06-01 16:21:31] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:21:31] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2024-06-01 16:21:31] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:21:32] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-06-01 16:21:36] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:21:36] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 0 ms to minimize.
[2024-06-01 16:21:38] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 45 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 10/10 constraints]
After SMT, in 65073ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 65095ms
[2024-06-01 16:21:49] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-06-01 16:21:49] [INFO ] Invariant cache hit.
[2024-06-01 16:21:49] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-06-01 16:21:49] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-06-01 16:21:49] [INFO ] Invariant cache hit.
[2024-06-01 16:21:51] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:22:21] [INFO ] Performed 444/485 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 16:22:23] [INFO ] Implicit Places using invariants and state equation in 33730 ms returned []
Implicit Place search using SMT with State Equation took 34371 ms to find 0 implicit places.
[2024-06-01 16:22:23] [INFO ] Redundant transitions in 125 ms returned []
Running 2461 sub problems to find dead transitions.
[2024-06-01 16:22:23] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-06-01 16:22:23] [INFO ] Invariant cache hit.
[2024-06-01 16:22:23] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-06-01 16:22:59] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:22:59] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:22:59] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-06-01 16:23:00] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 39 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-06-01 16:23:20] [INFO ] Deduced a trap composed of 60 places in 1361 ms of which 3 ms to minimize.
[2024-06-01 16:23:21] [INFO ] Deduced a trap composed of 58 places in 443 ms of which 2 ms to minimize.
[2024-06-01 16:23:21] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2024-06-01 16:23:21] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:23:22] [INFO ] Deduced a trap composed of 29 places in 382 ms of which 1 ms to minimize.
[2024-06-01 16:23:22] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 0 ms to minimize.
[2024-06-01 16:23:33] [INFO ] Deduced a trap composed of 35 places in 354 ms of which 2 ms to minimize.
[2024-06-01 16:23:33] [INFO ] Deduced a trap composed of 54 places in 399 ms of which 2 ms to minimize.
[2024-06-01 16:23:33] [INFO ] Deduced a trap composed of 29 places in 341 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 48 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 13/13 constraints]
After SMT, in 82379ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 82420ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 182118 ms. Remains : 485/485 places, 2467/2467 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 123 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (414 resets) in 1602 ms. (24 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (49 resets) in 549 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (74 resets) in 508 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (61 resets) in 424 ms. (94 steps per ms) remains 3/3 properties
[2024-06-01 16:23:47] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-06-01 16:23:47] [INFO ] Invariant cache hit.
[2024-06-01 16:23:47] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 330/340 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 75/415 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 7 (OVERLAPS) 68/483 variables, 23/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 16:23:47] [INFO ] Deduced a trap composed of 35 places in 404 ms of which 3 ms to minimize.
[2024-06-01 16:23:47] [INFO ] Deduced a trap composed of 61 places in 194 ms of which 2 ms to minimize.
[2024-06-01 16:23:48] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 1 ms to minimize.
[2024-06-01 16:23:48] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:23:48] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/2916 variables, and 533 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4261 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 483/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 330/340 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 75/415 variables, 19/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 68/483 variables, 23/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 16:23:51] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 1/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/2916 variables, and 534 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3798 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 483/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 8088ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 2467/2467 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 485 transition count 2455
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 473 transition count 2455
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 473 transition count 2455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 472 transition count 2454
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 472 transition count 2454
Applied a total of 28 rules in 207 ms. Remains 472 /485 variables (removed 13) and now considering 2454/2467 (removed 13) transitions.
Running 2448 sub problems to find dead transitions.
[2024-06-01 16:23:55] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
// Phase 1: matrix 2418 rows 472 cols
[2024-06-01 16:23:55] [INFO ] Computed 46 invariants in 90 ms
[2024-06-01 16:23:55] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 16:24:32] [INFO ] Deduced a trap composed of 147 places in 439 ms of which 3 ms to minimize.
[2024-06-01 16:24:32] [INFO ] Deduced a trap composed of 139 places in 380 ms of which 3 ms to minimize.
[2024-06-01 16:24:33] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 1 ms to minimize.
[2024-06-01 16:24:33] [INFO ] Deduced a trap composed of 57 places in 470 ms of which 2 ms to minimize.
[2024-06-01 16:24:35] [INFO ] Deduced a trap composed of 148 places in 383 ms of which 2 ms to minimize.
[2024-06-01 16:24:35] [INFO ] Deduced a trap composed of 157 places in 378 ms of which 3 ms to minimize.
[2024-06-01 16:24:36] [INFO ] Deduced a trap composed of 159 places in 340 ms of which 2 ms to minimize.
[2024-06-01 16:24:36] [INFO ] Deduced a trap composed of 153 places in 330 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 47 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1107 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 16:24:40] [INFO ] Deduced a trap composed of 29 places in 316 ms of which 2 ms to minimize.
[2024-06-01 16:24:41] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:24:41] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-06-01 16:24:41] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 0 ms to minimize.
[2024-06-01 16:24:41] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:24:44] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:24:45] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-01 16:24:46] [INFO ] Deduced a trap composed of 34 places in 319 ms of which 2 ms to minimize.
[2024-06-01 16:24:52] [INFO ] Deduced a trap composed of 154 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:24:52] [INFO ] Deduced a trap composed of 153 places in 255 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 57 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1107 constraints, Known Traps: 18/18 constraints]
After SMT, in 61826ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 61848ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62060 ms. Remains : 472/485 places, 2454/2467 transitions.
RANDOM walk for 40000 steps (414 resets) in 1676 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (57 resets) in 602 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (56 resets) in 553 ms. (72 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 75540 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 2
Probabilistic random walk after 75540 steps, saw 33249 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
[2024-06-01 16:25:01] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 16:25:01] [INFO ] Invariant cache hit.
[2024-06-01 16:25:01] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/254 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/355 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/469 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:25:02] [INFO ] Deduced a trap composed of 34 places in 456 ms of which 3 ms to minimize.
[2024-06-01 16:25:02] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 2 ms to minimize.
[2024-06-01 16:25:02] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:25:02] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 1 ms to minimize.
[2024-06-01 16:25:02] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/470 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2418/2888 variables, 470/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2888 variables, 168/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2888 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/2890 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2890 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2890 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2890 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2890/2890 variables, and 691 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7722 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 472/472 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/254 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/355 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/469 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:25:09] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/470 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2888/2890 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11720 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 470/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 19471ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 541 ms.
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 55 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 472/472 places, 2454/2454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 55 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
[2024-06-01 16:25:21] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 16:25:21] [INFO ] Invariant cache hit.
[2024-06-01 16:25:22] [INFO ] Implicit Places using invariants in 851 ms returned []
[2024-06-01 16:25:22] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 16:25:22] [INFO ] Invariant cache hit.
[2024-06-01 16:25:24] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:25:42] [INFO ] Implicit Places using invariants and state equation in 19942 ms returned []
Implicit Place search using SMT with State Equation took 20794 ms to find 0 implicit places.
[2024-06-01 16:25:42] [INFO ] Redundant transitions in 135 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-06-01 16:25:42] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 16:25:42] [INFO ] Invariant cache hit.
[2024-06-01 16:25:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 16:26:17] [INFO ] Deduced a trap composed of 147 places in 420 ms of which 3 ms to minimize.
[2024-06-01 16:26:17] [INFO ] Deduced a trap composed of 139 places in 338 ms of which 2 ms to minimize.
[2024-06-01 16:26:18] [INFO ] Deduced a trap composed of 39 places in 273 ms of which 1 ms to minimize.
[2024-06-01 16:26:18] [INFO ] Deduced a trap composed of 57 places in 424 ms of which 2 ms to minimize.
[2024-06-01 16:26:19] [INFO ] Deduced a trap composed of 149 places in 344 ms of which 2 ms to minimize.
[2024-06-01 16:26:20] [INFO ] Deduced a trap composed of 161 places in 365 ms of which 2 ms to minimize.
[2024-06-01 16:26:20] [INFO ] Deduced a trap composed of 158 places in 487 ms of which 2 ms to minimize.
[2024-06-01 16:26:21] [INFO ] Deduced a trap composed of 148 places in 322 ms of which 2 ms to minimize.
[2024-06-01 16:26:21] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2024-06-01 16:26:24] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 2 ms to minimize.
[2024-06-01 16:26:29] [INFO ] Deduced a trap composed of 161 places in 303 ms of which 2 ms to minimize.
[2024-06-01 16:26:29] [INFO ] Deduced a trap composed of 152 places in 276 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.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 1.0)
(s56 0.0)
(s57 1.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 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.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)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 2.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 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 10.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.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 1.0)
(s156 0.0)
(s157 2.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 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 6.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 2.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 1.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.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)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 2.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 2.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 1.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 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.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 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 466/2890 variables, and 51 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1107 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 16:26:36] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:26:36] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:26:37] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 2 ms to minimize.
[2024-06-01 16:26:37] [INFO ] Deduced a trap composed of 34 places in 257 ms of which 2 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 0 ms to minimize.
[2024-06-01 16:26:40] [INFO ] Deduced a trap composed of 159 places in 326 ms of which 3 ms to minimize.
[2024-06-01 16:26:40] [INFO ] Deduced a trap composed of 155 places in 289 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 9)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 3)
(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 1)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 6)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 2)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 7)
(s316 0)
(s317 0)
(s318 0)
(s319 7)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(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 1)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 60 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1107 constraints, Known Traps: 21/21 constraints]
After SMT, in 79768ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 79800ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100803 ms. Remains : 472/472 places, 2454/2454 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 246 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 1908 reset in 789 ms.
Product exploration explored 100000 steps with 1959 reset in 813 ms.
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 2467/2467 transitions.
Applied a total of 0 rules in 92 ms. Remains 485 /485 variables (removed 0) and now considering 2467/2467 (removed 0) transitions.
Running 2461 sub problems to find dead transitions.
[2024-06-01 16:27:04] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
// Phase 1: matrix 2431 rows 485 cols
[2024-06-01 16:27:04] [INFO ] Computed 46 invariants in 71 ms
[2024-06-01 16:27:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-06-01 16:27:37] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:27:38] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 37 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-06-01 16:27:45] [INFO ] Deduced a trap composed of 29 places in 414 ms of which 3 ms to minimize.
[2024-06-01 16:27:45] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 2 ms to minimize.
[2024-06-01 16:27:45] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 1 ms to minimize.
[2024-06-01 16:27:45] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:27:45] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:27:48] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 0 ms to minimize.
[2024-06-01 16:27:48] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:27:51] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 9)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 4)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s91 1)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 3)
(s124 1)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 7)
(s134 1)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 1)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 1)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 1)
(s189 1)
(s190 6)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 3)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(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)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 9)
(s324 1)
(s325 0)
(s326 0)
(s327 3)
(s328 0)
(s329 1)
(s330 0)
(s331 1)
(s332 0)
(s333 1)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(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 1)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 0)
(s409 4)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 3)
(s429 1)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 1)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 1)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 1)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 4)
(s469 0)
(s470 0)
(s471 1)
(s472 0)
(s473 0)
(s474 0)
(s475 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 45 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 10/10 constraints]
After SMT, in 57681ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 57698ms
[2024-06-01 16:28:02] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-06-01 16:28:02] [INFO ] Invariant cache hit.
[2024-06-01 16:28:03] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-06-01 16:28:03] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-06-01 16:28:03] [INFO ] Invariant cache hit.
[2024-06-01 16:28:05] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:28:35] [INFO ] Implicit Places using invariants and state equation in 32049 ms returned []
Implicit Place search using SMT with State Equation took 32677 ms to find 0 implicit places.
[2024-06-01 16:28:35] [INFO ] Redundant transitions in 95 ms returned []
Running 2461 sub problems to find dead transitions.
[2024-06-01 16:28:35] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-06-01 16:28:35] [INFO ] Invariant cache hit.
[2024-06-01 16:28:35] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-06-01 16:29:05] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 16:29:06] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 1 ms to minimize.
[2024-06-01 16:29:06] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:29:07] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 39 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-06-01 16:29:26] [INFO ] Deduced a trap composed of 60 places in 454 ms of which 3 ms to minimize.
[2024-06-01 16:29:26] [INFO ] Deduced a trap composed of 58 places in 441 ms of which 2 ms to minimize.
[2024-06-01 16:29:26] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2024-06-01 16:29:27] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:29:27] [INFO ] Deduced a trap composed of 29 places in 341 ms of which 1 ms to minimize.
[2024-06-01 16:29:28] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:29:37] [INFO ] Deduced a trap composed of 35 places in 383 ms of which 3 ms to minimize.
[2024-06-01 16:29:38] [INFO ] Deduced a trap composed of 54 places in 376 ms of which 3 ms to minimize.
[2024-06-01 16:29:38] [INFO ] Deduced a trap composed of 29 places in 326 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/479 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 48 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 13/13 constraints]
After SMT, in 77407ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 77426ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 168011 ms. Remains : 485/485 places, 2467/2467 transitions.
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-11 finished in 899285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&X(p1)))))))'
Support contains 4 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 55 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-06-01 16:29:52] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 676 cols
[2024-06-01 16:29:53] [INFO ] Computed 46 invariants in 53 ms
[2024-06-01 16:29:53] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/3298 variables, and 39 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2652/1398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2652 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-06-01 16:30:33] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:30:33] [INFO ] Deduced a trap composed of 145 places in 449 ms of which 4 ms to minimize.
[2024-06-01 16:30:34] [INFO ] Deduced a trap composed of 41 places in 381 ms of which 2 ms to minimize.
[2024-06-01 16:30:35] [INFO ] Deduced a trap composed of 301 places in 491 ms of which 3 ms to minimize.
[2024-06-01 16:30:36] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:30:37] [INFO ] Deduced a trap composed of 3 places in 417 ms of which 4 ms to minimize.
[2024-06-01 16:30:38] [INFO ] Deduced a trap composed of 69 places in 330 ms of which 2 ms to minimize.
[2024-06-01 16:30:38] [INFO ] Deduced a trap composed of 15 places in 280 ms of which 3 ms to minimize.
[2024-06-01 16:30:39] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 1 ms to minimize.
[2024-06-01 16:30:39] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 1 ms to minimize.
[2024-06-01 16:30:40] [INFO ] Deduced a trap composed of 318 places in 472 ms of which 10 ms to minimize.
[2024-06-01 16:30:41] [INFO ] Deduced a trap composed of 145 places in 516 ms of which 4 ms to minimize.
[2024-06-01 16:30:50] [INFO ] Deduced a trap composed of 110 places in 316 ms of which 3 ms to minimize.
[2024-06-01 16:30:50] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:30:50] [INFO ] Deduced a trap composed of 92 places in 74 ms of which 1 ms to minimize.
SMT process timed out in 57550ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 57571ms
[2024-06-01 16:30:50] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 16:30:50] [INFO ] Invariant cache hit.
[2024-06-01 16:30:51] [INFO ] Implicit Places using invariants in 859 ms returned []
[2024-06-01 16:30:51] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 16:30:51] [INFO ] Invariant cache hit.
[2024-06-01 16:30:52] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:31:13] [INFO ] Implicit Places using invariants and state equation in 21874 ms returned []
Implicit Place search using SMT with State Equation took 22753 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-06-01 16:31:13] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 16:31:13] [INFO ] Invariant cache hit.
[2024-06-01 16:31:13] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 182 places in 389 ms of which 4 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 146 places in 296 ms of which 3 ms to minimize.
[2024-06-01 16:31:56] [INFO ] Deduced a trap composed of 145 places in 398 ms of which 4 ms to minimize.
[2024-06-01 16:31:57] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 3 ms to minimize.
[2024-06-01 16:31:58] [INFO ] Deduced a trap composed of 324 places in 388 ms of which 3 ms to minimize.
[2024-06-01 16:31:58] [INFO ] Deduced a trap composed of 3 places in 440 ms of which 3 ms to minimize.
[2024-06-01 16:32:00] [INFO ] Deduced a trap composed of 319 places in 328 ms of which 3 ms to minimize.
[2024-06-01 16:32:01] [INFO ] Deduced a trap composed of 318 places in 459 ms of which 5 ms to minimize.
[2024-06-01 16:32:02] [INFO ] Deduced a trap composed of 142 places in 478 ms of which 4 ms to minimize.
SMT process timed out in 49191ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 49225ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129616 ms. Remains : 676/688 places, 2658/2670 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 99 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-12 finished in 129844 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)))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||(p1&&F(p0))))'
[2024-06-01 16:32:03] [INFO ] Flatten gal took : 204 ms
[2024-06-01 16:32:03] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 16:32:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 688 places, 2670 transitions and 15834 arcs took 36 ms.
Total runtime 3264173 ms.
There are residual formulas that ITS could not solve within timeout

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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024

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-S06J06T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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