Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.2K Apr 12 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 11:03 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 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K 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-COL-S10J20-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-COL-S10J20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717258577411

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:16:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:16:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:16:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 16:16:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:16:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 580 ms
[2024-06-01 16:16:19] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2024-06-01 16:16:19] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-06-01 16:16:19] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40012 steps (2284 resets) in 1808 ms. (22 steps per ms) remains 91/96 properties
BEST_FIRST walk for 4001 steps (81 resets) in 78 ms. (50 steps per ms) remains 70/91 properties
BEST_FIRST walk for 4004 steps (84 resets) in 68 ms. (58 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (74 resets) in 85 ms. (46 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (84 resets) in 54 ms. (72 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4006 steps (85 resets) in 24 ms. (160 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (71 resets) in 29 ms. (133 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (73 resets) in 26 ms. (148 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (81 resets) in 22 ms. (174 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (90 resets) in 32 ms. (121 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4006 steps (75 resets) in 21 ms. (182 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (79 resets) in 22 ms. (174 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (103 resets) in 41 ms. (95 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (71 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (77 resets) in 27 ms. (142 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (80 resets) in 22 ms. (173 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (80 resets) in 21 ms. (181 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (77 resets) in 32 ms. (121 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (102 resets) in 21 ms. (181 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4010 steps (84 resets) in 23 ms. (167 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (71 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (71 resets) in 57 ms. (69 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (75 resets) in 22 ms. (174 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (73 resets) in 21 ms. (181 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (75 resets) in 24 ms. (160 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (78 resets) in 21 ms. (181 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (77 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (79 resets) in 22 ms. (174 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (79 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (80 resets) in 22 ms. (174 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (95 resets) in 36 ms. (108 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (71 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4011 steps (85 resets) in 20 ms. (191 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (79 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4008 steps (77 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (76 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (75 resets) in 23 ms. (166 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (97 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (101 resets) in 23 ms. (166 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (84 resets) in 46 ms. (85 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (78 resets) in 43 ms. (91 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (80 resets) in 47 ms. (83 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (73 resets) in 31 ms. (125 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (75 resets) in 29 ms. (133 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4009 steps (128 resets) in 17 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (84 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (81 resets) in 26 ms. (148 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (81 resets) in 29 ms. (133 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4009 steps (76 resets) in 23 ms. (167 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (81 resets) in 24 ms. (160 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (72 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
// Phase 1: matrix 38 rows 48 cols
[2024-06-01 16:16:20] [INFO ] Computed 13 invariants in 9 ms
[2024-06-01 16:16:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp94 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 63 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp93 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 3/6 constraints. Problems are: Problem set: 12 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 12 solved, 58 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp95 is UNSAT
At refinement iteration 3 (OVERLAPS) 3/47 variables, 3/9 constraints. Problems are: Problem set: 39 solved, 31 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 52 solved, 18 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp91 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/48 variables, 1/13 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/86 variables, 48/61 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 1/62 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/62 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/86 variables, 0/62 constraints. Problems are: Problem set: 69 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 62 constraints, problems are : Problem set: 69 solved, 1 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 69 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 2/2 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/36 variables, 3/5 constraints. Problems are: Problem set: 69 solved, 1 unsolved
[2024-06-01 16:16:21] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/6 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/42 variables, 3/9 constraints. Problems are: Problem set: 69 solved, 1 unsolved
[2024-06-01 16:16:21] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 1/10 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 1/11 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/47 variables, 4/15 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 38/85 variables, 47/62 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 1/63 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/63 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/86 variables, 1/64 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/86 variables, 1/65 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/86 variables, 0/65 constraints. Problems are: Problem set: 69 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/86 variables, 0/65 constraints. Problems are: Problem set: 69 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 65 constraints, problems are : Problem set: 69 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/70 constraints, Known Traps: 2/2 constraints]
After SMT, in 700ms problems are : Problem set: 69 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
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 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 25 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
Running 25 sub problems to find dead transitions.
// Phase 1: matrix 28 rows 34 cols
[2024-06-01 16:16:21] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 16:16:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 1/34 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 28/62 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 47 constraints, problems are : Problem set: 0 solved, 25 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 16:16:21] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 28/62 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 16:16:22] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 74 constraints, problems are : Problem set: 0 solved, 25 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 2/2 constraints]
After SMT, in 808ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 809ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 847 ms. Remains : 34/48 places, 28/38 transitions.
RANDOM walk for 40009 steps (2948 resets) in 399 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1207 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 14 ms. (steps per millisecond=99 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 3 ms. (steps per millisecond=464 ) properties seen :0
Successfully simplified 70 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-COL-S10J20-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:16:22] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-06-01 16:16:22] [INFO ] Flatten gal took : 36 ms
FORMULA PolyORBNT-COL-S10J20-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:16:22] [INFO ] Flatten gal took : 7 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 16:16:22] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 205 ms.
[2024-06-01 16:16:22] [INFO ] Unfolded 8 HLPN properties in 4 ms.
Deduced a syphon composed of 20 places in 30 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 417 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1650
Applied a total of 10 rules in 63 ms. Remains 464 /474 variables (removed 10) and now considering 1650/1650 (removed 0) transitions.
Running 1639 sub problems to find dead transitions.
[2024-06-01 16:16:23] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 464 cols
[2024-06-01 16:16:23] [INFO ] Computed 62 invariants in 100 ms
[2024-06-01 16:16:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1146 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 10/463 variables, 10/61 constraints. Problems are: Problem set: 558 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/2105 variables, and 61 constraints, problems are : Problem set: 558 solved, 1081 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/464 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1639/639 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 558 solved, 1081 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 558 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 558 solved, 1081 unsolved
[2024-06-01 16:17:02] [INFO ] Deduced a trap composed of 12 places in 471 ms of which 3 ms to minimize.
[2024-06-01 16:17:03] [INFO ] Deduced a trap composed of 20 places in 444 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 2/53 constraints. Problems are: Problem set: 558 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/2105 variables, and 53 constraints, problems are : Problem set: 558 solved, 1081 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 46/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/464 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 442/639 constraints, Known Traps: 2/2 constraints]
After SMT, in 56469ms problems are : Problem set: 558 solved, 1081 unsolved
Search for dead transitions found 558 dead transitions in 56498ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 558 transitions.
[2024-06-01 16:17:19] [INFO ] Flow matrix only has 1083 transitions (discarded 9 similar events)
// Phase 1: matrix 1083 rows 464 cols
[2024-06-01 16:17:19] [INFO ] Computed 62 invariants in 32 ms
[2024-06-01 16:17:19] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 16:17:19] [INFO ] Flow matrix only has 1083 transitions (discarded 9 similar events)
[2024-06-01 16:17:19] [INFO ] Invariant cache hit.
[2024-06-01 16:17:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:17:20] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 464/474 places, 1092/1650 transitions.
Applied a total of 0 rules in 13 ms. Remains 464 /464 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57549 ms. Remains : 464/474 places, 1092/1650 transitions.
Support contains 417 out of 464 places after structural reductions.
[2024-06-01 16:17:20] [INFO ] Flatten gal took : 129 ms
[2024-06-01 16:17:20] [INFO ] Flatten gal took : 101 ms
[2024-06-01 16:17:21] [INFO ] Input system was already deterministic with 1092 transitions.
RANDOM walk for 40000 steps (2240 resets) in 2108 ms. (18 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4003 steps (41 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (40 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (39 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (36 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (41 resets) in 25 ms. (154 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (40 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (41 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (40 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (41 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (39 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (48 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 42/52 properties
BEST_FIRST walk for 4004 steps (40 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (41 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (40 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (40 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (48 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (41 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (40 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (40 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (40 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (41 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (40 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (48 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (40 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (40 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (48 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (40 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (40 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (40 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (40 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (40 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (41 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (41 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
[2024-06-01 16:17:21] [INFO ] Flow matrix only has 1083 transitions (discarded 9 similar events)
[2024-06-01 16:17:21] [INFO ] Invariant cache hit.
[2024-06-01 16:17:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 32/32 constraints. Problems are: Problem set: 7 solved, 35 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 2/34 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/34 constraints. Problems are: Problem set: 8 solved, 34 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 3 (OVERLAPS) 50/461 variables, 24/58 constraints. Problems are: Problem set: 32 solved, 10 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 3/61 constraints. Problems are: Problem set: 33 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/61 constraints. Problems are: Problem set: 33 solved, 9 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 6 (OVERLAPS) 2/463 variables, 1/62 constraints. Problems are: Problem set: 34 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/62 constraints. Problems are: Problem set: 34 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1546 variables, 463/525 constraints. Problems are: Problem set: 34 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1546 variables, 1/526 constraints. Problems are: Problem set: 34 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1546 variables, 0/526 constraints. Problems are: Problem set: 34 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/1547 variables, 1/527 constraints. Problems are: Problem set: 34 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1547 variables, 0/527 constraints. Problems are: Problem set: 34 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1547 variables, 0/527 constraints. Problems are: Problem set: 34 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1547/1547 variables, and 527 constraints, problems are : Problem set: 34 solved, 8 unsolved in 1506 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 464/464 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 34 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 34 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 203/453 variables, 55/55 constraints. Problems are: Problem set: 34 solved, 8 unsolved
[2024-06-01 16:17:24] [INFO ] Deduced a trap composed of 151 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 1/56 constraints. Problems are: Problem set: 34 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/56 constraints. Problems are: Problem set: 34 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 9/462 variables, 6/62 constraints. Problems are: Problem set: 34 solved, 8 unsolved
[2024-06-01 16:17:24] [INFO ] Deduced a trap composed of 219 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:17:24] [INFO ] Deduced a trap composed of 213 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:17:25] [INFO ] Deduced a trap composed of 211 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:17:25] [INFO ] Deduced a trap composed of 211 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:17:25] [INFO ] Deduced a trap composed of 229 places in 316 ms of which 3 ms to minimize.
[2024-06-01 16:17:26] [INFO ] Deduced a trap composed of 237 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:17:26] [INFO ] Deduced a trap composed of 217 places in 235 ms of which 2 ms to minimize.
[2024-06-01 16:17:26] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:17:26] [INFO ] Deduced a trap composed of 229 places in 228 ms of which 2 ms to minimize.
[2024-06-01 16:17:27] [INFO ] Deduced a trap composed of 229 places in 230 ms of which 2 ms to minimize.
[2024-06-01 16:17:27] [INFO ] Deduced a trap composed of 229 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:17:27] [INFO ] Deduced a trap composed of 225 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:17:27] [INFO ] Deduced a trap composed of 225 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:17:28] [INFO ] Deduced a trap composed of 229 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:17:28] [INFO ] Deduced a trap composed of 229 places in 285 ms of which 3 ms to minimize.
[2024-06-01 16:17:28] [INFO ] Deduced a trap composed of 233 places in 304 ms of which 3 ms to minimize.
SMT process timed out in 6809ms, After SMT, problems are : Problem set: 34 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 250 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1092/1092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 464 transition count 1069
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 441 transition count 1069
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 46 place count 441 transition count 1045
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 94 place count 417 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 416 transition count 1044
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 416 transition count 1044
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 415 transition count 1043
Applied a total of 98 rules in 133 ms. Remains 415 /464 variables (removed 49) and now considering 1043/1092 (removed 49) transitions.
Running 1032 sub problems to find dead transitions.
[2024-06-01 16:17:28] [INFO ] Flow matrix only has 1034 transitions (discarded 9 similar events)
// Phase 1: matrix 1034 rows 415 cols
[2024-06-01 16:17:28] [INFO ] Computed 62 invariants in 55 ms
[2024-06-01 16:17:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 3 (OVERLAPS) 9/413 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD772 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/415 variables, 2/62 constraints. Problems are: Problem set: 57 solved, 975 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1449 variables, and 62 constraints, problems are : Problem set: 57 solved, 975 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/415 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 975 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 46/46 constraints. Problems are: Problem set: 57 solved, 975 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 5/51 constraints. Problems are: Problem set: 57 solved, 975 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/51 constraints. Problems are: Problem set: 57 solved, 975 unsolved
At refinement iteration 3 (OVERLAPS) 9/413 variables, 9/60 constraints. Problems are: Problem set: 57 solved, 975 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/60 constraints. Problems are: Problem set: 57 solved, 975 unsolved
At refinement iteration 5 (OVERLAPS) 2/415 variables, 2/62 constraints. Problems are: Problem set: 57 solved, 975 unsolved
[2024-06-01 16:18:10] [INFO ] Deduced a trap composed of 175 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:18:11] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 7 ms to minimize.
[2024-06-01 16:18:11] [INFO ] Deduced a trap composed of 157 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:18:11] [INFO ] Deduced a trap composed of 163 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:18:11] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 3 ms to minimize.
[2024-06-01 16:18:11] [INFO ] Deduced a trap composed of 163 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:18:12] [INFO ] Deduced a trap composed of 165 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:18:12] [INFO ] Deduced a trap composed of 165 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:18:12] [INFO ] Deduced a trap composed of 165 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:18:12] [INFO ] Deduced a trap composed of 173 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:18:12] [INFO ] Deduced a trap composed of 167 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:18:13] [INFO ] Deduced a trap composed of 169 places in 225 ms of which 6 ms to minimize.
[2024-06-01 16:18:13] [INFO ] Deduced a trap composed of 173 places in 209 ms of which 2 ms to minimize.
[2024-06-01 16:18:13] [INFO ] Deduced a trap composed of 165 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:18:13] [INFO ] Deduced a trap composed of 169 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:18:14] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:18:14] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:18:14] [INFO ] Deduced a trap composed of 168 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:18:14] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 3 ms to minimize.
SMT process timed out in 46062ms, After SMT, problems are : Problem set: 57 solved, 975 unsolved
Search for dead transitions found 57 dead transitions in 46077ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 57 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 415/464 places, 986/1092 transitions.
Applied a total of 0 rules in 49 ms. Remains 415 /415 variables (removed 0) and now considering 986/986 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46266 ms. Remains : 415/464 places, 986/1092 transitions.
RANDOM walk for 40000 steps (2371 resets) in 920 ms. (43 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (381 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (418 resets) in 147 ms. (270 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40002 steps (419 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (484 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
[2024-06-01 16:18:15] [INFO ] Flow matrix only has 977 transitions (discarded 9 similar events)
// Phase 1: matrix 977 rows 415 cols
[2024-06-01 16:18:15] [INFO ] Computed 62 invariants in 12 ms
[2024-06-01 16:18:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 144/156 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 250/406 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/413 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/414 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 977/1391 variables, 414/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1391 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1391 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/1392 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1392 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1392 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1392/1392 variables, and 478 constraints, problems are : Problem set: 0 solved, 3 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 415/415 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 144/156 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 250/406 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 16:18:16] [INFO ] Deduced a trap composed of 173 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:18:16] [INFO ] Deduced a trap composed of 193 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:18:16] [INFO ] Deduced a trap composed of 181 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:18:17] [INFO ] Deduced a trap composed of 197 places in 196 ms of which 2 ms to minimize.
[2024-06-01 16:18:17] [INFO ] Deduced a trap composed of 161 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:18:17] [INFO ] Deduced a trap composed of 189 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:18:17] [INFO ] Deduced a trap composed of 173 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:18:18] [INFO ] Deduced a trap composed of 193 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:18:18] [INFO ] Deduced a trap composed of 181 places in 189 ms of which 3 ms to minimize.
[2024-06-01 16:18:18] [INFO ] Deduced a trap composed of 181 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:18:18] [INFO ] Deduced a trap composed of 189 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:18:18] [INFO ] Deduced a trap composed of 173 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:18:19] [INFO ] Deduced a trap composed of 177 places in 188 ms of which 2 ms to minimize.
[2024-06-01 16:18:19] [INFO ] Deduced a trap composed of 177 places in 190 ms of which 2 ms to minimize.
[2024-06-01 16:18:19] [INFO ] Deduced a trap composed of 173 places in 191 ms of which 12 ms to minimize.
[2024-06-01 16:18:19] [INFO ] Deduced a trap composed of 181 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:18:19] [INFO ] Deduced a trap composed of 177 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:18:20] [INFO ] Deduced a trap composed of 177 places in 240 ms of which 2 ms to minimize.
[2024-06-01 16:18:20] [INFO ] Deduced a trap composed of 165 places in 283 ms of which 2 ms to minimize.
[2024-06-01 16:18:20] [INFO ] Deduced a trap composed of 189 places in 174 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 16:18:20] [INFO ] Deduced a trap composed of 173 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:18:21] [INFO ] Deduced a trap composed of 177 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:18:21] [INFO ] Deduced a trap composed of 177 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:18:21] [INFO ] Deduced a trap composed of 185 places in 280 ms of which 2 ms to minimize.
[2024-06-01 16:18:22] [INFO ] Deduced a trap composed of 185 places in 251 ms of which 2 ms to minimize.
[2024-06-01 16:18:22] [INFO ] Deduced a trap composed of 173 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:18:22] [INFO ] Deduced a trap composed of 193 places in 245 ms of which 2 ms to minimize.
[2024-06-01 16:18:22] [INFO ] Deduced a trap composed of 185 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:18:23] [INFO ] Deduced a trap composed of 185 places in 298 ms of which 2 ms to minimize.
[2024-06-01 16:18:23] [INFO ] Deduced a trap composed of 177 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:18:23] [INFO ] Deduced a trap composed of 185 places in 227 ms of which 2 ms to minimize.
[2024-06-01 16:18:23] [INFO ] Deduced a trap composed of 177 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:18:24] [INFO ] Deduced a trap composed of 161 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:18:24] [INFO ] Deduced a trap composed of 185 places in 254 ms of which 2 ms to minimize.
[2024-06-01 16:18:24] [INFO ] Deduced a trap composed of 181 places in 396 ms of which 3 ms to minimize.
[2024-06-01 16:18:25] [INFO ] Deduced a trap composed of 189 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:18:25] [INFO ] Deduced a trap composed of 185 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:18:25] [INFO ] Deduced a trap composed of 181 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:18:26] [INFO ] Deduced a trap composed of 181 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:18:26] [INFO ] Deduced a trap composed of 177 places in 242 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 16:18:26] [INFO ] Deduced a trap composed of 181 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:18:26] [INFO ] Deduced a trap composed of 169 places in 285 ms of which 3 ms to minimize.
[2024-06-01 16:18:27] [INFO ] Deduced a trap composed of 181 places in 285 ms of which 2 ms to minimize.
[2024-06-01 16:18:27] [INFO ] Deduced a trap composed of 173 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:18:27] [INFO ] Deduced a trap composed of 181 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:18:28] [INFO ] Deduced a trap composed of 177 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:18:28] [INFO ] Deduced a trap composed of 177 places in 292 ms of which 16 ms to minimize.
[2024-06-01 16:18:28] [INFO ] Deduced a trap composed of 177 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:18:29] [INFO ] Deduced a trap composed of 177 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:18:29] [INFO ] Deduced a trap composed of 173 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:18:29] [INFO ] Deduced a trap composed of 193 places in 288 ms of which 3 ms to minimize.
[2024-06-01 16:18:29] [INFO ] Deduced a trap composed of 177 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:18:30] [INFO ] Deduced a trap composed of 169 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:18:30] [INFO ] Deduced a trap composed of 169 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:18:30] [INFO ] Deduced a trap composed of 185 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:18:30] [INFO ] Deduced a trap composed of 185 places in 246 ms of which 2 ms to minimize.
[2024-06-01 16:18:31] [INFO ] Deduced a trap composed of 189 places in 263 ms of which 2 ms to minimize.
[2024-06-01 16:18:31] [INFO ] Deduced a trap composed of 177 places in 288 ms of which 3 ms to minimize.
[2024-06-01 16:18:41] [INFO ] Deduced a trap composed of 176 places in 237 ms of which 2 ms to minimize.
[2024-06-01 16:18:41] [INFO ] Deduced a trap composed of 173 places in 234 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 173 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:18:47] [INFO ] Deduced a trap composed of 173 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:18:47] [INFO ] Deduced a trap composed of 176 places in 198 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 16:18:52] [INFO ] Deduced a trap composed of 167 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:18:57] [INFO ] Deduced a trap composed of 176 places in 289 ms of which 3 ms to minimize.
[2024-06-01 16:18:57] [INFO ] Deduced a trap composed of 185 places in 200 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1392 variables, and 124 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 54/55 constraints, Generalized P Invariants (flows): 3/7 constraints, State Equation: 0/415 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 67/67 constraints]
After SMT, in 45664ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 986/986 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 415 transition count 984
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 413 transition count 984
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 413 transition count 983
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 412 transition count 983
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 411 transition count 982
Applied a total of 8 rules in 161 ms. Remains 411 /415 variables (removed 4) and now considering 982/986 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 411/415 places, 982/986 transitions.
Successfully simplified 34 atomic propositions for a total of 8 simplifications.
[2024-06-01 16:19:01] [INFO ] Flatten gal took : 81 ms
[2024-06-01 16:19:01] [INFO ] Flatten gal took : 82 ms
[2024-06-01 16:19:01] [INFO ] Input system was already deterministic with 1092 transitions.
Support contains 279 out of 464 places (down from 283) after GAL structural reductions.
FORMULA PolyORBNT-COL-S10J20-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1092/1092 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 463 transition count 1091
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 1091
Applied a total of 2 rules in 54 ms. Remains 463 /464 variables (removed 1) and now considering 1091/1092 (removed 1) transitions.
Running 1080 sub problems to find dead transitions.
[2024-06-01 16:19:01] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
// Phase 1: matrix 1082 rows 463 cols
[2024-06-01 16:19:01] [INFO ] Computed 62 invariants in 36 ms
[2024-06-01 16:19:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1545 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:19:31] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 2 ms to minimize.
[2024-06-01 16:19:31] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
SMT process timed out in 47095ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 47112ms
Finished structural reductions in LTL mode , in 1 iterations and 47171 ms. Remains : 463/464 places, 1091/1092 transitions.
[2024-06-01 16:19:48] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:19:49] [INFO ] Flatten gal took : 58 ms
[2024-06-01 16:19:49] [INFO ] Input system was already deterministic with 1091 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1092/1092 transitions.
Applied a total of 0 rules in 6 ms. Remains 464 /464 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Running 1081 sub problems to find dead transitions.
[2024-06-01 16:19:49] [INFO ] Flow matrix only has 1083 transitions (discarded 9 similar events)
// Phase 1: matrix 1083 rows 464 cols
[2024-06-01 16:19:49] [INFO ] Computed 62 invariants in 26 ms
[2024-06-01 16:19:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 3 (OVERLAPS) 10/463 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1547 variables, and 61 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/464 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1081/1081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1081 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
[2024-06-01 16:20:17] [INFO ] Deduced a trap composed of 12 places in 361 ms of which 2 ms to minimize.
[2024-06-01 16:20:18] [INFO ] Deduced a trap composed of 20 places in 420 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/1547 variables, and 53 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 46/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/464 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1081 constraints, Known Traps: 2/2 constraints]
After SMT, in 46136ms problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 46147ms
Finished structural reductions in LTL mode , in 1 iterations and 46170 ms. Remains : 464/464 places, 1092/1092 transitions.
[2024-06-01 16:20:35] [INFO ] Flatten gal took : 115 ms
[2024-06-01 16:20:35] [INFO ] Flatten gal took : 116 ms
[2024-06-01 16:20:35] [INFO ] Input system was already deterministic with 1092 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1092/1092 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 463 transition count 1091
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 1091
Applied a total of 2 rules in 53 ms. Remains 463 /464 variables (removed 1) and now considering 1091/1092 (removed 1) transitions.
Running 1080 sub problems to find dead transitions.
[2024-06-01 16:20:35] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
// Phase 1: matrix 1082 rows 463 cols
[2024-06-01 16:20:35] [INFO ] Computed 62 invariants in 24 ms
[2024-06-01 16:20:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1545 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:21:05] [INFO ] Deduced a trap composed of 12 places in 389 ms of which 3 ms to minimize.
[2024-06-01 16:21:05] [INFO ] Deduced a trap composed of 20 places in 348 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 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 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 3)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/1545 variables, and 53 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 46/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 46834ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 46858ms
Finished structural reductions in LTL mode , in 1 iterations and 46913 ms. Remains : 463/464 places, 1091/1092 transitions.
[2024-06-01 16:21:22] [INFO ] Flatten gal took : 50 ms
[2024-06-01 16:21:22] [INFO ] Flatten gal took : 48 ms
[2024-06-01 16:21:22] [INFO ] Input system was already deterministic with 1091 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 1092/1092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1067
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 439 transition count 1066
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 438 transition count 1066
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 52 place count 438 transition count 1042
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 100 place count 414 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 413 transition count 1041
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 413 transition count 1041
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 411 transition count 1039
Applied a total of 106 rules in 71 ms. Remains 411 /464 variables (removed 53) and now considering 1039/1092 (removed 53) transitions.
Running 1028 sub problems to find dead transitions.
[2024-06-01 16:21:23] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
// Phase 1: matrix 1030 rows 411 cols
[2024-06-01 16:21:23] [INFO ] Computed 62 invariants in 12 ms
[2024-06-01 16:21:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
[2024-06-01 16:21:36] [INFO ] Deduced a trap composed of 117 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:21:36] [INFO ] Deduced a trap composed of 117 places in 219 ms of which 2 ms to minimize.
[2024-06-01 16:21:36] [INFO ] Deduced a trap composed of 132 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:21:37] [INFO ] Deduced a trap composed of 132 places in 186 ms of which 2 ms to minimize.
[2024-06-01 16:21:37] [INFO ] Deduced a trap composed of 127 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:21:37] [INFO ] Deduced a trap composed of 127 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:21:42] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:21:42] [INFO ] Deduced a trap composed of 171 places in 189 ms of which 3 ms to minimize.
[2024-06-01 16:21:43] [INFO ] Deduced a trap composed of 171 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:21:43] [INFO ] Deduced a trap composed of 175 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:21:43] [INFO ] Deduced a trap composed of 173 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:21:43] [INFO ] Deduced a trap composed of 171 places in 195 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
[2024-06-01 16:21:44] [INFO ] Deduced a trap composed of 117 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:21:44] [INFO ] Deduced a trap composed of 112 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:21:44] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:21:44] [INFO ] Deduced a trap composed of 112 places in 145 ms of which 3 ms to minimize.
[2024-06-01 16:21:44] [INFO ] Deduced a trap composed of 122 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:21:44] [INFO ] Deduced a trap composed of 112 places in 162 ms of which 2 ms to minimize.
[2024-06-01 16:21:45] [INFO ] Deduced a trap composed of 117 places in 171 ms of which 2 ms to minimize.
[2024-06-01 16:21:45] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 2 ms to minimize.
[2024-06-01 16:21:45] [INFO ] Deduced a trap composed of 122 places in 214 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1441 variables, and 73 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1028/1028 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1028 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 21/73 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
[2024-06-01 16:21:51] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 1 ms to minimize.
[2024-06-01 16:21:52] [INFO ] Deduced a trap composed of 131 places in 254 ms of which 2 ms to minimize.
[2024-06-01 16:21:52] [INFO ] Deduced a trap composed of 117 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:21:52] [INFO ] Deduced a trap composed of 121 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:21:52] [INFO ] Deduced a trap composed of 122 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:21:53] [INFO ] Deduced a trap composed of 131 places in 287 ms of which 2 ms to minimize.
[2024-06-01 16:21:53] [INFO ] Deduced a trap composed of 112 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:21:53] [INFO ] Deduced a trap composed of 112 places in 297 ms of which 3 ms to minimize.
[2024-06-01 16:21:54] [INFO ] Deduced a trap composed of 136 places in 303 ms of which 3 ms to minimize.
[2024-06-01 16:21:54] [INFO ] Deduced a trap composed of 122 places in 310 ms of which 3 ms to minimize.
[2024-06-01 16:21:54] [INFO ] Deduced a trap composed of 122 places in 353 ms of which 3 ms to minimize.
[2024-06-01 16:21:55] [INFO ] Deduced a trap composed of 112 places in 455 ms of which 3 ms to minimize.
[2024-06-01 16:21:55] [INFO ] Deduced a trap composed of 126 places in 338 ms of which 3 ms to minimize.
[2024-06-01 16:21:56] [INFO ] Deduced a trap composed of 112 places in 294 ms of which 3 ms to minimize.
[2024-06-01 16:21:56] [INFO ] Deduced a trap composed of 141 places in 322 ms of which 3 ms to minimize.
[2024-06-01 16:21:56] [INFO ] Deduced a trap composed of 112 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:21:57] [INFO ] Deduced a trap composed of 151 places in 421 ms of which 2 ms to minimize.
[2024-06-01 16:21:57] [INFO ] Deduced a trap composed of 136 places in 303 ms of which 2 ms to minimize.
[2024-06-01 16:21:58] [INFO ] Deduced a trap composed of 136 places in 435 ms of which 3 ms to minimize.
[2024-06-01 16:21:58] [INFO ] Deduced a trap composed of 122 places in 415 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
[2024-06-01 16:21:59] [INFO ] Deduced a trap composed of 127 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:21:59] [INFO ] Deduced a trap composed of 107 places in 261 ms of which 5 ms to minimize.
[2024-06-01 16:21:59] [INFO ] Deduced a trap composed of 122 places in 249 ms of which 2 ms to minimize.
[2024-06-01 16:22:00] [INFO ] Deduced a trap composed of 122 places in 370 ms of which 3 ms to minimize.
[2024-06-01 16:22:01] [INFO ] Deduced a trap composed of 117 places in 485 ms of which 4 ms to minimize.
[2024-06-01 16:22:01] [INFO ] Deduced a trap composed of 122 places in 326 ms of which 3 ms to minimize.
[2024-06-01 16:22:02] [INFO ] Deduced a trap composed of 141 places in 310 ms of which 3 ms to minimize.
[2024-06-01 16:22:02] [INFO ] Deduced a trap composed of 146 places in 364 ms of which 3 ms to minimize.
[2024-06-01 16:22:02] [INFO ] Deduced a trap composed of 132 places in 329 ms of which 3 ms to minimize.
[2024-06-01 16:22:03] [INFO ] Deduced a trap composed of 112 places in 328 ms of which 3 ms to minimize.
[2024-06-01 16:22:03] [INFO ] Deduced a trap composed of 147 places in 314 ms of which 3 ms to minimize.
[2024-06-01 16:22:04] [INFO ] Deduced a trap composed of 126 places in 289 ms of which 3 ms to minimize.
[2024-06-01 16:22:04] [INFO ] Deduced a trap composed of 136 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:22:04] [INFO ] Deduced a trap composed of 141 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:22:05] [INFO ] Deduced a trap composed of 116 places in 318 ms of which 3 ms to minimize.
[2024-06-01 16:22:05] [INFO ] Deduced a trap composed of 137 places in 310 ms of which 3 ms to minimize.
[2024-06-01 16:22:05] [INFO ] Deduced a trap composed of 146 places in 343 ms of which 3 ms to minimize.
[2024-06-01 16:22:06] [INFO ] Deduced a trap composed of 131 places in 329 ms of which 3 ms to minimize.
[2024-06-01 16:22:06] [INFO ] Deduced a trap composed of 136 places in 358 ms of which 3 ms to minimize.
[2024-06-01 16:22:07] [INFO ] Deduced a trap composed of 141 places in 324 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1441 variables, and 113 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1028 constraints, Known Traps: 61/61 constraints]
After SMT, in 46565ms problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 46579ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46654 ms. Remains : 411/464 places, 1039/1092 transitions.
[2024-06-01 16:22:09] [INFO ] Flatten gal took : 93 ms
[2024-06-01 16:22:09] [INFO ] Flatten gal took : 111 ms
[2024-06-01 16:22:10] [INFO ] Input system was already deterministic with 1039 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1092/1092 transitions.
Applied a total of 0 rules in 31 ms. Remains 464 /464 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Running 1081 sub problems to find dead transitions.
[2024-06-01 16:22:10] [INFO ] Flow matrix only has 1083 transitions (discarded 9 similar events)
// Phase 1: matrix 1083 rows 464 cols
[2024-06-01 16:22:10] [INFO ] Computed 62 invariants in 26 ms
[2024-06-01 16:22:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 10/463 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1547 variables, and 61 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/464 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1081/1081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1081 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
[2024-06-01 16:22:38] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 2 ms to minimize.
[2024-06-01 16:22:38] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 4 (OVERLAPS) 10/463 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/1547 variables, and 63 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/464 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1081 constraints, Known Traps: 2/2 constraints]
After SMT, in 46423ms problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 46447ms
Finished structural reductions in LTL mode , in 1 iterations and 46480 ms. Remains : 464/464 places, 1092/1092 transitions.
[2024-06-01 16:22:56] [INFO ] Flatten gal took : 82 ms
[2024-06-01 16:22:56] [INFO ] Flatten gal took : 87 ms
[2024-06-01 16:22:56] [INFO ] Input system was already deterministic with 1092 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 1092/1092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 1091
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 463 transition count 1089
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 461 transition count 1089
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 6 place count 461 transition count 1065
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 54 place count 437 transition count 1065
Applied a total of 54 rules in 61 ms. Remains 437 /464 variables (removed 27) and now considering 1065/1092 (removed 27) transitions.
Running 1054 sub problems to find dead transitions.
[2024-06-01 16:22:57] [INFO ] Flow matrix only has 1056 transitions (discarded 9 similar events)
// Phase 1: matrix 1056 rows 437 cols
[2024-06-01 16:22:57] [INFO ] Computed 62 invariants in 10 ms
[2024-06-01 16:22:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-06-01 16:23:16] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:23:16] [INFO ] Deduced a trap composed of 138 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:23:16] [INFO ] Deduced a trap composed of 143 places in 175 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-06-01 16:23:22] [INFO ] Deduced a trap composed of 194 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:23:23] [INFO ] Deduced a trap composed of 148 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:23:23] [INFO ] Deduced a trap composed of 143 places in 262 ms of which 2 ms to minimize.
[2024-06-01 16:23:23] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:23:23] [INFO ] Deduced a trap composed of 158 places in 264 ms of which 2 ms to minimize.
[2024-06-01 16:23:24] [INFO ] Deduced a trap composed of 153 places in 208 ms of which 3 ms to minimize.
SMT process timed out in 27075ms, After SMT, problems are : Problem set: 0 solved, 1054 unsolved
Search for dead transitions found 0 dead transitions in 27090ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 27155 ms. Remains : 437/464 places, 1065/1092 transitions.
[2024-06-01 16:23:24] [INFO ] Flatten gal took : 49 ms
[2024-06-01 16:23:24] [INFO ] Flatten gal took : 49 ms
[2024-06-01 16:23:24] [INFO ] Input system was already deterministic with 1065 transitions.
[2024-06-01 16:23:24] [INFO ] Flatten gal took : 50 ms
[2024-06-01 16:23:24] [INFO ] Flatten gal took : 51 ms
[2024-06-01 16:23:24] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 16:23:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 464 places, 1092 transitions and 7189 arcs took 22 ms.
Total runtime 425701 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLCardinality-2024-01
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLCardinality-2024-07
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBNT-COL-S10J20-CTLCardinality-2024-14

BK_STOP 1717259004930

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBNT-COL-S10J20-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1190/ctl_0_
ctl formula name PolyORBNT-COL-S10J20-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1190/ctl_1_
ctl formula name PolyORBNT-COL-S10J20-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1190/ctl_2_
ctl formula name PolyORBNT-COL-S10J20-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1190/ctl_3_
ctl formula name PolyORBNT-COL-S10J20-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1190/ctl_4_
ctl formula name PolyORBNT-COL-S10J20-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1190/ctl_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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