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-171654446600226.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-S02J04T08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446600226
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 17K Apr 11 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 11 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:53 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 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 539K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 717K 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-S02J04T08-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717252289034

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:31:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:31:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:31:30] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-06-01 14:31:30] [INFO ] Transformed 614 places.
[2024-06-01 14:31:30] [INFO ] Transformed 1242 transitions.
[2024-06-01 14:31:30] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
[2024-06-01 14:31:30] [INFO ] Reduced 88 identical enabling conditions.
[2024-06-01 14:31:30] [INFO ] Reduced 32 identical enabling conditions.
[2024-06-01 14:31:30] [INFO ] Reduced 88 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 463 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Applied a total of 2 rules in 49 ms. Remains 612 /614 variables (removed 2) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-06-01 14:31:30] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-06-01 14:31:31] [INFO ] Computed 48 invariants in 60 ms
[2024-06-01 14:31:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:31:42] [INFO ] Deduced a trap composed of 65 places in 361 ms of which 35 ms to minimize.
[2024-06-01 14:31:43] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 4 ms to minimize.
[2024-06-01 14:31:43] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:31:43] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:31:43] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:31:43] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:31:44] [INFO ] Deduced a trap composed of 295 places in 276 ms of which 5 ms to minimize.
[2024-06-01 14:31:44] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 4 ms to minimize.
[2024-06-01 14:31:44] [INFO ] Deduced a trap composed of 315 places in 295 ms of which 5 ms to minimize.
[2024-06-01 14:31:45] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:31:45] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:31:46] [INFO ] Deduced a trap composed of 65 places in 324 ms of which 5 ms to minimize.
[2024-06-01 14:31:46] [INFO ] Deduced a trap composed of 178 places in 302 ms of which 4 ms to minimize.
[2024-06-01 14:31:46] [INFO ] Deduced a trap composed of 410 places in 348 ms of which 5 ms to minimize.
[2024-06-01 14:31:48] [INFO ] Deduced a trap composed of 290 places in 325 ms of which 5 ms to minimize.
[2024-06-01 14:31:49] [INFO ] Deduced a trap composed of 282 places in 218 ms of which 3 ms to minimize.
[2024-06-01 14:31:49] [INFO ] Deduced a trap composed of 292 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:31:51] [INFO ] Deduced a trap composed of 303 places in 317 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1710 variables, and 64 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:32:07] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1710 variables, and 65 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 19/19 constraints]
After SMT, in 41565ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41603ms
[2024-06-01 14:32:12] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 14:32:12] [INFO ] Invariant cache hit.
[2024-06-01 14:32:12] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 14:32:12] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 14:32:12] [INFO ] Invariant cache hit.
[2024-06-01 14:32:14] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:32:18] [INFO ] Implicit Places using invariants and state equation in 5568 ms returned []
Implicit Place search using SMT with State Equation took 5863 ms to find 0 implicit places.
Running 1112 sub problems to find dead transitions.
[2024-06-01 14:32:18] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 14:32:18] [INFO ] Invariant cache hit.
[2024-06-01 14:32:18] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:32:28] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 3 ms to minimize.
[2024-06-01 14:32:28] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 3 ms to minimize.
[2024-06-01 14:32:28] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:32:28] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:32:28] [INFO ] Deduced a trap composed of 66 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:32:28] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:32:29] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:32:29] [INFO ] Deduced a trap composed of 295 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:32:29] [INFO ] Deduced a trap composed of 321 places in 310 ms of which 4 ms to minimize.
[2024-06-01 14:32:29] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:32:29] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:32:30] [INFO ] Deduced a trap composed of 175 places in 257 ms of which 4 ms to minimize.
[2024-06-01 14:32:30] [INFO ] Deduced a trap composed of 407 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 330 places in 354 ms of which 4 ms to minimize.
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 318 places in 349 ms of which 4 ms to minimize.
[2024-06-01 14:32:33] [INFO ] Deduced a trap composed of 312 places in 251 ms of which 4 ms to minimize.
[2024-06-01 14:32:33] [INFO ] Deduced a trap composed of 293 places in 252 ms of which 4 ms to minimize.
[2024-06-01 14:32:33] [INFO ] Deduced a trap composed of 311 places in 290 ms of which 3 ms to minimize.
[2024-06-01 14:32:34] [INFO ] Deduced a trap composed of 79 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:32:36] [INFO ] Deduced a trap composed of 220 places in 348 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:32:40] [INFO ] Deduced a trap composed of 278 places in 339 ms of which 6 ms to minimize.
[2024-06-01 14:32:41] [INFO ] Deduced a trap composed of 299 places in 323 ms of which 5 ms to minimize.
[2024-06-01 14:32:43] [INFO ] Deduced a trap composed of 303 places in 367 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1710 variables, and 69 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 23/69 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:33:16] [INFO ] Deduced a trap composed of 178 places in 359 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1710 variables, and 70 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 24/24 constraints]
After SMT, in 61588ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 61609ms
Starting structural reductions in LTL mode, iteration 1 : 612/614 places, 1114/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109186 ms. Remains : 612/614 places, 1114/1114 transitions.
Support contains 463 out of 612 places after structural reductions.
[2024-06-01 14:33:20] [INFO ] Flatten gal took : 187 ms
[2024-06-01 14:33:20] [INFO ] Flatten gal took : 117 ms
[2024-06-01 14:33:20] [INFO ] Input system was already deterministic with 1114 transitions.
Support contains 455 out of 612 places (down from 463) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 89 to 88
RANDOM walk for 40000 steps (14 resets) in 1980 ms. (20 steps per ms) remains 27/88 properties
BEST_FIRST walk for 4002 steps (8 resets) in 171 ms. (23 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (9 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 44 ms. (88 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
[2024-06-01 14:33:22] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 14:33:22] [INFO ] Invariant cache hit.
[2024-06-01 14:33:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 315/466 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 2/468 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp88 is UNSAT
At refinement iteration 6 (OVERLAPS) 142/610 variables, 32/47 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 0/47 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1098/1708 variables, 610/657 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1708 variables, 96/753 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1708 variables, 0/753 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/1710 variables, 2/755 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1710 variables, 1/756 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1710 variables, 0/756 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1710 variables, 0/756 constraints. Problems are: Problem set: 22 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1710/1710 variables, and 756 constraints, problems are : Problem set: 22 solved, 5 unsolved in 4919 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 612/612 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 359/381 variables, 7/7 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/7 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 36/417 variables, 8/15 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/15 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 193/610 variables, 32/47 constraints. Problems are: Problem set: 22 solved, 5 unsolved
[2024-06-01 14:33:27] [INFO ] Deduced a trap composed of 65 places in 302 ms of which 4 ms to minimize.
[2024-06-01 14:33:28] [INFO ] Deduced a trap composed of 65 places in 312 ms of which 5 ms to minimize.
[2024-06-01 14:33:28] [INFO ] Deduced a trap composed of 312 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:33:28] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:33:29] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 4 ms to minimize.
[2024-06-01 14:33:29] [INFO ] Deduced a trap composed of 66 places in 300 ms of which 4 ms to minimize.
[2024-06-01 14:33:29] [INFO ] Deduced a trap composed of 65 places in 423 ms of which 18 ms to minimize.
[2024-06-01 14:33:30] [INFO ] Deduced a trap composed of 65 places in 339 ms of which 5 ms to minimize.
[2024-06-01 14:33:30] [INFO ] Deduced a trap composed of 333 places in 300 ms of which 3 ms to minimize.
[2024-06-01 14:33:30] [INFO ] Deduced a trap composed of 325 places in 326 ms of which 3 ms to minimize.
[2024-06-01 14:33:31] [INFO ] Deduced a trap composed of 277 places in 330 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/610 variables, 11/58 constraints. Problems are: Problem set: 22 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 0/58 constraints. Problems are: Problem set: 22 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1710 variables, and 668 constraints, problems are : Problem set: 22 solved, 5 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 610/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/27 constraints, Known Traps: 11/11 constraints]
After SMT, in 10110ms problems are : Problem set: 22 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 612 transition count 1046
Reduce places removed 68 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 70 rules applied. Total rules applied 138 place count 544 transition count 1044
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 140 place count 542 transition count 1044
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 140 place count 542 transition count 981
Deduced a syphon composed of 63 places in 2 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 266 place count 479 transition count 981
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 394 place count 415 transition count 917
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 408 place count 415 transition count 903
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 422 place count 401 transition count 903
Applied a total of 422 rules in 244 ms. Remains 401 /612 variables (removed 211) and now considering 903/1114 (removed 211) transitions.
Running 901 sub problems to find dead transitions.
[2024-06-01 14:33:32] [INFO ] Flow matrix only has 887 transitions (discarded 16 similar events)
// Phase 1: matrix 887 rows 401 cols
[2024-06-01 14:33:32] [INFO ] Computed 48 invariants in 29 ms
[2024-06-01 14:33:32] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 901 unsolved
[2024-06-01 14:33:40] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 3 ms to minimize.
[2024-06-01 14:33:40] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:33:40] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 4 ms to minimize.
[2024-06-01 14:33:40] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:33:40] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:33:40] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:33:40] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 10 ms to minimize.
[2024-06-01 14:33:41] [INFO ] Deduced a trap composed of 68 places in 337 ms of which 5 ms to minimize.
[2024-06-01 14:33:41] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:33:41] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:33:41] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:33:42] [INFO ] Deduced a trap composed of 135 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:33:43] [INFO ] Deduced a trap composed of 143 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:33:43] [INFO ] Deduced a trap composed of 223 places in 277 ms of which 2 ms to minimize.
[2024-06-01 14:33:46] [INFO ] Deduced a trap composed of 141 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:33:46] [INFO ] Deduced a trap composed of 153 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:33:47] [INFO ] Deduced a trap composed of 139 places in 196 ms of which 14 ms to minimize.
[2024-06-01 14:33:47] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:33:48] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:33:48] [INFO ] Deduced a trap composed of 159 places in 182 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 901 unsolved
[2024-06-01 14:33:53] [INFO ] Deduced a trap composed of 216 places in 211 ms of which 2 ms to minimize.
[2024-06-01 14:33:54] [INFO ] Deduced a trap composed of 151 places in 227 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/1288 variables, and 68 constraints, problems are : Problem set: 0 solved, 901 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/401 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 901 unsolved
[2024-06-01 14:34:04] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:34:12] [INFO ] Deduced a trap composed of 159 places in 260 ms of which 2 ms to minimize.
[2024-06-01 14:34:14] [INFO ] Deduced a trap composed of 181 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:34:14] [INFO ] Deduced a trap composed of 165 places in 196 ms of which 2 ms to minimize.
SMT process timed out in 42315ms, After SMT, problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 42331ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42578 ms. Remains : 401/612 places, 903/1114 transitions.
RANDOM walk for 40000 steps (19 resets) in 410 ms. (97 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (11 resets) in 234 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (15 resets) in 264 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (11 resets) in 304 ms. (131 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (15 resets) in 243 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (12 resets) in 192 ms. (207 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 120678 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 5
Probabilistic random walk after 120678 steps, saw 78791 distinct states, run finished after 3005 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 14:34:18] [INFO ] Flow matrix only has 887 transitions (discarded 16 similar events)
[2024-06-01 14:34:18] [INFO ] Invariant cache hit.
[2024-06-01 14:34:18] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 205/227 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 50/277 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/279 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 120/399 variables, 32/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:34:18] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:34:20] [INFO ] Deduced a trap composed of 148 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:34:20] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:34:20] [INFO ] Deduced a trap composed of 147 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:34:20] [INFO ] Deduced a trap composed of 146 places in 199 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:34:20] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 887/1286 variables, 399/457 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1286 variables, 96/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1286 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/1288 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1288 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1288 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/1288 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1288/1288 variables, and 556 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5356 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 401/401 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 205/227 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 50/277 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/279 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 120/399 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 887/1286 variables, 399/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1286 variables, 96/554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1286 variables, 5/559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1286 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 50392ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 903/903 transitions.
Applied a total of 0 rules in 23 ms. Remains 401 /401 variables (removed 0) and now considering 903/903 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 401/401 places, 903/903 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 903/903 transitions.
Applied a total of 0 rules in 21 ms. Remains 401 /401 variables (removed 0) and now considering 903/903 (removed 0) transitions.
[2024-06-01 14:35:09] [INFO ] Flow matrix only has 887 transitions (discarded 16 similar events)
[2024-06-01 14:35:09] [INFO ] Invariant cache hit.
[2024-06-01 14:35:09] [INFO ] Implicit Places using invariants in 446 ms returned [72, 120, 194, 202, 273, 316, 339, 346]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 451 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 393/401 places, 903/903 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 387 transition count 897
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 387 transition count 897
Applied a total of 12 rules in 41 ms. Remains 387 /393 variables (removed 6) and now considering 897/903 (removed 6) transitions.
[2024-06-01 14:35:09] [INFO ] Flow matrix only has 881 transitions (discarded 16 similar events)
// Phase 1: matrix 881 rows 387 cols
[2024-06-01 14:35:09] [INFO ] Computed 40 invariants in 27 ms
[2024-06-01 14:35:10] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-06-01 14:35:10] [INFO ] Flow matrix only has 881 transitions (discarded 16 similar events)
[2024-06-01 14:35:10] [INFO ] Invariant cache hit.
[2024-06-01 14:35:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:35:15] [INFO ] Implicit Places using invariants and state equation in 4999 ms returned []
Implicit Place search using SMT with State Equation took 5520 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 387/401 places, 897/903 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6034 ms. Remains : 387/401 places, 897/903 transitions.
Successfully simplified 22 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:35:15] [INFO ] Flatten gal took : 96 ms
[2024-06-01 14:35:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:35:15] [INFO ] Flatten gal took : 73 ms
[2024-06-01 14:35:15] [INFO ] Input system was already deterministic with 1114 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 43 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:35:15] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-06-01 14:35:15] [INFO ] Computed 48 invariants in 29 ms
[2024-06-01 14:35:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:35:25] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:35:25] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:35:25] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:35:25] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:35:25] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:35:25] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 283 places in 301 ms of which 4 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 4 ms to minimize.
[2024-06-01 14:35:27] [INFO ] Deduced a trap composed of 394 places in 265 ms of which 4 ms to minimize.
[2024-06-01 14:35:28] [INFO ] Deduced a trap composed of 314 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:35:29] [INFO ] Deduced a trap composed of 275 places in 317 ms of which 4 ms to minimize.
[2024-06-01 14:35:29] [INFO ] Deduced a trap composed of 288 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:35:29] [INFO ] Deduced a trap composed of 283 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:35:31] [INFO ] Deduced a trap composed of 3 places in 261 ms of which 4 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 54 places in 308 ms of which 5 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 304 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 302 places in 271 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:35:35] [INFO ] Deduced a trap composed of 342 places in 244 ms of which 4 ms to minimize.
[2024-06-01 14:35:35] [INFO ] Deduced a trap composed of 355 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:35:36] [INFO ] Deduced a trap composed of 347 places in 306 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 69 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 23/69 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:35:52] [INFO ] Deduced a trap composed of 287 places in 276 ms of which 5 ms to minimize.
[2024-06-01 14:35:54] [INFO ] Deduced a trap composed of 394 places in 290 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 71 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 25/25 constraints]
After SMT, in 41406ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41421ms
Finished structural reductions in LTL mode , in 1 iterations and 41467 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 14:35:56] [INFO ] Flatten gal took : 45 ms
[2024-06-01 14:35:57] [INFO ] Flatten gal took : 48 ms
[2024-06-01 14:35:57] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 45 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:35:57] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:35:57] [INFO ] Invariant cache hit.
[2024-06-01 14:35:57] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:36:08] [INFO ] Deduced a trap composed of 63 places in 149 ms of which 3 ms to minimize.
[2024-06-01 14:36:08] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:36:08] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:36:08] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:36:08] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:36:09] [INFO ] Deduced a trap composed of 64 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:36:09] [INFO ] Deduced a trap composed of 63 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:36:09] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:36:09] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:36:09] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:36:09] [INFO ] Deduced a trap composed of 59 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:36:10] [INFO ] Deduced a trap composed of 394 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:36:11] [INFO ] Deduced a trap composed of 293 places in 227 ms of which 3 ms to minimize.
[2024-06-01 14:36:11] [INFO ] Deduced a trap composed of 269 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:36:12] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:36:12] [INFO ] Deduced a trap composed of 283 places in 298 ms of which 4 ms to minimize.
[2024-06-01 14:36:13] [INFO ] Deduced a trap composed of 395 places in 218 ms of which 3 ms to minimize.
[2024-06-01 14:36:13] [INFO ] Deduced a trap composed of 287 places in 249 ms of which 4 ms to minimize.
[2024-06-01 14:36:14] [INFO ] Deduced a trap composed of 54 places in 249 ms of which 3 ms to minimize.
[2024-06-01 14:36:15] [INFO ] Deduced a trap composed of 311 places in 248 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 66 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:36:32] [INFO ] Deduced a trap composed of 350 places in 321 ms of which 4 ms to minimize.
[2024-06-01 14:36:33] [INFO ] Deduced a trap composed of 294 places in 350 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 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 9)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(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 9)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 68 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41525ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41539ms
Finished structural reductions in LTL mode , in 1 iterations and 41587 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 14:36:38] [INFO ] Flatten gal took : 74 ms
[2024-06-01 14:36:38] [INFO ] Flatten gal took : 52 ms
[2024-06-01 14:36:38] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 24 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:36:39] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:36:39] [INFO ] Invariant cache hit.
[2024-06-01 14:36:39] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:36:49] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:36:49] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:36:49] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 3 ms to minimize.
[2024-06-01 14:36:49] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 6 ms to minimize.
[2024-06-01 14:36:49] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:36:50] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:36:50] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:36:50] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:36:51] [INFO ] Deduced a trap composed of 168 places in 306 ms of which 5 ms to minimize.
[2024-06-01 14:36:51] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:36:51] [INFO ] Deduced a trap composed of 59 places in 251 ms of which 4 ms to minimize.
[2024-06-01 14:36:51] [INFO ] Deduced a trap composed of 394 places in 291 ms of which 4 ms to minimize.
[2024-06-01 14:36:53] [INFO ] Deduced a trap composed of 293 places in 316 ms of which 5 ms to minimize.
[2024-06-01 14:36:53] [INFO ] Deduced a trap composed of 269 places in 329 ms of which 5 ms to minimize.
[2024-06-01 14:36:54] [INFO ] Deduced a trap composed of 3 places in 301 ms of which 5 ms to minimize.
[2024-06-01 14:36:54] [INFO ] Deduced a trap composed of 283 places in 316 ms of which 4 ms to minimize.
[2024-06-01 14:36:55] [INFO ] Deduced a trap composed of 395 places in 304 ms of which 5 ms to minimize.
[2024-06-01 14:36:55] [INFO ] Deduced a trap composed of 287 places in 267 ms of which 4 ms to minimize.
[2024-06-01 14:36:57] [INFO ] Deduced a trap composed of 54 places in 337 ms of which 4 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 311 places in 361 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 66 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:37:15] [INFO ] Deduced a trap composed of 350 places in 305 ms of which 4 ms to minimize.
[2024-06-01 14:37:15] [INFO ] Deduced a trap composed of 294 places in 287 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 68 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41465ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41480ms
Finished structural reductions in LTL mode , in 1 iterations and 41508 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 14:37:20] [INFO ] Flatten gal took : 40 ms
[2024-06-01 14:37:20] [INFO ] Flatten gal took : 37 ms
[2024-06-01 14:37:20] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 19 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:37:20] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:37:20] [INFO ] Invariant cache hit.
[2024-06-01 14:37:20] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:37:31] [INFO ] Deduced a trap composed of 63 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:37:31] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:37:31] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:37:31] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:37:31] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:37:32] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-06-01 14:37:32] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:37:32] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 168 places in 322 ms of which 5 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 59 places in 284 ms of which 4 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 394 places in 355 ms of which 4 ms to minimize.
[2024-06-01 14:37:35] [INFO ] Deduced a trap composed of 293 places in 345 ms of which 5 ms to minimize.
[2024-06-01 14:37:35] [INFO ] Deduced a trap composed of 269 places in 326 ms of which 4 ms to minimize.
[2024-06-01 14:37:36] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 4 ms to minimize.
[2024-06-01 14:37:37] [INFO ] Deduced a trap composed of 283 places in 341 ms of which 4 ms to minimize.
[2024-06-01 14:37:37] [INFO ] Deduced a trap composed of 395 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:37:38] [INFO ] Deduced a trap composed of 287 places in 322 ms of which 4 ms to minimize.
[2024-06-01 14:37:39] [INFO ] Deduced a trap composed of 54 places in 319 ms of which 5 ms to minimize.
[2024-06-01 14:37:40] [INFO ] Deduced a trap composed of 311 places in 300 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 66 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:37:55] [INFO ] Deduced a trap composed of 350 places in 286 ms of which 4 ms to minimize.
[2024-06-01 14:37:55] [INFO ] Deduced a trap composed of 294 places in 314 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 68 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41320ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41334ms
Finished structural reductions in LTL mode , in 1 iterations and 41356 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 14:38:02] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:38:02] [INFO ] Flatten gal took : 30 ms
[2024-06-01 14:38:02] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 18 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:38:02] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:38:02] [INFO ] Invariant cache hit.
[2024-06-01 14:38:02] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 3 ms to minimize.
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:38:13] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:38:13] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:38:13] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:38:13] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:38:14] [INFO ] Deduced a trap composed of 168 places in 299 ms of which 4 ms to minimize.
[2024-06-01 14:38:14] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-06-01 14:38:14] [INFO ] Deduced a trap composed of 59 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:38:14] [INFO ] Deduced a trap composed of 394 places in 322 ms of which 4 ms to minimize.
[2024-06-01 14:38:16] [INFO ] Deduced a trap composed of 293 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:38:16] [INFO ] Deduced a trap composed of 269 places in 319 ms of which 4 ms to minimize.
[2024-06-01 14:38:17] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 4 ms to minimize.
[2024-06-01 14:38:17] [INFO ] Deduced a trap composed of 283 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:38:18] [INFO ] Deduced a trap composed of 395 places in 317 ms of which 5 ms to minimize.
[2024-06-01 14:38:19] [INFO ] Deduced a trap composed of 287 places in 349 ms of which 4 ms to minimize.
[2024-06-01 14:38:20] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:38:20] [INFO ] Deduced a trap composed of 311 places in 201 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 66 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:38:36] [INFO ] Deduced a trap composed of 350 places in 262 ms of which 4 ms to minimize.
[2024-06-01 14:38:37] [INFO ] Deduced a trap composed of 294 places in 303 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 68 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41375ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41386ms
Finished structural reductions in LTL mode , in 1 iterations and 41406 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 14:38:43] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:38:43] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:38:43] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Applied a total of 16 rules in 14 ms. Remains 604 /612 variables (removed 8) and now considering 1106/1114 (removed 8) transitions.
Running 1104 sub problems to find dead transitions.
[2024-06-01 14:38:43] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 604 cols
[2024-06-01 14:38:43] [INFO ] Computed 48 invariants in 26 ms
[2024-06-01 14:38:43] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-06-01 14:38:53] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:38:53] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:38:53] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 2 ms to minimize.
[2024-06-01 14:38:53] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:38:53] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:38:53] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:38:53] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:38:54] [INFO ] Deduced a trap composed of 295 places in 333 ms of which 5 ms to minimize.
[2024-06-01 14:38:54] [INFO ] Deduced a trap composed of 65 places in 307 ms of which 4 ms to minimize.
[2024-06-01 14:38:55] [INFO ] Deduced a trap composed of 318 places in 281 ms of which 5 ms to minimize.
[2024-06-01 14:38:55] [INFO ] Deduced a trap composed of 47 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:38:55] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:38:56] [INFO ] Deduced a trap composed of 291 places in 345 ms of which 4 ms to minimize.
[2024-06-01 14:38:56] [INFO ] Deduced a trap composed of 416 places in 334 ms of which 4 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 404 places in 320 ms of which 5 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 414 places in 293 ms of which 5 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 328 places in 328 ms of which 4 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 321 places in 324 ms of which 4 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 322 places in 329 ms of which 4 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 318 places in 315 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 284 places in 325 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/1694 variables, and 67 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/604 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-06-01 14:39:17] [INFO ] Deduced a trap composed of 302 places in 344 ms of which 5 ms to minimize.
[2024-06-01 14:39:18] [INFO ] Deduced a trap composed of 54 places in 354 ms of which 4 ms to minimize.
[2024-06-01 14:39:19] [INFO ] Deduced a trap composed of 352 places in 288 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/1694 variables, and 70 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/604 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 24/24 constraints]
After SMT, in 41242ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 41256ms
Finished structural reductions in LTL mode , in 1 iterations and 41273 ms. Remains : 604/612 places, 1106/1114 transitions.
[2024-06-01 14:39:25] [INFO ] Flatten gal took : 30 ms
[2024-06-01 14:39:25] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:39:25] [INFO ] Input system was already deterministic with 1106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Applied a total of 0 rules in 5 ms. Remains 612 /612 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-06-01 14:39:25] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-06-01 14:39:25] [INFO ] Computed 48 invariants in 30 ms
[2024-06-01 14:39:25] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:39:35] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:39:35] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:39:35] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 4 ms to minimize.
[2024-06-01 14:39:35] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:39:36] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:39:36] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-06-01 14:39:36] [INFO ] Deduced a trap composed of 295 places in 361 ms of which 5 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 66 places in 330 ms of which 4 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 315 places in 317 ms of which 4 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:39:38] [INFO ] Deduced a trap composed of 65 places in 336 ms of which 4 ms to minimize.
[2024-06-01 14:39:38] [INFO ] Deduced a trap composed of 178 places in 338 ms of which 5 ms to minimize.
[2024-06-01 14:39:39] [INFO ] Deduced a trap composed of 410 places in 332 ms of which 4 ms to minimize.
[2024-06-01 14:39:40] [INFO ] Deduced a trap composed of 290 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:39:41] [INFO ] Deduced a trap composed of 282 places in 324 ms of which 4 ms to minimize.
[2024-06-01 14:39:42] [INFO ] Deduced a trap composed of 292 places in 314 ms of which 5 ms to minimize.
[2024-06-01 14:39:44] [INFO ] Deduced a trap composed of 303 places in 326 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 6.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 10.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 4.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 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 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 9.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1710 variables, and 64 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 54 places in 303 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1710 variables, and 65 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 19/19 constraints]
After SMT, in 41302ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41312ms
Finished structural reductions in LTL mode , in 1 iterations and 41320 ms. Remains : 612/612 places, 1114/1114 transitions.
[2024-06-01 14:40:06] [INFO ] Flatten gal took : 48 ms
[2024-06-01 14:40:06] [INFO ] Flatten gal took : 43 ms
[2024-06-01 14:40:06] [INFO ] Input system was already deterministic with 1114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 23 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:40:06] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-06-01 14:40:06] [INFO ] Computed 48 invariants in 14 ms
[2024-06-01 14:40:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:40:16] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:40:16] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:40:16] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:40:16] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:40:16] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:40:16] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:40:16] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:40:16] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 4 ms to minimize.
[2024-06-01 14:40:17] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-06-01 14:40:17] [INFO ] Deduced a trap composed of 283 places in 302 ms of which 4 ms to minimize.
[2024-06-01 14:40:17] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 3 ms to minimize.
[2024-06-01 14:40:18] [INFO ] Deduced a trap composed of 394 places in 289 ms of which 4 ms to minimize.
[2024-06-01 14:40:19] [INFO ] Deduced a trap composed of 314 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:40:20] [INFO ] Deduced a trap composed of 275 places in 288 ms of which 4 ms to minimize.
[2024-06-01 14:40:20] [INFO ] Deduced a trap composed of 288 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:40:20] [INFO ] Deduced a trap composed of 283 places in 289 ms of which 8 ms to minimize.
[2024-06-01 14:40:23] [INFO ] Deduced a trap composed of 3 places in 326 ms of which 4 ms to minimize.
[2024-06-01 14:40:23] [INFO ] Deduced a trap composed of 54 places in 345 ms of which 5 ms to minimize.
[2024-06-01 14:40:24] [INFO ] Deduced a trap composed of 304 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:40:24] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:40:27] [INFO ] Deduced a trap composed of 342 places in 313 ms of which 4 ms to minimize.
[2024-06-01 14:40:27] [INFO ] Deduced a trap composed of 355 places in 365 ms of which 4 ms to minimize.
[2024-06-01 14:40:28] [INFO ] Deduced a trap composed of 347 places in 353 ms of which 5 ms to minimize.
SMT process timed out in 21477ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 21488ms
Finished structural reductions in LTL mode , in 1 iterations and 21514 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 14:40:28] [INFO ] Flatten gal took : 38 ms
[2024-06-01 14:40:28] [INFO ] Flatten gal took : 42 ms
[2024-06-01 14:40:28] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 540 transition count 1042
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 144 place count 540 transition count 979
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 270 place count 477 transition count 979
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 398 place count 413 transition count 915
Applied a total of 398 rules in 59 ms. Remains 413 /612 variables (removed 199) and now considering 915/1114 (removed 199) transitions.
Running 913 sub problems to find dead transitions.
[2024-06-01 14:40:28] [INFO ] Flow matrix only has 899 transitions (discarded 16 similar events)
// Phase 1: matrix 899 rows 413 cols
[2024-06-01 14:40:28] [INFO ] Computed 48 invariants in 21 ms
[2024-06-01 14:40:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-06-01 14:40:34] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:40:34] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:40:35] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 1 ms to minimize.
[2024-06-01 14:40:35] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:40:35] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:40:35] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:40:35] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:40:35] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:40:35] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 2 ms to minimize.
[2024-06-01 14:40:35] [INFO ] Deduced a trap composed of 91 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:40:36] [INFO ] Deduced a trap composed of 73 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:40:36] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:40:36] [INFO ] Deduced a trap composed of 155 places in 220 ms of which 4 ms to minimize.
[2024-06-01 14:40:36] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:40:37] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:40:37] [INFO ] Deduced a trap composed of 202 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:40:37] [INFO ] Deduced a trap composed of 148 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:40:38] [INFO ] Deduced a trap composed of 143 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:40:39] [INFO ] Deduced a trap composed of 234 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:40:43] [INFO ] Deduced a trap composed of 219 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-06-01 14:40:44] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:40:45] [INFO ] Deduced a trap composed of 165 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:40:49] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 2 ms to minimize.
SMT process timed out in 21477ms, After SMT, problems are : Problem set: 0 solved, 913 unsolved
Search for dead transitions found 0 dead transitions in 21488ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 21550 ms. Remains : 413/612 places, 915/1114 transitions.
[2024-06-01 14:40:49] [INFO ] Flatten gal took : 23 ms
[2024-06-01 14:40:49] [INFO ] Flatten gal took : 33 ms
[2024-06-01 14:40:50] [INFO ] Input system was already deterministic with 915 transitions.
RANDOM walk for 616 steps (1 resets) in 9 ms. (61 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 47 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:40:50] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-06-01 14:40:50] [INFO ] Computed 48 invariants in 26 ms
[2024-06-01 14:40:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:41:00] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:41:00] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:41:00] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:41:00] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:41:00] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:41:00] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:41:01] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:41:01] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:41:01] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:41:01] [INFO ] Deduced a trap composed of 283 places in 336 ms of which 4 ms to minimize.
[2024-06-01 14:41:02] [INFO ] Deduced a trap composed of 47 places in 290 ms of which 3 ms to minimize.
[2024-06-01 14:41:02] [INFO ] Deduced a trap composed of 394 places in 303 ms of which 5 ms to minimize.
[2024-06-01 14:41:03] [INFO ] Deduced a trap composed of 314 places in 371 ms of which 4 ms to minimize.
[2024-06-01 14:41:04] [INFO ] Deduced a trap composed of 275 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:41:04] [INFO ] Deduced a trap composed of 288 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:41:05] [INFO ] Deduced a trap composed of 283 places in 260 ms of which 3 ms to minimize.
[2024-06-01 14:41:07] [INFO ] Deduced a trap composed of 3 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:41:07] [INFO ] Deduced a trap composed of 54 places in 322 ms of which 4 ms to minimize.
[2024-06-01 14:41:08] [INFO ] Deduced a trap composed of 304 places in 289 ms of which 4 ms to minimize.
[2024-06-01 14:41:08] [INFO ] Deduced a trap composed of 302 places in 234 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 342 places in 329 ms of which 4 ms to minimize.
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 355 places in 317 ms of which 5 ms to minimize.
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 347 places in 310 ms of which 5 ms to minimize.
SMT process timed out in 21862ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 21875ms
Finished structural reductions in LTL mode , in 1 iterations and 21925 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 14:41:12] [INFO ] Flatten gal took : 37 ms
[2024-06-01 14:41:12] [INFO ] Flatten gal took : 42 ms
[2024-06-01 14:41:12] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 540 transition count 1042
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 144 place count 540 transition count 979
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 270 place count 477 transition count 979
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 398 place count 413 transition count 915
Applied a total of 398 rules in 98 ms. Remains 413 /612 variables (removed 199) and now considering 915/1114 (removed 199) transitions.
Running 913 sub problems to find dead transitions.
[2024-06-01 14:41:12] [INFO ] Flow matrix only has 899 transitions (discarded 16 similar events)
// Phase 1: matrix 899 rows 413 cols
[2024-06-01 14:41:12] [INFO ] Computed 48 invariants in 12 ms
[2024-06-01 14:41:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-06-01 14:41:18] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:41:18] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:41:19] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:41:19] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:41:19] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:41:19] [INFO ] Deduced a trap composed of 73 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:41:19] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:41:19] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:41:19] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:41:20] [INFO ] Deduced a trap composed of 150 places in 194 ms of which 6 ms to minimize.
[2024-06-01 14:41:20] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:41:20] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:41:21] [INFO ] Deduced a trap composed of 143 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:41:25] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:41:25] [INFO ] Deduced a trap composed of 184 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:41:26] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 168 places in 243 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-06-01 14:41:31] [INFO ] Deduced a trap composed of 235 places in 206 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/1312 variables, and 64 constraints, problems are : Problem set: 0 solved, 913 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/413 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 913/913 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 913 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-06-01 14:41:40] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:41:46] [INFO ] Deduced a trap composed of 172 places in 217 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 913 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/1312 variables, and 66 constraints, problems are : Problem set: 0 solved, 913 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/413 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/913 constraints, Known Traps: 20/20 constraints]
After SMT, in 41222ms problems are : Problem set: 0 solved, 913 unsolved
Search for dead transitions found 0 dead transitions in 41233ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41334 ms. Remains : 413/612 places, 915/1114 transitions.
[2024-06-01 14:41:53] [INFO ] Flatten gal took : 31 ms
[2024-06-01 14:41:53] [INFO ] Flatten gal took : 34 ms
[2024-06-01 14:41:53] [INFO ] Input system was already deterministic with 915 transitions.
RANDOM walk for 3380 steps (0 resets) in 25 ms. (130 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 28 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:41:53] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-06-01 14:41:53] [INFO ] Computed 48 invariants in 17 ms
[2024-06-01 14:41:53] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:42:04] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:42:04] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:42:04] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:42:04] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:42:05] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:42:05] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:42:05] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:42:05] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:42:05] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:42:06] [INFO ] Deduced a trap composed of 283 places in 340 ms of which 5 ms to minimize.
[2024-06-01 14:42:06] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:42:06] [INFO ] Deduced a trap composed of 394 places in 310 ms of which 4 ms to minimize.
[2024-06-01 14:42:08] [INFO ] Deduced a trap composed of 314 places in 385 ms of which 3 ms to minimize.
[2024-06-01 14:42:08] [INFO ] Deduced a trap composed of 275 places in 300 ms of which 4 ms to minimize.
[2024-06-01 14:42:09] [INFO ] Deduced a trap composed of 288 places in 277 ms of which 3 ms to minimize.
[2024-06-01 14:42:09] [INFO ] Deduced a trap composed of 283 places in 318 ms of which 5 ms to minimize.
[2024-06-01 14:42:11] [INFO ] Deduced a trap composed of 3 places in 301 ms of which 4 ms to minimize.
[2024-06-01 14:42:12] [INFO ] Deduced a trap composed of 54 places in 326 ms of which 3 ms to minimize.
[2024-06-01 14:42:12] [INFO ] Deduced a trap composed of 304 places in 303 ms of which 4 ms to minimize.
[2024-06-01 14:42:13] [INFO ] Deduced a trap composed of 302 places in 320 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 66 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:42:32] [INFO ] Deduced a trap composed of 294 places in 338 ms of which 5 ms to minimize.
[2024-06-01 14:42:32] [INFO ] Deduced a trap composed of 323 places in 299 ms of which 4 ms to minimize.
[2024-06-01 14:42:33] [INFO ] Deduced a trap composed of 354 places in 275 ms of which 4 ms to minimize.
[2024-06-01 14:42:33] [INFO ] Deduced a trap composed of 315 places in 268 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 70 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 24/24 constraints]
After SMT, in 41593ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41611ms
Finished structural reductions in LTL mode , in 1 iterations and 41643 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 14:42:35] [INFO ] Flatten gal took : 38 ms
[2024-06-01 14:42:35] [INFO ] Flatten gal took : 37 ms
[2024-06-01 14:42:35] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-06-01 14:42:35] [INFO ] Flatten gal took : 44 ms
[2024-06-01 14:42:35] [INFO ] Flatten gal took : 44 ms
[2024-06-01 14:42:35] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 19 ms.
[2024-06-01 14:42:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 612 places, 1114 transitions and 4818 arcs took 12 ms.
Total runtime 665316 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLFireability-2024-14

BK_STOP 1717252956135

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S02J04T08-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1817/ctl_0_
ctl formula name PolyORBLF-PT-S02J04T08-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1817/ctl_1_
ctl formula name PolyORBLF-PT-S02J04T08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1817/ctl_2_
ctl formula name PolyORBLF-PT-S02J04T08-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1817/ctl_3_
ctl formula name PolyORBLF-PT-S02J04T08-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1817/ctl_4_
ctl formula name PolyORBLF-PT-S02J04T08-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1817/ctl_5_
ctl formula name PolyORBLF-PT-S02J04T08-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1817/ctl_6_
ctl formula name PolyORBLF-PT-S02J04T08-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1817/ctl_7_
ctl formula name PolyORBLF-PT-S02J04T08-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1817/ctl_8_
ctl formula name PolyORBLF-PT-S02J04T08-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1817/ctl_9_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-S02J04T08"
export BK_EXAMINATION="CTLFireability"
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-S02J04T08, examination is CTLFireability"
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-171654446600226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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