Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 25K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 329K Apr 11 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 160K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 538K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 11 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716870649249

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:30:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 04:30:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:30:51] [INFO ] Load time of PNML (sax parser for PT used): 732 ms
[2024-05-28 04:30:51] [INFO ] Transformed 632 places.
[2024-05-28 04:30:51] [INFO ] Transformed 10500 transitions.
[2024-05-28 04:30:51] [INFO ] Parsed PT model containing 632 places and 10500 transitions and 88770 arcs in 958 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 37 ms.
[2024-05-28 04:30:51] [INFO ] Reduced 960 identical enabling conditions.
[2024-05-28 04:30:51] [INFO ] Reduced 960 identical enabling conditions.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 398 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Applied a total of 0 rules in 106 ms. Remains 632 /632 variables (removed 0) and now considering 2430/2430 (removed 0) transitions.
Running 2424 sub problems to find dead transitions.
[2024-05-28 04:30:52] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2024-05-28 04:30:52] [INFO ] Computed 54 invariants in 196 ms
[2024-05-28 04:30:52] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
SMT process timed out in 40152ms, After SMT, problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 40216ms
[2024-05-28 04:31:32] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-05-28 04:31:32] [INFO ] Invariant cache hit.
[2024-05-28 04:31:32] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-28 04:31:32] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-05-28 04:31:32] [INFO ] Invariant cache hit.
[2024-05-28 04:31:34] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 04:31:47] [INFO ] Implicit Places using invariants and state equation in 14787 ms returned []
Implicit Place search using SMT with State Equation took 15085 ms to find 0 implicit places.
Running 2424 sub problems to find dead transitions.
[2024-05-28 04:31:47] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-05-28 04:31:47] [INFO ] Invariant cache hit.
[2024-05-28 04:31:47] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-05-28 04:32:28] [INFO ] Deduced a trap composed of 123 places in 338 ms of which 28 ms to minimize.
[2024-05-28 04:32:29] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/3026 variables, and 39 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/37 constraints, State Equation: 0/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2424/1170 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-05-28 04:32:41] [INFO ] Deduced a trap composed of 35 places in 484 ms of which 4 ms to minimize.
[2024-05-28 04:32:41] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 2 ms to minimize.
[2024-05-28 04:32:41] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-28 04:32:41] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 1 ms to minimize.
[2024-05-28 04:32:46] [INFO ] Deduced a trap composed of 122 places in 193 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/3026 variables, and 44 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/37 constraints, State Equation: 0/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1170 constraints, Known Traps: 7/7 constraints]
After SMT, in 81025ms problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 81050ms
Finished structural reductions in LTL mode , in 1 iterations and 136542 ms. Remains : 632/632 places, 2430/2430 transitions.
Support contains 398 out of 632 places after structural reductions.
[2024-05-28 04:33:09] [INFO ] Flatten gal took : 373 ms
[2024-05-28 04:33:09] [INFO ] Flatten gal took : 214 ms
[2024-05-28 04:33:10] [INFO ] Input system was already deterministic with 2430 transitions.
Support contains 392 out of 632 places (down from 398) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 81 to 79
RANDOM walk for 40000 steps (274 resets) in 4703 ms. (8 steps per ms) remains 38/79 properties
BEST_FIRST walk for 4001 steps (11 resets) in 118 ms. (33 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (13 resets) in 40 ms. (97 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 218 ms. (18 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 45 ms. (87 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (9 resets) in 31 ms. (125 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 36 ms. (108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (9 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 37 ms. (105 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (8 resets) in 76 ms. (51 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 108 ms. (36 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 46 ms. (85 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 55 ms. (71 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (12 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (9 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 38/38 properties
[2024-05-28 04:33:12] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-05-28 04:33:12] [INFO ] Invariant cache hit.
[2024-05-28 04:33:12] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 2 (OVERLAPS) 129/176 variables, 8/9 constraints. Problems are: Problem set: 21 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/9 constraints. Problems are: Problem set: 21 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 12/188 variables, 3/12 constraints. Problems are: Problem set: 21 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 21 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 27/215 variables, 1/13 constraints. Problems are: Problem set: 21 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 21 solved, 17 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 8 (OVERLAPS) 400/615 variables, 29/42 constraints. Problems are: Problem set: 33 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 0/42 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 7/622 variables, 3/45 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 0/45 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 8/630 variables, 8/53 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/630 variables, 0/53 constraints. Problems are: Problem set: 33 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3024/3026 variables, and 683 constraints, problems are : Problem set: 33 solved, 5 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 630/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 38/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 33 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 113/123 variables, 5/5 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/139 variables, 4/9 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 40/179 variables, 3/12 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/12 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 425/604 variables, 23/35 constraints. Problems are: Problem set: 33 solved, 5 unsolved
[2024-05-28 04:33:20] [INFO ] Deduced a trap composed of 86 places in 280 ms of which 4 ms to minimize.
[2024-05-28 04:33:20] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 2 ms to minimize.
[2024-05-28 04:33:20] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 1 ms to minimize.
[2024-05-28 04:33:20] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2024-05-28 04:33:20] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 5/40 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 0/40 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 8/612 variables, 4/44 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 0/44 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 18/630 variables, 14/58 constraints. Problems are: Problem set: 33 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/630 variables, 0/58 constraints. Problems are: Problem set: 33 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3024/3026 variables, and 688 constraints, problems are : Problem set: 33 solved, 5 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 630/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 11725ms problems are : Problem set: 33 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 626 transition count 2382
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 102 place count 578 transition count 2382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 102 place count 578 transition count 2310
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 246 place count 506 transition count 2310
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 390 place count 434 transition count 2238
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 405 place count 434 transition count 2223
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 420 place count 419 transition count 2223
Applied a total of 420 rules in 504 ms. Remains 419 /632 variables (removed 213) and now considering 2223/2430 (removed 207) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-28 04:33:24] [INFO ] Flow matrix only has 2187 transitions (discarded 36 similar events)
// Phase 1: matrix 2187 rows 419 cols
[2024-05-28 04:33:24] [INFO ] Computed 48 invariants in 94 ms
[2024-05-28 04:33:24] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-28 04:34:00] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-28 04:34:00] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2606 variables, and 39 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 23/31 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2217/963 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-28 04:34:16] [INFO ] Deduced a trap composed of 50 places in 551 ms of which 3 ms to minimize.
[2024-05-28 04:34:17] [INFO ] Deduced a trap composed of 32 places in 484 ms of which 2 ms to minimize.
[2024-05-28 04:34:17] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 1 ms to minimize.
[2024-05-28 04:34:17] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2024-05-28 04:34:17] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2606 variables, and 44 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 23/31 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/963 constraints, Known Traps: 7/7 constraints]
After SMT, in 62481ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 62512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63022 ms. Remains : 419/632 places, 2223/2430 transitions.
RANDOM walk for 40000 steps (509 resets) in 928 ms. (43 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (56 resets) in 315 ms. (126 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (60 resets) in 325 ms. (122 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (36 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
[2024-05-28 04:34:27] [INFO ] Flow matrix only has 2187 transitions (discarded 36 similar events)
[2024-05-28 04:34:27] [INFO ] Invariant cache hit.
[2024-05-28 04:34:27] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/134 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 257/391 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 9/400 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/417 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2187/2604 variables, 417/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2604 variables, 168/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2604 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/2606 variables, 2/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2606 variables, 1/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2606 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2606 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2606/2606 variables, and 635 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5089 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 419/419 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/134 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 257/391 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:34:33] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 1 ms to minimize.
[2024-05-28 04:34:33] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 2 ms to minimize.
[2024-05-28 04:34:33] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/400 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/417 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2187/2604 variables, 417/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2604 variables, 168/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2604 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/2606 variables, 2/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2606 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2606 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2606 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2606/2606 variables, and 638 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5401 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 419/419 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 3/3 constraints]
After SMT, in 10535ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 5 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 2223/2223 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 2221
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 2221
Applied a total of 4 rules in 167 ms. Remains 417 /419 variables (removed 2) and now considering 2221/2223 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 417/419 places, 2221/2223 transitions.
RANDOM walk for 30367 steps (335 resets) in 880 ms. (34 steps per ms) remains 0/1 properties
Successfully simplified 33 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S06J04T06-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 04:34:39] [INFO ] Flatten gal took : 113 ms
[2024-05-28 04:34:39] [INFO ] Flatten gal took : 122 ms
[2024-05-28 04:34:39] [INFO ] Input system was already deterministic with 2430 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 626 transition count 2382
Reduce places removed 48 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 102 place count 578 transition count 2376
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 108 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 252 place count 500 transition count 2304
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 384 place count 434 transition count 2238
Applied a total of 384 rules in 164 ms. Remains 434 /632 variables (removed 198) and now considering 2238/2430 (removed 192) transitions.
Running 2232 sub problems to find dead transitions.
[2024-05-28 04:34:39] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
// Phase 1: matrix 2202 rows 434 cols
[2024-05-28 04:34:39] [INFO ] Computed 48 invariants in 39 ms
[2024-05-28 04:34:39] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 04:35:13] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-05-28 04:35:14] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/2636 variables, and 39 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 22/31 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 04:35:22] [INFO ] Deduced a trap composed of 53 places in 402 ms of which 2 ms to minimize.
[2024-05-28 04:35:23] [INFO ] Deduced a trap composed of 29 places in 464 ms of which 2 ms to minimize.
[2024-05-28 04:35:23] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-05-28 04:35:23] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-05-28 04:35:27] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-28 04:35:27] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-28 04:35:28] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 3 ms to minimize.
[2024-05-28 04:35:29] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/2636 variables, and 47 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 22/31 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 10/10 constraints]
After SMT, in 59743ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 59766ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 59936 ms. Remains : 434/632 places, 2238/2430 transitions.
[2024-05-28 04:35:39] [INFO ] Flatten gal took : 159 ms
[2024-05-28 04:35:39] [INFO ] Flatten gal took : 113 ms
[2024-05-28 04:35:40] [INFO ] Input system was already deterministic with 2238 transitions.
RANDOM walk for 71 steps (3 resets) in 8 ms. (7 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S06J04T06-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 243 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:35:40] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-05-28 04:35:40] [INFO ] Computed 48 invariants in 73 ms
[2024-05-28 04:35:40] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 37 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:36:23] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 3 ms to minimize.
[2024-05-28 04:36:24] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 3 ms to minimize.
[2024-05-28 04:36:26] [INFO ] Deduced a trap composed of 84 places in 450 ms of which 7 ms to minimize.
[2024-05-28 04:36:26] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2024-05-28 04:36:27] [INFO ] Deduced a trap composed of 98 places in 527 ms of which 3 ms to minimize.
[2024-05-28 04:36:27] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-05-28 04:36:27] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
[2024-05-28 04:36:29] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-28 04:36:29] [INFO ] Deduced a trap composed of 110 places in 186 ms of which 3 ms to minimize.
[2024-05-28 04:36:30] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 60985ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61010ms
Finished structural reductions in LTL mode , in 1 iterations and 61261 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-05-28 04:36:41] [INFO ] Flatten gal took : 147 ms
[2024-05-28 04:36:41] [INFO ] Flatten gal took : 158 ms
[2024-05-28 04:36:42] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 626 transition count 2376
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 500 transition count 2304
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 324 place count 464 transition count 2268
Applied a total of 324 rules in 347 ms. Remains 464 /632 variables (removed 168) and now considering 2268/2430 (removed 162) transitions.
Running 2262 sub problems to find dead transitions.
[2024-05-28 04:36:42] [INFO ] Flow matrix only has 2232 transitions (discarded 36 similar events)
// Phase 1: matrix 2232 rows 464 cols
[2024-05-28 04:36:42] [INFO ] Computed 48 invariants in 78 ms
[2024-05-28 04:36:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2024-05-28 04:37:16] [INFO ] Deduced a trap composed of 174 places in 367 ms of which 3 ms to minimize.
[2024-05-28 04:37:16] [INFO ] Deduced a trap composed of 44 places in 292 ms of which 2 ms to minimize.
[2024-05-28 04:37:17] [INFO ] Deduced a trap composed of 63 places in 430 ms of which 3 ms to minimize.
[2024-05-28 04:37:19] [INFO ] Deduced a trap composed of 114 places in 293 ms of which 2 ms to minimize.
[2024-05-28 04:37:19] [INFO ] Deduced a trap composed of 91 places in 296 ms of which 2 ms to minimize.
[2024-05-28 04:37:21] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/2696 variables, and 47 constraints, problems are : Problem set: 0 solved, 2262 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 24/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2262/1008 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2024-05-28 04:37:28] [INFO ] Deduced a trap composed of 150 places in 393 ms of which 2 ms to minimize.
[2024-05-28 04:37:33] [INFO ] Deduced a trap composed of 168 places in 360 ms of which 3 ms to minimize.
[2024-05-28 04:37:36] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 4 ms to minimize.
[2024-05-28 04:37:37] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-28 04:37:39] [INFO ] Deduced a trap composed of 75 places in 356 ms of which 3 ms to minimize.
[2024-05-28 04:37:40] [INFO ] Deduced a trap composed of 62 places in 345 ms of which 3 ms to minimize.
[2024-05-28 04:37:40] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 1 ms to minimize.
[2024-05-28 04:37:40] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/2696 variables, and 55 constraints, problems are : Problem set: 0 solved, 2262 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 24/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1008 constraints, Known Traps: 14/14 constraints]
After SMT, in 59996ms problems are : Problem set: 0 solved, 2262 unsolved
Search for dead transitions found 0 dead transitions in 60045ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60405 ms. Remains : 464/632 places, 2268/2430 transitions.
[2024-05-28 04:37:42] [INFO ] Flatten gal took : 117 ms
[2024-05-28 04:37:42] [INFO ] Flatten gal took : 127 ms
[2024-05-28 04:37:42] [INFO ] Input system was already deterministic with 2268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Applied a total of 6 rules in 33 ms. Remains 626 /632 variables (removed 6) and now considering 2430/2430 (removed 0) transitions.
Running 2424 sub problems to find dead transitions.
[2024-05-28 04:37:43] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 626 cols
[2024-05-28 04:37:43] [INFO ] Computed 48 invariants in 46 ms
[2024-05-28 04:37:43] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-05-28 04:38:22] [INFO ] Deduced a trap composed of 123 places in 140 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 10.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 3.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 9.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 4.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 4.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 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 3.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 4.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 3.0)
(s144 2.0)
(s145 2.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 4.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 8.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 4.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 2.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 3.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/3020 variables, and 38 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 26/34 constraints, State Equation: 0/626 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2424/1170 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-05-28 04:38:26] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-28 04:38:32] [INFO ] Deduced a trap composed of 15 places in 650 ms of which 4 ms to minimize.
[2024-05-28 04:38:33] [INFO ] Deduced a trap composed of 72 places in 516 ms of which 2 ms to minimize.
[2024-05-28 04:38:33] [INFO ] Deduced a trap composed of 35 places in 457 ms of which 2 ms to minimize.
[2024-05-28 04:38:34] [INFO ] Deduced a trap composed of 86 places in 484 ms of which 3 ms to minimize.
[2024-05-28 04:38:35] [INFO ] Deduced a trap composed of 47 places in 563 ms of which 3 ms to minimize.
[2024-05-28 04:38:35] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-28 04:38:35] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/3020 variables, and 46 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 26/34 constraints, State Equation: 0/626 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1170 constraints, Known Traps: 9/9 constraints]
After SMT, in 60308ms problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Finished structural reductions in LTL mode , in 1 iterations and 60370 ms. Remains : 626/632 places, 2430/2430 transitions.
[2024-05-28 04:38:43] [INFO ] Flatten gal took : 125 ms
[2024-05-28 04:38:43] [INFO ] Flatten gal took : 91 ms
[2024-05-28 04:38:43] [INFO ] Input system was already deterministic with 2430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Applied a total of 0 rules in 20 ms. Remains 632 /632 variables (removed 0) and now considering 2430/2430 (removed 0) transitions.
Running 2424 sub problems to find dead transitions.
[2024-05-28 04:38:43] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2024-05-28 04:38:43] [INFO ] Computed 54 invariants in 77 ms
[2024-05-28 04:38:43] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/3026 variables, and 37 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/37 constraints, State Equation: 0/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2424/1170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-05-28 04:39:25] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 2 ms to minimize.
[2024-05-28 04:39:26] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/3026 variables, and 39 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/37 constraints, State Equation: 0/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1170 constraints, Known Traps: 2/2 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Finished structural reductions in LTL mode , in 1 iterations and 60230 ms. Remains : 632/632 places, 2430/2430 transitions.
[2024-05-28 04:39:44] [INFO ] Flatten gal took : 113 ms
[2024-05-28 04:39:44] [INFO ] Flatten gal took : 127 ms
[2024-05-28 04:39:44] [INFO ] Input system was already deterministic with 2430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 76 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:39:44] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-05-28 04:39:44] [INFO ] Computed 48 invariants in 74 ms
[2024-05-28 04:39:44] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 37 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:40:26] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 3 ms to minimize.
[2024-05-28 04:40:27] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2024-05-28 04:40:30] [INFO ] Deduced a trap composed of 84 places in 532 ms of which 4 ms to minimize.
[2024-05-28 04:40:30] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 1 ms to minimize.
[2024-05-28 04:40:30] [INFO ] Deduced a trap composed of 98 places in 590 ms of which 4 ms to minimize.
[2024-05-28 04:40:31] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-05-28 04:40:31] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 3 ms to minimize.
[2024-05-28 04:40:32] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-28 04:40:33] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 2 ms to minimize.
[2024-05-28 04:40:33] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Finished structural reductions in LTL mode , in 1 iterations and 60290 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-05-28 04:40:44] [INFO ] Flatten gal took : 108 ms
[2024-05-28 04:40:44] [INFO ] Flatten gal took : 124 ms
[2024-05-28 04:40:45] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 69 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:40:45] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:40:45] [INFO ] Invariant cache hit.
[2024-05-28 04:40:45] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 3.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 9.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 4.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 4.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 3.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 4.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s115 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 37 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:41:26] [INFO ] Deduced a trap composed of 111 places in 150 ms of which 2 ms to minimize.
[2024-05-28 04:41:28] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-05-28 04:41:31] [INFO ] Deduced a trap composed of 112 places in 200 ms of which 3 ms to minimize.
[2024-05-28 04:41:34] [INFO ] Deduced a trap composed of 15 places in 479 ms of which 3 ms to minimize.
[2024-05-28 04:41:34] [INFO ] Deduced a trap composed of 41 places in 585 ms of which 2 ms to minimize.
[2024-05-28 04:41:35] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2024-05-28 04:41:35] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2024-05-28 04:41:35] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 45 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 8/8 constraints]
After SMT, in 59643ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 59665ms
Finished structural reductions in LTL mode , in 1 iterations and 59740 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-05-28 04:41:44] [INFO ] Flatten gal took : 86 ms
[2024-05-28 04:41:45] [INFO ] Flatten gal took : 96 ms
[2024-05-28 04:41:45] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 70 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:41:45] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:41:45] [INFO ] Invariant cache hit.
[2024-05-28 04:41:45] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:42:24] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 38 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:42:27] [INFO ] Deduced a trap composed of 111 places in 100 ms of which 2 ms to minimize.
[2024-05-28 04:42:28] [INFO ] Deduced a trap composed of 85 places in 490 ms of which 3 ms to minimize.
[2024-05-28 04:42:28] [INFO ] Deduced a trap composed of 41 places in 454 ms of which 3 ms to minimize.
[2024-05-28 04:42:28] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 0 ms to minimize.
[2024-05-28 04:42:28] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2024-05-28 04:42:29] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2024-05-28 04:42:34] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 4 ms to minimize.
[2024-05-28 04:42:42] [INFO ] Deduced a trap composed of 110 places in 180 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 608/2996 variables, and 46 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 59580ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 59602ms
Finished structural reductions in LTL mode , in 1 iterations and 59678 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-05-28 04:42:45] [INFO ] Flatten gal took : 88 ms
[2024-05-28 04:42:45] [INFO ] Flatten gal took : 96 ms
[2024-05-28 04:42:45] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 626 transition count 2382
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 578 transition count 2382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 96 place count 578 transition count 2310
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 240 place count 506 transition count 2310
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 384 place count 434 transition count 2238
Applied a total of 384 rules in 215 ms. Remains 434 /632 variables (removed 198) and now considering 2238/2430 (removed 192) transitions.
Running 2232 sub problems to find dead transitions.
[2024-05-28 04:42:45] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
// Phase 1: matrix 2202 rows 434 cols
[2024-05-28 04:42:45] [INFO ] Computed 48 invariants in 39 ms
[2024-05-28 04:42:45] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 04:43:22] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2024-05-28 04:43:23] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-28 04:43:28] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/2636 variables, and 40 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 23/33 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 04:43:35] [INFO ] Deduced a trap composed of 35 places in 629 ms of which 4 ms to minimize.
[2024-05-28 04:43:35] [INFO ] Deduced a trap composed of 53 places in 563 ms of which 3 ms to minimize.
[2024-05-28 04:43:35] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2024-05-28 04:43:35] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-05-28 04:43:36] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 0 ms to minimize.
[2024-05-28 04:43:36] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/2636 variables, and 46 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 23/33 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 9/9 constraints]
After SMT, in 64198ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 64219ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 64441 ms. Remains : 434/632 places, 2238/2430 transitions.
[2024-05-28 04:43:49] [INFO ] Flatten gal took : 86 ms
[2024-05-28 04:43:50] [INFO ] Flatten gal took : 162 ms
[2024-05-28 04:43:50] [INFO ] Input system was already deterministic with 2238 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 94 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:43:50] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-05-28 04:43:50] [INFO ] Computed 48 invariants in 91 ms
[2024-05-28 04:43:50] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 37 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:44:32] [INFO ] Deduced a trap composed of 111 places in 177 ms of which 3 ms to minimize.
[2024-05-28 04:44:33] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-28 04:44:36] [INFO ] Deduced a trap composed of 84 places in 600 ms of which 4 ms to minimize.
[2024-05-28 04:44:36] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 1 ms to minimize.
[2024-05-28 04:44:37] [INFO ] Deduced a trap composed of 98 places in 583 ms of which 4 ms to minimize.
[2024-05-28 04:44:37] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-05-28 04:44:38] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 2 ms to minimize.
[2024-05-28 04:44:39] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 1 ms to minimize.
[2024-05-28 04:44:40] [INFO ] Deduced a trap composed of 110 places in 190 ms of which 3 ms to minimize.
[2024-05-28 04:44:40] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 60302ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Finished structural reductions in LTL mode , in 1 iterations and 60429 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-05-28 04:44:50] [INFO ] Flatten gal took : 94 ms
[2024-05-28 04:44:50] [INFO ] Flatten gal took : 99 ms
[2024-05-28 04:44:51] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 75 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:44:51] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:44:51] [INFO ] Invariant cache hit.
[2024-05-28 04:44:51] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 37 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:45:38] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 3 ms to minimize.
[2024-05-28 04:45:39] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-28 04:45:43] [INFO ] Deduced a trap composed of 112 places in 190 ms of which 3 ms to minimize.
[2024-05-28 04:45:45] [INFO ] Deduced a trap composed of 15 places in 527 ms of which 3 ms to minimize.
[2024-05-28 04:45:46] [INFO ] Deduced a trap composed of 41 places in 447 ms of which 2 ms to minimize.
[2024-05-28 04:45:46] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2024-05-28 04:45:46] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-28 04:45:46] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 9)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 9)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 4)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 3)
(s143 2)
(s144 2)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 4)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 9)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 4)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 2)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 45 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 8/8 constraints]
After SMT, in 65181ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 65213ms
Finished structural reductions in LTL mode , in 1 iterations and 65297 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-05-28 04:45:56] [INFO ] Flatten gal took : 80 ms
[2024-05-28 04:45:56] [INFO ] Flatten gal took : 87 ms
[2024-05-28 04:45:56] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 69 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:45:56] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:45:56] [INFO ] Invariant cache hit.
[2024-05-28 04:45:56] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 37 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:46:40] [INFO ] Deduced a trap composed of 111 places in 149 ms of which 2 ms to minimize.
[2024-05-28 04:46:41] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-05-28 04:46:45] [INFO ] Deduced a trap composed of 112 places in 179 ms of which 2 ms to minimize.
[2024-05-28 04:46:48] [INFO ] Deduced a trap composed of 15 places in 555 ms of which 3 ms to minimize.
[2024-05-28 04:46:48] [INFO ] Deduced a trap composed of 41 places in 453 ms of which 2 ms to minimize.
[2024-05-28 04:46:48] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 1 ms to minimize.
[2024-05-28 04:46:48] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 1 ms to minimize.
[2024-05-28 04:46:49] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 45 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 8/8 constraints]
After SMT, in 61812ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61839ms
Finished structural reductions in LTL mode , in 1 iterations and 61914 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-05-28 04:46:58] [INFO ] Flatten gal took : 84 ms
[2024-05-28 04:46:58] [INFO ] Flatten gal took : 99 ms
[2024-05-28 04:46:59] [INFO ] Input system was already deterministic with 2418 transitions.
[2024-05-28 04:46:59] [INFO ] Flatten gal took : 137 ms
[2024-05-28 04:46:59] [INFO ] Flatten gal took : 150 ms
[2024-05-28 04:46:59] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2024-05-28 04:46:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 632 places, 2430 transitions and 14880 arcs took 22 ms.
Total runtime 968984 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J04T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 632
TRANSITIONS: 2430
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.082s, Sys 0.015s]


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


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

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

Process ID: 1144
MODEL NAME: /home/mcc/execution/417/model
632 places, 2430 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S06J04T06, 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 r289-tajo-171654445700322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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