About the Execution of GreatSPN+red for PolyORBNT-PT-S10J30
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10630.508 | 3600000.00 | 10598807.00 | 512.20 | ??F???F?FTF???T? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654446000490.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 PolyORBNT-PT-S10J30, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446000490
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 12K Apr 12 11:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 11:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 762K Apr 12 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.1M Apr 12 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J30-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716890215198
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:56:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 09:56:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:56:57] [INFO ] Load time of PNML (sax parser for PT used): 659 ms
[2024-05-28 09:56:57] [INFO ] Transformed 664 places.
[2024-05-28 09:56:57] [INFO ] Transformed 12050 transitions.
[2024-05-28 09:56:57] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 938 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 94 ms.
[2024-05-28 09:56:57] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 09:56:57] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 09:56:57] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 09:56:57] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 09:56:57] [INFO ] Reduced 780 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 628 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 65 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-05-28 09:56:58] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-05-28 09:56:58] [INFO ] Computed 92 invariants in 130 ms
[2024-05-28 09:56:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20133 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 58243ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 58305ms
[2024-05-28 09:57:56] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 09:57:56] [INFO ] Invariant cache hit.
[2024-05-28 09:57:56] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-28 09:57:56] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 09:57:56] [INFO ] Invariant cache hit.
[2024-05-28 09:57:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:57:57] [INFO ] Implicit Places using invariants and state equation in 1279 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-28 09:57:58] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 09:57:58] [INFO ] Invariant cache hit.
[2024-05-28 09:57:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
[2024-05-28 09:58:56] [INFO ] Deduced a trap composed of 19 places in 596 ms of which 39 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2595 variables, and 72 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 1/1 constraints]
After SMT, in 79046ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 79118ms
Finished structural reductions in LTL mode , in 1 iterations and 139154 ms. Remains : 664/664 places, 1940/1940 transitions.
Support contains 628 out of 664 places after structural reductions.
[2024-05-28 09:59:17] [INFO ] Flatten gal took : 426 ms
[2024-05-28 09:59:18] [INFO ] Flatten gal took : 255 ms
[2024-05-28 09:59:20] [INFO ] Input system was already deterministic with 1940 transitions.
Reduction of identical properties reduced properties to check from 79 to 77
RANDOM walk for 40000 steps (2235 resets) in 10429 ms. (3 steps per ms) remains 55/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 336 ms. (11 steps per ms) remains 52/55 properties
BEST_FIRST walk for 4004 steps (40 resets) in 431 ms. (9 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 472 ms. (8 steps per ms) remains 49/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 50 ms. (78 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (40 resets) in 167 ms. (23 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (40 resets) in 492 ms. (8 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (18 resets) in 137 ms. (29 steps per ms) remains 47/49 properties
BEST_FIRST walk for 4003 steps (41 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (12 resets) in 137 ms. (29 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (36 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (36 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (40 resets) in 25 ms. (154 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (36 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (40 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
[2024-05-28 09:59:24] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 09:59:24] [INFO ] Invariant cache hit.
[2024-05-28 09:59:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 154/612 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 4 (OVERLAPS) 52/664 variables, 27/92 constraints. Problems are: Problem set: 27 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/664 variables, 0/92 constraints. Problems are: Problem set: 27 solved, 3 unsolved
Problem AtomicPropp66 is UNSAT
At refinement iteration 6 (OVERLAPS) 1931/2595 variables, 664/756 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2595 variables, 1/757 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 28 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2595/2595 variables, and 757 constraints, problems are : Problem set: 28 solved, 2 unsolved in 3012 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 2/2 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 91/111 variables, 1/3 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 168/279 variables, 28/31 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/31 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 280/559 variables, 28/59 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 0/59 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 100/659 variables, 29/88 constraints. Problems are: Problem set: 28 solved, 2 unsolved
[2024-05-28 09:59:29] [INFO ] Deduced a trap composed of 24 places in 613 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/659 variables, 1/89 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/659 variables, 0/89 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/663 variables, 4/93 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/663 variables, 0/93 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1931/2594 variables, 663/756 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2594 variables, 1/757 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2594 variables, 1/758 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2594 variables, 0/758 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/2595 variables, 1/759 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2595 variables, 1/760 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2595 variables, 0/760 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2595 variables, 0/760 constraints. Problems are: Problem set: 28 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2595/2595 variables, and 760 constraints, problems are : Problem set: 28 solved, 2 unsolved in 3300 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 7981ms problems are : Problem set: 28 solved, 2 unsolved
Parikh walk visited 0 properties in 247 ms.
Support contains 3 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 place count 619 transition count 1905
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 80 place count 619 transition count 1870
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 150 place count 584 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 583 transition count 1869
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 583 transition count 1869
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 581 transition count 1867
Applied a total of 156 rules in 405 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
Running 1856 sub problems to find dead transitions.
[2024-05-28 09:59:32] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2024-05-28 09:59:32] [INFO ] Computed 82 invariants in 99 ms
[2024-05-28 09:59:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
SMT process timed out in 41989ms, After SMT, problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 42023ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42438 ms. Remains : 581/664 places, 1867/1940 transitions.
RANDOM walk for 40000 steps (2866 resets) in 2240 ms. (17 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (348 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
[2024-05-28 10:00:15] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2024-05-28 10:00:15] [INFO ] Invariant cache hit.
[2024-05-28 10:00:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 384/550 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/580 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1858/2438 variables, 580/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2438 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2438 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2439 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2439 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2439 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2439/2439 variables, and 664 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 581/581 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 384/550 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/580 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1858/2438 variables, 580/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2438 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2438 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2439 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2439 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2439 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2439 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2439/2439 variables, and 665 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1521 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 581/581 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2656ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 581 transition count 1866
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 580 transition count 1866
Applied a total of 2 rules in 158 ms. Remains 580 /581 variables (removed 1) and now considering 1866/1867 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 580/581 places, 1866/1867 transitions.
RANDOM walk for 40000 steps (2950 resets) in 1794 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (349 resets) in 356 ms. (112 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 211996 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 211996 steps, saw 35473 distinct states, run finished after 3006 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-28 10:00:22] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-05-28 10:00:22] [INFO ] Computed 82 invariants in 129 ms
[2024-05-28 10:00:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 987 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2437 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 664 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2457ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 120 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 94 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-05-28 10:00:24] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:00:25] [INFO ] Invariant cache hit.
[2024-05-28 10:00:26] [INFO ] Implicit Places using invariants in 1376 ms returned []
[2024-05-28 10:00:26] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:00:26] [INFO ] Invariant cache hit.
[2024-05-28 10:00:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:00:38] [INFO ] Implicit Places using invariants and state equation in 12098 ms returned []
Implicit Place search using SMT with State Equation took 13492 ms to find 0 implicit places.
[2024-05-28 10:00:38] [INFO ] Redundant transitions in 139 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-05-28 10:00:38] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:00:38] [INFO ] Invariant cache hit.
[2024-05-28 10:00:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 0/0 constraints]
After SMT, in 81136ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 81163ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94951 ms. Remains : 580/580 places, 1866/1866 transitions.
Successfully simplified 28 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 10:02:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 10:02:00] [INFO ] Flatten gal took : 339 ms
[2024-05-28 10:02:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 10:02:01] [INFO ] Flatten gal took : 319 ms
[2024-05-28 10:02:02] [INFO ] Input system was already deterministic with 1940 transitions.
Support contains 522 out of 664 places (down from 551) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1905
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1871
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1870
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1870
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 583 transition count 1869
Applied a total of 142 rules in 246 ms. Remains 583 /664 variables (removed 81) and now considering 1869/1940 (removed 71) transitions.
Running 1858 sub problems to find dead transitions.
[2024-05-28 10:02:02] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
// Phase 1: matrix 1860 rows 583 cols
[2024-05-28 10:02:02] [INFO ] Computed 82 invariants in 28 ms
[2024-05-28 10:02:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
SMT process timed out in 41154ms, After SMT, problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 41175ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41439 ms. Remains : 583/664 places, 1869/1940 transitions.
[2024-05-28 10:02:43] [INFO ] Flatten gal took : 103 ms
[2024-05-28 10:02:44] [INFO ] Flatten gal took : 185 ms
[2024-05-28 10:02:44] [INFO ] Input system was already deterministic with 1869 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Applied a total of 10 rules in 20 ms. Remains 654 /664 variables (removed 10) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-05-28 10:02:44] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 654 cols
[2024-05-28 10:02:44] [INFO ] Computed 82 invariants in 45 ms
[2024-05-28 10:02:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 9/20 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 9/20 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Finished structural reductions in LTL mode , in 1 iterations and 60122 ms. Remains : 654/664 places, 1940/1940 transitions.
[2024-05-28 10:03:44] [INFO ] Flatten gal took : 125 ms
[2024-05-28 10:03:44] [INFO ] Flatten gal took : 112 ms
[2024-05-28 10:03:45] [INFO ] Input system was already deterministic with 1940 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 43 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 10:03:45] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-05-28 10:03:45] [INFO ] Computed 82 invariants in 26 ms
[2024-05-28 10:03:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 4.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 9.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 4.0)
(s112 0.0)
(s113 4.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 4.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 4.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 10.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 3.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 4.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 2.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 4.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s445 4.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 4.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 1.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 1.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 4.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 1.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
SMT process timed out in 44026ms, After SMT, problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 44049ms
Finished structural reductions in LTL mode , in 1 iterations and 44097 ms. Remains : 653/664 places, 1939/1940 transitions.
[2024-05-28 10:04:29] [INFO ] Flatten gal took : 145 ms
[2024-05-28 10:04:29] [INFO ] Flatten gal took : 132 ms
[2024-05-28 10:04:29] [INFO ] Input system was already deterministic with 1939 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 619 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 618 transition count 1904
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1870
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 584 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 583 transition count 1869
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 583 transition count 1869
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 581 transition count 1867
Applied a total of 146 rules in 309 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
Running 1856 sub problems to find dead transitions.
[2024-05-28 10:04:30] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2024-05-28 10:04:30] [INFO ] Computed 82 invariants in 51 ms
[2024-05-28 10:04:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20069 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-05-28 10:05:16] [INFO ] Deduced a trap composed of 18 places in 431 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 73 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 1/1 constraints]
After SMT, in 61184ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 61238ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 61569 ms. Remains : 581/664 places, 1867/1940 transitions.
[2024-05-28 10:05:31] [INFO ] Flatten gal took : 206 ms
[2024-05-28 10:05:31] [INFO ] Flatten gal took : 87 ms
[2024-05-28 10:05:31] [INFO ] Input system was already deterministic with 1867 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 54 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 10:05:31] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-05-28 10:05:31] [INFO ] Computed 82 invariants in 41 ms
[2024-05-28 10:05:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 59978ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 59997ms
Finished structural reductions in LTL mode , in 1 iterations and 60056 ms. Remains : 653/664 places, 1939/1940 transitions.
[2024-05-28 10:06:32] [INFO ] Flatten gal took : 153 ms
[2024-05-28 10:06:32] [INFO ] Flatten gal took : 179 ms
[2024-05-28 10:06:32] [INFO ] Input system was already deterministic with 1939 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1904
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1904
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1869
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1868
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1868
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 580 transition count 1866
Applied a total of 148 rules in 135 ms. Remains 580 /664 variables (removed 84) and now considering 1866/1940 (removed 74) transitions.
Running 1855 sub problems to find dead transitions.
[2024-05-28 10:06:32] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-05-28 10:06:32] [INFO ] Computed 82 invariants in 36 ms
[2024-05-28 10:06:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-05-28 10:07:16] [INFO ] Deduced a trap composed of 87 places in 437 ms of which 4 ms to minimize.
[2024-05-28 10:07:24] [INFO ] Deduced a trap composed of 283 places in 589 ms of which 8 ms to minimize.
[2024-05-28 10:07:24] [INFO ] Deduced a trap composed of 265 places in 600 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 570/2437 variables, and 75 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 3/3 constraints]
After SMT, in 61948ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 61975ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 62116 ms. Remains : 580/664 places, 1866/1940 transitions.
[2024-05-28 10:07:34] [INFO ] Flatten gal took : 89 ms
[2024-05-28 10:07:34] [INFO ] Flatten gal took : 100 ms
[2024-05-28 10:07:35] [INFO ] Input system was already deterministic with 1866 transitions.
RANDOM walk for 40000 steps (2907 resets) in 916 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (383 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 225416 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 225416 steps, saw 37571 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-28 10:07:38] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:07:38] [INFO ] Invariant cache hit.
[2024-05-28 10:07:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 979 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 10:07:41] [INFO ] Deduced a trap composed of 113 places in 745 ms of which 3 ms to minimize.
[2024-05-28 10:07:41] [INFO ] Deduced a trap composed of 280 places in 657 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2436 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2437 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2811 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3830ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 52 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Running 1855 sub problems to find dead transitions.
[2024-05-28 10:07:42] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:07:42] [INFO ] Invariant cache hit.
[2024-05-28 10:07:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-05-28 10:08:25] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 3 ms to minimize.
[2024-05-28 10:08:32] [INFO ] Deduced a trap composed of 95 places in 679 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 74 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 60494ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 60521ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60591 ms. Remains : 580/580 places, 1866/1866 transitions.
RANDOM walk for 400000 steps (28839 resets) in 8461 ms. (47 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-28 10:08:45] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:08:45] [INFO ] Invariant cache hit.
[2024-05-28 10:08:45] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2024-05-28 10:08:46] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 57 ms returned sat
[2024-05-28 10:08:46] [INFO ] After 885ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 10:08:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:08:46] [INFO ] After 43ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 10:08:47] [INFO ] After 216ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 10:08:47] [INFO ] After 1393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 10:08:47] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2024-05-28 10:08:47] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 28 ms returned sat
[2024-05-28 10:08:48] [INFO ] After 1054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 10:08:48] [INFO ] After 321ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 10:08:48] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 10:08:48] [INFO ] After 1672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (290729 resets) in 67823 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (35713 resets) in 12778 ms. (313 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 5354070 steps, run timeout after 69001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 5354070 steps, saw 915644 distinct states, run finished after 69002 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-28 10:10:21] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:10:21] [INFO ] Invariant cache hit.
[2024-05-28 10:10:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 10:10:23] [INFO ] Deduced a trap composed of 113 places in 536 ms of which 5 ms to minimize.
[2024-05-28 10:10:24] [INFO ] Deduced a trap composed of 280 places in 541 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2436 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2437 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2556 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3434ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 53 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 77 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-05-28 10:10:25] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:10:25] [INFO ] Invariant cache hit.
[2024-05-28 10:10:26] [INFO ] Implicit Places using invariants in 1539 ms returned []
[2024-05-28 10:10:26] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:10:26] [INFO ] Invariant cache hit.
[2024-05-28 10:10:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:10:35] [INFO ] Implicit Places using invariants and state equation in 8748 ms returned []
Implicit Place search using SMT with State Equation took 10294 ms to find 0 implicit places.
[2024-05-28 10:10:35] [INFO ] Redundant transitions in 148 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-05-28 10:10:35] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:10:35] [INFO ] Invariant cache hit.
[2024-05-28 10:10:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 18 places in 455 ms of which 4 ms to minimize.
[2024-05-28 10:11:34] [INFO ] Deduced a trap composed of 95 places in 794 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 74 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 78963ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 78991ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89523 ms. Remains : 580/580 places, 1866/1866 transitions.
RANDOM walk for 400000 steps (29013 resets) in 7174 ms. (55 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-28 10:11:56] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:11:56] [INFO ] Invariant cache hit.
[2024-05-28 10:11:56] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2024-05-28 10:11:56] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 31 ms returned sat
[2024-05-28 10:11:57] [INFO ] After 657ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 10:11:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:11:57] [INFO ] After 70ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 10:11:57] [INFO ] After 190ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 10:11:57] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 10:11:57] [INFO ] [Nat]Absence check using 63 positive place invariants in 32 ms returned sat
[2024-05-28 10:11:58] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 68 ms returned sat
[2024-05-28 10:11:59] [INFO ] After 1106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 10:11:59] [INFO ] After 452ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 10:11:59] [INFO ] After 576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 10:11:59] [INFO ] After 1904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (2893 resets) in 860 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (345 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 225822 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 225822 steps, saw 37649 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-28 10:12:03] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:12:03] [INFO ] Invariant cache hit.
[2024-05-28 10:12:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 10:12:05] [INFO ] Deduced a trap composed of 113 places in 499 ms of which 4 ms to minimize.
[2024-05-28 10:12:05] [INFO ] Deduced a trap composed of 280 places in 467 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2436 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2437 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2272 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3191ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 51 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Running 1855 sub problems to find dead transitions.
[2024-05-28 10:12:06] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:12:06] [INFO ] Invariant cache hit.
[2024-05-28 10:12:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-05-28 10:12:47] [INFO ] Deduced a trap composed of 18 places in 418 ms of which 2 ms to minimize.
[2024-05-28 10:12:54] [INFO ] Deduced a trap composed of 95 places in 563 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 74 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 58835ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 58856ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58913 ms. Remains : 580/580 places, 1866/1866 transitions.
RANDOM walk for 40000 steps (2918 resets) in 842 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (353 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 229036 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 229036 steps, saw 38155 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-28 10:13:08] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:13:08] [INFO ] Invariant cache hit.
[2024-05-28 10:13:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 10:13:11] [INFO ] Deduced a trap composed of 113 places in 800 ms of which 5 ms to minimize.
[2024-05-28 10:13:11] [INFO ] Deduced a trap composed of 280 places in 668 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2436 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2437 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2799 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3752ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 45 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 44 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-05-28 10:13:12] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:13:12] [INFO ] Invariant cache hit.
[2024-05-28 10:13:13] [INFO ] Implicit Places using invariants in 940 ms returned []
[2024-05-28 10:13:13] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:13:13] [INFO ] Invariant cache hit.
[2024-05-28 10:13:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:13:22] [INFO ] Implicit Places using invariants and state equation in 9377 ms returned []
Implicit Place search using SMT with State Equation took 10335 ms to find 0 implicit places.
[2024-05-28 10:13:22] [INFO ] Redundant transitions in 46 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-05-28 10:13:22] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 10:13:22] [INFO ] Invariant cache hit.
[2024-05-28 10:13:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-05-28 10:14:17] [INFO ] Deduced a trap composed of 18 places in 494 ms of which 2 ms to minimize.
[2024-05-28 10:14:23] [INFO ] Deduced a trap composed of 95 places in 604 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 74 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 81472ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 81490ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91928 ms. Remains : 580/580 places, 1866/1866 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1857
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1856
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1856
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1855
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1855
Applied a total of 13 rules in 146 ms. Remains 578 /580 variables (removed 2) and now considering 1855/1866 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1855 rows 578 cols
[2024-05-28 10:14:44] [INFO ] Computed 82 invariants in 49 ms
[2024-05-28 10:14:44] [INFO ] [Real]Absence check using 62 positive place invariants in 11 ms returned sat
[2024-05-28 10:14:44] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 23 ms returned sat
[2024-05-28 10:14:44] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 10:14:44] [INFO ] [Nat]Absence check using 62 positive place invariants in 11 ms returned sat
[2024-05-28 10:14:44] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 22 ms returned sat
[2024-05-28 10:14:45] [INFO ] After 590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 10:14:45] [INFO ] After 692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 10:14:45] [INFO ] After 865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1192 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1906
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 620 transition count 1906
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 68 place count 620 transition count 1872
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 136 place count 586 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 585 transition count 1871
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 585 transition count 1871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 583 transition count 1869
Applied a total of 142 rules in 157 ms. Remains 583 /664 variables (removed 81) and now considering 1869/1940 (removed 71) transitions.
Running 1858 sub problems to find dead transitions.
[2024-05-28 10:14:45] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
// Phase 1: matrix 1860 rows 583 cols
[2024-05-28 10:14:45] [INFO ] Computed 82 invariants in 23 ms
[2024-05-28 10:14:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/2443 variables, and 72 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1858/858 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1858 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/2443 variables, and 72 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/858 constraints, Known Traps: 0/0 constraints]
After SMT, in 62079ms problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 62103ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 62266 ms. Remains : 583/664 places, 1869/1940 transitions.
[2024-05-28 10:15:47] [INFO ] Flatten gal took : 87 ms
[2024-05-28 10:15:48] [INFO ] Flatten gal took : 101 ms
[2024-05-28 10:15:48] [INFO ] Input system was already deterministic with 1869 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 44 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 10:15:48] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-05-28 10:15:48] [INFO ] Computed 82 invariants in 24 ms
[2024-05-28 10:15:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 61549ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 61577ms
Finished structural reductions in LTL mode , in 1 iterations and 61627 ms. Remains : 653/664 places, 1939/1940 transitions.
[2024-05-28 10:16:50] [INFO ] Flatten gal took : 101 ms
[2024-05-28 10:16:50] [INFO ] Flatten gal took : 109 ms
[2024-05-28 10:16:50] [INFO ] Input system was already deterministic with 1939 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 45 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 10:16:50] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 10:16:50] [INFO ] Invariant cache hit.
[2024-05-28 10:16:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 62342ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 62362ms
Finished structural reductions in LTL mode , in 1 iterations and 62414 ms. Remains : 653/664 places, 1939/1940 transitions.
[2024-05-28 10:17:52] [INFO ] Flatten gal took : 101 ms
[2024-05-28 10:17:52] [INFO ] Flatten gal took : 109 ms
[2024-05-28 10:17:53] [INFO ] Input system was already deterministic with 1939 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1905
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1871
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1870
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1870
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1868
Applied a total of 144 rules in 180 ms. Remains 582 /664 variables (removed 82) and now considering 1868/1940 (removed 72) transitions.
Running 1857 sub problems to find dead transitions.
[2024-05-28 10:17:53] [INFO ] Flow matrix only has 1859 transitions (discarded 9 similar events)
// Phase 1: matrix 1859 rows 582 cols
[2024-05-28 10:17:53] [INFO ] Computed 82 invariants in 50 ms
[2024-05-28 10:17:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2441 variables, and 72 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1857/857 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
[2024-05-28 10:18:37] [INFO ] Deduced a trap composed of 19 places in 481 ms of which 1 ms to minimize.
[2024-05-28 10:18:55] [INFO ] Deduced a trap composed of 96 places in 645 ms of which 5 ms to minimize.
SMT process timed out in 61977ms, After SMT, problems are : Problem set: 0 solved, 1857 unsolved
Search for dead transitions found 0 dead transitions in 61997ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 62194 ms. Remains : 582/664 places, 1868/1940 transitions.
[2024-05-28 10:18:55] [INFO ] Flatten gal took : 119 ms
[2024-05-28 10:18:55] [INFO ] Flatten gal took : 135 ms
[2024-05-28 10:18:55] [INFO ] Input system was already deterministic with 1868 transitions.
RANDOM walk for 24576 steps (1661 resets) in 594 ms. (41 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 84 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 10:18:56] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-05-28 10:18:56] [INFO ] Computed 82 invariants in 56 ms
[2024-05-28 10:18:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 1)
(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 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 9)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 3)
(s112 0)
(s113 3)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 2)
(s140 0)
(s141 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 4)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 1)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 4)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 1)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 10)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 1)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 3)
(s375 1)
(s376 1)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 1)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 1)
(s434 0)
(s435 0)
(s436 0)
(s437 4)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s445 3)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 3)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 1)
(s468 0)
(s469 1)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 1)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 0)
(s510 0)
(s511 3)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 1)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 1)
(s541 1)
(s542 0)
(s543 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 62333ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 62364ms
Finished structural reductions in LTL mode , in 1 iterations and 62454 ms. Remains : 653/664 places, 1939/1940 transitions.
[2024-05-28 10:19:58] [INFO ] Flatten gal took : 85 ms
[2024-05-28 10:19:58] [INFO ] Flatten gal took : 90 ms
[2024-05-28 10:19:58] [INFO ] Input system was already deterministic with 1939 transitions.
[2024-05-28 10:19:59] [INFO ] Flatten gal took : 145 ms
[2024-05-28 10:19:59] [INFO ] Flatten gal took : 149 ms
[2024-05-28 10:19:59] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 64 ms.
[2024-05-28 10:19:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 664 places, 1940 transitions and 13349 arcs took 25 ms.
Total runtime 1383332 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBNT-PT-S10J30
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 664
TRANSITIONS: 1940
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.054s, Sys 0.011s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.008s, 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: 919
MODEL NAME: /home/mcc/execution/412/model
664 places, 1940 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
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="PolyORBNT-PT-S10J30"
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 PolyORBNT-PT-S10J30, 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-171654446000490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 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 '
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 ;