Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 11K Apr 11 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716848193160

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:16:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 22:16:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:16:34] [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-05-27 22:16:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:16:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 924 ms
[2024-05-27 22:16:35] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 51 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
[2024-05-27 22:16:35] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2024-05-27 22:16:35] [INFO ] Skeletonized 15 HLPN properties in 2 ms. Removed 1 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 47 to 43
RANDOM walk for 40000 steps (18 resets) in 1680 ms. (23 steps per ms) remains 9/43 properties
BEST_FIRST walk for 40000 steps (8 resets) in 360 ms. (110 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (12 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 307 ms. (129 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (11 resets) in 301 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (12 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (13 resets) in 371 ms. (107 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (13 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (12 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
[2024-05-27 22:16:37] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:16:37] [INFO ] Computed 26 invariants in 6 ms
[2024-05-27 22:16:37] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/59 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/61 variables, 2/11 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 6 (OVERLAPS) 18/79 variables, 14/25 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 6 solved, 3 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 40/52 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/57 variables, 4/10 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/11 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 22/79 variables, 14/25 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-27 22:16:38] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 8 ms to minimize.
[2024-05-27 22:16:38] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:16:38] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 3/28 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 64/143 variables, 79/107 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 8/115 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 2/117 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/117 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/145 variables, 2/119 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 1/120 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 1/121 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 0/121 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/145 variables, 0/121 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 121 constraints, problems are : Problem set: 6 solved, 3 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 1075ms problems are : Problem set: 6 solved, 3 unsolved
Parikh walk visited 0 properties in 1078 ms.
Support contains 12 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 60
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 75 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 73 transition count 58
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 15 place count 73 transition count 54
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 66 transition count 51
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 66 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 65 transition count 50
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 65 transition count 50
Applied a total of 32 rules in 82 ms. Remains 65 /81 variables (removed 16) and now considering 50/65 (removed 15) transitions.
Running 49 sub problems to find dead transitions.
[2024-05-27 22:16:39] [INFO ] Flow matrix only has 49 transitions (discarded 1 similar events)
// Phase 1: matrix 49 rows 65 cols
[2024-05-27 22:16:39] [INFO ] Computed 25 invariants in 2 ms
[2024-05-27 22:16:39] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-27 22:16:40] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:16:40] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:16:40] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
[2024-05-27 22:16:40] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-27 22:16:40] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-27 22:16:40] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 47 unsolved
[2024-05-27 22:16:40] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-27 22:16:40] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/33 constraints. Problems are: Problem set: 2 solved, 47 unsolved
[2024-05-27 22:16:41] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-27 22:16:41] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 2/35 constraints. Problems are: Problem set: 2 solved, 47 unsolved
[2024-05-27 22:16:42] [INFO ] Deduced a trap composed of 15 places in 423 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 1/36 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 49/114 variables, 65/101 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 8/109 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 0/109 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/114 variables, 0/109 constraints. Problems are: Problem set: 2 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 109 constraints, problems are : Problem set: 2 solved, 47 unsolved in 5120 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 65/65 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 2 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/31 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 4/36 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 49/114 variables, 65/101 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 8/109 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 47/156 constraints. Problems are: Problem set: 2 solved, 47 unsolved
[2024-05-27 22:16:45] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 1/157 constraints. Problems are: Problem set: 2 solved, 47 unsolved
[2024-05-27 22:16:45] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 1/158 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 0/114 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 158 constraints, problems are : Problem set: 2 solved, 47 unsolved in 1933 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 65/65 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 47/49 constraints, Known Traps: 13/13 constraints]
After SMT, in 7099ms problems are : Problem set: 2 solved, 47 unsolved
Search for dead transitions found 2 dead transitions in 7102ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/81 places, 48/65 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 46
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 63 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 63 /65 variables (removed 2) and now considering 44/48 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7204 ms. Remains : 63/81 places, 44/65 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
RANDOM walk for 40003 steps (41 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7656 steps, run visited all 1 properties in 35 ms. (steps per millisecond=218 )
Probabilistic random walk after 7656 steps, saw 3967 distinct states, run finished after 43 ms. (steps per millisecond=178 ) properties seen :1
Successfully simplified 8 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S02J06T10-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:16:47] [INFO ] Flatten gal took : 34 ms
[2024-05-27 22:16:47] [INFO ] Flatten gal took : 11 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:16:47] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 49 ms.
[2024-05-27 22:16:47] [INFO ] Unfolded 15 HLPN properties in 1 ms.
[2024-05-27 22:16:47] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-27 22:16:47] [INFO ] Reduced 110 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 705 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Applied a total of 0 rules in 19 ms. Remains 844 /844 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2024-05-27 22:16:47] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-05-27 22:16:47] [INFO ] Computed 58 invariants in 71 ms
[2024-05-27 22:16:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-27 22:17:09] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-05-27 22:17:09] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
[2024-05-27 22:17:09] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 12 ms to minimize.
[2024-05-27 22:17:09] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-27 22:17:09] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:17:09] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:17:09] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:17:09] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 0 ms to minimize.
[2024-05-27 22:17:10] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/2476 variables, and 63 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/44 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-27 22:17:12] [INFO ] Deduced a trap composed of 208 places in 364 ms of which 5 ms to minimize.
[2024-05-27 22:17:13] [INFO ] Deduced a trap composed of 227 places in 410 ms of which 4 ms to minimize.
[2024-05-27 22:17:13] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 3 ms to minimize.
[2024-05-27 22:17:14] [INFO ] Deduced a trap composed of 420 places in 367 ms of which 4 ms to minimize.
[2024-05-27 22:17:14] [INFO ] Deduced a trap composed of 501 places in 359 ms of which 4 ms to minimize.
[2024-05-27 22:17:15] [INFO ] Deduced a trap composed of 57 places in 225 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 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 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 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 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 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 0)
(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 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 9)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2476 variables, and 69 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/44 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 15/15 constraints]
After SMT, in 43024ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 43057ms
[2024-05-27 22:17:30] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-27 22:17:30] [INFO ] Invariant cache hit.
[2024-05-27 22:17:30] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-27 22:17:30] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-27 22:17:30] [INFO ] Invariant cache hit.
[2024-05-27 22:17:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:17:38] [INFO ] Implicit Places using invariants and state equation in 8400 ms returned []
Implicit Place search using SMT with State Equation took 8674 ms to find 0 implicit places.
Running 1650 sub problems to find dead transitions.
[2024-05-27 22:17:38] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-27 22:17:38] [INFO ] Invariant cache hit.
[2024-05-27 22:17:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-27 22:18:02] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:18:05] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:18:05] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:18:05] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 8 ms to minimize.
[2024-05-27 22:18:05] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:18:05] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:18:05] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:18:05] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:18:05] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 2 ms to minimize.
[2024-05-27 22:18:05] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 0 ms to minimize.
[2024-05-27 22:18:12] [INFO ] Deduced a trap composed of 446 places in 394 ms of which 5 ms to minimize.
SMT process timed out in 33468ms, After SMT, problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 33499ms
Finished structural reductions in LTL mode , in 1 iterations and 85267 ms. Remains : 844/844 places, 1652/1652 transitions.
Support contains 705 out of 844 places after structural reductions.
[2024-05-27 22:18:12] [INFO ] Flatten gal took : 227 ms
[2024-05-27 22:18:13] [INFO ] Flatten gal took : 192 ms
[2024-05-27 22:18:13] [INFO ] Input system was already deterministic with 1652 transitions.
Reduction of identical properties reduced properties to check from 53 to 51
RANDOM walk for 40000 steps (11 resets) in 1849 ms. (21 steps per ms) remains 10/51 properties
BEST_FIRST walk for 40003 steps (9 resets) in 856 ms. (46 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 571 ms. (69 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (9 resets) in 503 ms. (79 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 493 ms. (80 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 466 ms. (85 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 665 ms. (60 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 743 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (9 resets) in 469 ms. (85 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 694 ms. (57 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (11 resets) in 624 ms. (64 steps per ms) remains 10/10 properties
[2024-05-27 22:18:16] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-27 22:18:16] [INFO ] Invariant cache hit.
[2024-05-27 22:18:16] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 2 (OVERLAPS) 172/546 variables, 12/13 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 11/24 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 5 (OVERLAPS) 295/841 variables, 31/55 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/841 variables, 0/55 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/842 variables, 1/56 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 0/56 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/844 variables, 2/58 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/844 variables, 0/58 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1632/2476 variables, 844/902 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2476/2476 variables, and 1022 constraints, problems are : Problem set: 6 solved, 4 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 844/844 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 246/329 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 1/4 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 499/828 variables, 39/43 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-27 22:18:23] [INFO ] Deduced a trap composed of 451 places in 780 ms of which 9 ms to minimize.
[2024-05-27 22:18:23] [INFO ] Deduced a trap composed of 73 places in 365 ms of which 4 ms to minimize.
[2024-05-27 22:18:23] [INFO ] Deduced a trap composed of 73 places in 333 ms of which 4 ms to minimize.
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 74 places in 266 ms of which 3 ms to minimize.
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 73 places in 197 ms of which 3 ms to minimize.
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 74 places in 184 ms of which 5 ms to minimize.
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 5 ms to minimize.
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 3 ms to minimize.
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2024-05-27 22:18:24] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 10/53 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-27 22:18:25] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 1/54 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 0/54 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10/838 variables, 10/64 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/838 variables, 0/64 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 4/842 variables, 4/68 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/842 variables, 0/68 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2474/2476 variables, and 910 constraints, problems are : Problem set: 6 solved, 4 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 842/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 11/11 constraints]
After SMT, in 10597ms problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 83 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 842 transition count 1602
Reduce places removed 50 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 70 rules applied. Total rules applied 122 place count 792 transition count 1582
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 142 place count 772 transition count 1582
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 142 place count 772 transition count 1472
Deduced a syphon composed of 110 places in 4 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 362 place count 662 transition count 1472
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 442 place count 622 transition count 1432
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 452 place count 622 transition count 1422
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 462 place count 612 transition count 1422
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 472 place count 612 transition count 1422
Applied a total of 472 rules in 338 ms. Remains 612 /844 variables (removed 232) and now considering 1422/1652 (removed 230) transitions.
Running 1420 sub problems to find dead transitions.
[2024-05-27 22:18:27] [INFO ] Flow matrix only has 1402 transitions (discarded 20 similar events)
// Phase 1: matrix 1402 rows 612 cols
[2024-05-27 22:18:27] [INFO ] Computed 56 invariants in 59 ms
[2024-05-27 22:18:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
[2024-05-27 22:18:42] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
[2024-05-27 22:18:43] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:18:43] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:18:43] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 5 ms to minimize.
[2024-05-27 22:18:43] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:18:43] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-05-27 22:18:43] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:18:43] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:18:43] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:18:43] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-05-27 22:18:49] [INFO ] Deduced a trap composed of 408 places in 325 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 7.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/2014 variables, and 65 constraints, problems are : Problem set: 0 solved, 1420 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 40/41 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1420/1420 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
[2024-05-27 22:18:52] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 2 ms to minimize.
[2024-05-27 22:18:53] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-27 22:19:03] [INFO ] Deduced a trap composed of 226 places in 329 ms of which 4 ms to minimize.
[2024-05-27 22:19:04] [INFO ] Deduced a trap composed of 56 places in 347 ms of which 5 ms to minimize.
[2024-05-27 22:19:06] [INFO ] Deduced a trap composed of 245 places in 350 ms of which 5 ms to minimize.
[2024-05-27 22:19:07] [INFO ] Deduced a trap composed of 281 places in 272 ms of which 3 ms to minimize.
[2024-05-27 22:19:07] [INFO ] Deduced a trap composed of 245 places in 330 ms of which 4 ms to minimize.
[2024-05-27 22:19:07] [INFO ] Deduced a trap composed of 299 places in 302 ms of which 3 ms to minimize.
[2024-05-27 22:19:08] [INFO ] Deduced a trap composed of 264 places in 292 ms of which 4 ms to minimize.
[2024-05-27 22:19:08] [INFO ] Deduced a trap composed of 265 places in 251 ms of which 3 ms to minimize.
[2024-05-27 22:19:08] [INFO ] Deduced a trap composed of 264 places in 260 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/2014 variables, and 76 constraints, problems are : Problem set: 0 solved, 1420 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 40/41 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1420 constraints, Known Traps: 22/22 constraints]
After SMT, in 43446ms problems are : Problem set: 0 solved, 1420 unsolved
Search for dead transitions found 0 dead transitions in 43467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43810 ms. Remains : 612/844 places, 1422/1652 transitions.
RANDOM walk for 40000 steps (11 resets) in 851 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 266 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 208 ms. (191 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (9 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
[2024-05-27 22:19:11] [INFO ] Flow matrix only has 1402 transitions (discarded 20 similar events)
[2024-05-27 22:19:11] [INFO ] Invariant cache hit.
[2024-05-27 22:19:11] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 217/248 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 29/277 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 14/291 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 292/583 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:19:11] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 3 ms to minimize.
[2024-05-27 22:19:11] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2024-05-27 22:19:11] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
[2024-05-27 22:19:12] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 1 ms to minimize.
[2024-05-27 22:19:12] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-27 22:19:12] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:19:12] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
[2024-05-27 22:19:12] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 14/597 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:19:12] [INFO ] Deduced a trap composed of 280 places in 340 ms of which 4 ms to minimize.
[2024-05-27 22:19:12] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 0 ms to minimize.
[2024-05-27 22:19:13] [INFO ] Deduced a trap composed of 222 places in 314 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/597 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/597 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 13/610 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:19:13] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/610 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/610 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1402/2012 variables, 610/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2012 variables, 120/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2012 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/2014 variables, 2/799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2014 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2014 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/2014 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2014/2014 variables, and 800 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7108 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 612/612 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 217/248 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 29/277 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 14/291 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 292/583 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 14/597 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/597 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/597 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 13/610 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/610 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1402/2012 variables, 610/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2012 variables, 120/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2012 variables, 3/800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:19:23] [INFO ] Deduced a trap composed of 287 places in 387 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2012 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2012 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/2014 variables, 2/803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2014 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2014 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/2014 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2014/2014 variables, and 804 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17050 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 612/612 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints]
After SMT, in 24186ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 8576 ms.
Support contains 31 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1422/1422 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 90 place count 572 transition count 1372
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 100 place count 562 transition count 1372
Applied a total of 100 rules in 118 ms. Remains 562 /612 variables (removed 50) and now considering 1372/1422 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 562/612 places, 1372/1422 transitions.
RANDOM walk for 40000 steps (19 resets) in 735 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 155400 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 3
Probabilistic random walk after 155400 steps, saw 99649 distinct states, run finished after 3009 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-27 22:19:47] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
// Phase 1: matrix 1352 rows 562 cols
[2024-05-27 22:19:47] [INFO ] Computed 56 invariants in 31 ms
[2024-05-27 22:19:47] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 197/228 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 43/271 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 182/453 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/455 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 102/557 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:19:48] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 2 ms to minimize.
[2024-05-27 22:19:48] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 4 ms to minimize.
[2024-05-27 22:19:48] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-05-27 22:19:48] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2024-05-27 22:19:48] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2024-05-27 22:19:48] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2024-05-27 22:19:48] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:19:48] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:19:48] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/560 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1352/1912 variables, 560/624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1912 variables, 120/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1912 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1914 variables, 2/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1914 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:19:52] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1914 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1914 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1914 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1914/1914 variables, and 748 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5764 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 562/562 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 197/228 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 43/271 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 182/453 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/455 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 102/557 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/560 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1352/1912 variables, 560/625 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1912 variables, 120/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1912 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:19:57] [INFO ] Deduced a trap composed of 216 places in 332 ms of which 4 ms to minimize.
[2024-05-27 22:19:58] [INFO ] Deduced a trap composed of 201 places in 295 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1912 variables, 2/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1912 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/1914 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1914 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 22:20:02] [INFO ] Deduced a trap composed of 235 places in 288 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1914 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1914 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1914 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1914/1914 variables, and 754 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29748 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 562/562 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints]
After SMT, in 35584ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 7892 ms.
Support contains 31 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1372/1372 transitions.
Applied a total of 0 rules in 23 ms. Remains 562 /562 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 562/562 places, 1372/1372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1372/1372 transitions.
Applied a total of 0 rules in 23 ms. Remains 562 /562 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2024-05-27 22:20:31] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2024-05-27 22:20:31] [INFO ] Invariant cache hit.
[2024-05-27 22:20:31] [INFO ] Implicit Places using invariants in 462 ms returned [506, 507, 508, 509, 510, 511, 512, 513, 514, 515]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 476 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 552/562 places, 1372/1372 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 542 transition count 1362
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 542 transition count 1362
Applied a total of 20 rules in 71 ms. Remains 542 /552 variables (removed 10) and now considering 1362/1372 (removed 10) transitions.
[2024-05-27 22:20:31] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 542 cols
[2024-05-27 22:20:31] [INFO ] Computed 46 invariants in 26 ms
[2024-05-27 22:20:32] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-27 22:20:32] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-27 22:20:32] [INFO ] Invariant cache hit.
[2024-05-27 22:20:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:20:40] [INFO ] Implicit Places using invariants and state equation in 8681 ms returned []
Implicit Place search using SMT with State Equation took 9252 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 542/562 places, 1362/1372 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9823 ms. Remains : 542/562 places, 1362/1372 transitions.
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
[2024-05-27 22:20:41] [INFO ] Flatten gal took : 81 ms
[2024-05-27 22:20:41] [INFO ] Flatten gal took : 94 ms
[2024-05-27 22:20:41] [INFO ] Input system was already deterministic with 1652 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Applied a total of 22 rules in 35 ms. Remains 832 /844 variables (removed 12) and now considering 1642/1652 (removed 10) transitions.
Running 1640 sub problems to find dead transitions.
[2024-05-27 22:20:41] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 832 cols
[2024-05-27 22:20:41] [INFO ] Computed 56 invariants in 35 ms
[2024-05-27 22:20:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/830 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-27 22:21:02] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-05-27 22:21:02] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-05-27 22:21:02] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-05-27 22:21:02] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-27 22:21:02] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:21:02] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:21:02] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2024-05-27 22:21:02] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:21:02] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-27 22:21:03] [INFO ] Deduced a trap composed of 457 places in 384 ms of which 5 ms to minimize.
[2024-05-27 22:21:04] [INFO ] Deduced a trap composed of 227 places in 361 ms of which 5 ms to minimize.
[2024-05-27 22:21:04] [INFO ] Deduced a trap composed of 231 places in 284 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 830/2454 variables, and 66 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 39/40 constraints, State Equation: 0/832 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/830 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/830 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-27 22:21:07] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:21:07] [INFO ] Deduced a trap composed of 396 places in 332 ms of which 5 ms to minimize.
[2024-05-27 22:21:19] [INFO ] Deduced a trap composed of 53 places in 253 ms of which 3 ms to minimize.
[2024-05-27 22:21:20] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 830/2454 variables, and 70 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 39/40 constraints, State Equation: 0/832 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 16/16 constraints]
After SMT, in 43174ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 43195ms
Finished structural reductions in LTL mode , in 1 iterations and 43237 ms. Remains : 832/844 places, 1642/1652 transitions.
[2024-05-27 22:21:24] [INFO ] Flatten gal took : 88 ms
[2024-05-27 22:21:25] [INFO ] Flatten gal took : 121 ms
[2024-05-27 22:21:25] [INFO ] Input system was already deterministic with 1642 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 29 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:21:25] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-05-27 22:21:25] [INFO ] Computed 56 invariants in 35 ms
[2024-05-27 22:21:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:21:46] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 4 ms to minimize.
[2024-05-27 22:21:46] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-05-27 22:21:46] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:21:46] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:21:46] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 1 ms to minimize.
[2024-05-27 22:21:46] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 2 ms to minimize.
[2024-05-27 22:21:47] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 1 ms to minimize.
[2024-05-27 22:21:47] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:21:47] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:21:48] [INFO ] Deduced a trap composed of 433 places in 465 ms of which 6 ms to minimize.
SMT process timed out in 22855ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22875ms
Finished structural reductions in LTL mode , in 1 iterations and 22908 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-05-27 22:21:48] [INFO ] Flatten gal took : 68 ms
[2024-05-27 22:21:48] [INFO ] Flatten gal took : 65 ms
[2024-05-27 22:21:48] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Applied a total of 0 rules in 26 ms. Remains 844 /844 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2024-05-27 22:21:48] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-05-27 22:21:48] [INFO ] Computed 58 invariants in 44 ms
[2024-05-27 22:21:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-27 22:22:11] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 3 ms to minimize.
[2024-05-27 22:22:11] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-27 22:22:11] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-05-27 22:22:11] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-27 22:22:11] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:22:11] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:22:11] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:22:11] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 4 ms to minimize.
[2024-05-27 22:22:11] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/2476 variables, and 63 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/44 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-27 22:22:14] [INFO ] Deduced a trap composed of 208 places in 422 ms of which 6 ms to minimize.
[2024-05-27 22:22:15] [INFO ] Deduced a trap composed of 227 places in 408 ms of which 5 ms to minimize.
[2024-05-27 22:22:15] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:22:16] [INFO ] Deduced a trap composed of 420 places in 417 ms of which 6 ms to minimize.
[2024-05-27 22:22:16] [INFO ] Deduced a trap composed of 501 places in 387 ms of which 4 ms to minimize.
[2024-05-27 22:22:17] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2476 variables, and 69 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/44 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 15/15 constraints]
After SMT, in 43297ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 43345ms
Finished structural reductions in LTL mode , in 1 iterations and 43378 ms. Remains : 844/844 places, 1652/1652 transitions.
[2024-05-27 22:22:31] [INFO ] Flatten gal took : 51 ms
[2024-05-27 22:22:32] [INFO ] Flatten gal took : 59 ms
[2024-05-27 22:22:32] [INFO ] Input system was already deterministic with 1652 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 27 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:22:32] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-05-27 22:22:32] [INFO ] Computed 56 invariants in 36 ms
[2024-05-27 22:22:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:22:51] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 6 ms to minimize.
[2024-05-27 22:22:51] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 2 ms to minimize.
[2024-05-27 22:22:51] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:22:52] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:22:52] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:22:52] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:22:52] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 2 ms to minimize.
[2024-05-27 22:22:52] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 2 ms to minimize.
[2024-05-27 22:22:52] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:22:53] [INFO ] Deduced a trap composed of 433 places in 465 ms of which 6 ms to minimize.
[2024-05-27 22:22:53] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-27 22:22:54] [INFO ] Deduced a trap composed of 549 places in 373 ms of which 5 ms to minimize.
[2024-05-27 22:22:54] [INFO ] Deduced a trap composed of 223 places in 383 ms of which 5 ms to minimize.
SMT process timed out in 22574ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22593ms
Finished structural reductions in LTL mode , in 1 iterations and 22625 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-05-27 22:22:54] [INFO ] Flatten gal took : 48 ms
[2024-05-27 22:22:54] [INFO ] Flatten gal took : 53 ms
[2024-05-27 22:22:55] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Applied a total of 2 rules in 12 ms. Remains 842 /844 variables (removed 2) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2024-05-27 22:22:55] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 842 cols
[2024-05-27 22:22:55] [INFO ] Computed 56 invariants in 24 ms
[2024-05-27 22:22:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-27 22:23:17] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 7.0)
(s1 3.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 9.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 (/ 2.0 3.0))
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 (/ 2.0 3.0))
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/2474 variables, and 55 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/842 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-27 22:23:19] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-27 22:23:19] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2024-05-27 22:23:19] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 1 ms to minimize.
[2024-05-27 22:23:19] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:23:19] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:23:19] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:23:20] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:23:20] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:23:20] [INFO ] Deduced a trap composed of 221 places in 304 ms of which 5 ms to minimize.
[2024-05-27 22:23:21] [INFO ] Deduced a trap composed of 223 places in 311 ms of which 5 ms to minimize.
[2024-05-27 22:23:22] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:23:22] [INFO ] Deduced a trap composed of 457 places in 372 ms of which 5 ms to minimize.
[2024-05-27 22:23:23] [INFO ] Deduced a trap composed of 468 places in 361 ms of which 4 ms to minimize.
[2024-05-27 22:23:23] [INFO ] Deduced a trap composed of 425 places in 369 ms of which 5 ms to minimize.
[2024-05-27 22:23:24] [INFO ] Deduced a trap composed of 480 places in 337 ms of which 5 ms to minimize.
[2024-05-27 22:23:24] [INFO ] Deduced a trap composed of 456 places in 391 ms of which 5 ms to minimize.
[2024-05-27 22:23:24] [INFO ] Deduced a trap composed of 464 places in 410 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2474 variables, and 72 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/842 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 18/18 constraints]
After SMT, in 42802ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 42820ms
Finished structural reductions in LTL mode , in 1 iterations and 42836 ms. Remains : 842/844 places, 1652/1652 transitions.
[2024-05-27 22:23:37] [INFO ] Flatten gal took : 64 ms
[2024-05-27 22:23:38] [INFO ] Flatten gal took : 71 ms
[2024-05-27 22:23:38] [INFO ] Input system was already deterministic with 1652 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 34 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:23:38] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-05-27 22:23:38] [INFO ] Computed 56 invariants in 44 ms
[2024-05-27 22:23:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:23:58] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2024-05-27 22:23:58] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-27 22:23:59] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:23:59] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 4 ms to minimize.
[2024-05-27 22:23:59] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 0 ms to minimize.
[2024-05-27 22:23:59] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:23:59] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:23:59] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:23:59] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:24:00] [INFO ] Deduced a trap composed of 433 places in 414 ms of which 7 ms to minimize.
[2024-05-27 22:24:00] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:24:00] [INFO ] Deduced a trap composed of 549 places in 386 ms of which 5 ms to minimize.
[2024-05-27 22:24:01] [INFO ] Deduced a trap composed of 223 places in 305 ms of which 5 ms to minimize.
SMT process timed out in 22993ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23012ms
Finished structural reductions in LTL mode , in 1 iterations and 23050 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-05-27 22:24:01] [INFO ] Flatten gal took : 47 ms
[2024-05-27 22:24:01] [INFO ] Flatten gal took : 49 ms
[2024-05-27 22:24:01] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 842 transition count 1602
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 792 transition count 1592
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 782 transition count 1592
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 120 place count 782 transition count 1492
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 320 place count 682 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 330 place count 672 transition count 1482
Iterating global reduction 3 with 10 rules applied. Total rules applied 340 place count 672 transition count 1482
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 440 place count 622 transition count 1432
Applied a total of 440 rules in 82 ms. Remains 622 /844 variables (removed 222) and now considering 1432/1652 (removed 220) transitions.
Running 1430 sub problems to find dead transitions.
[2024-05-27 22:24:01] [INFO ] Flow matrix only has 1412 transitions (discarded 20 similar events)
// Phase 1: matrix 1412 rows 622 cols
[2024-05-27 22:24:01] [INFO ] Computed 56 invariants in 18 ms
[2024-05-27 22:24:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
[2024-05-27 22:24:17] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-05-27 22:24:17] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 0 ms to minimize.
[2024-05-27 22:24:17] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:24:17] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:24:17] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 0 ms to minimize.
[2024-05-27 22:24:17] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:24:17] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:24:18] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:24:18] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:24:18] [INFO ] Deduced a trap composed of 240 places in 305 ms of which 3 ms to minimize.
[2024-05-27 22:24:19] [INFO ] Deduced a trap composed of 240 places in 309 ms of which 4 ms to minimize.
[2024-05-27 22:24:19] [INFO ] Deduced a trap composed of 247 places in 392 ms of which 5 ms to minimize.
[2024-05-27 22:24:20] [INFO ] Deduced a trap composed of 235 places in 311 ms of which 4 ms to minimize.
[2024-05-27 22:24:20] [INFO ] Deduced a trap composed of 261 places in 395 ms of which 5 ms to minimize.
[2024-05-27 22:24:20] [INFO ] Deduced a trap composed of 242 places in 347 ms of which 4 ms to minimize.
[2024-05-27 22:24:21] [INFO ] Deduced a trap composed of 242 places in 351 ms of which 4 ms to minimize.
[2024-05-27 22:24:21] [INFO ] Deduced a trap composed of 279 places in 356 ms of which 4 ms to minimize.
[2024-05-27 22:24:23] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 7.0)
(s1 3.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 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2034 variables, and 72 constraints, problems are : Problem set: 0 solved, 1430 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 40/41 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1430/1430 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
[2024-05-27 22:24:35] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2034 variables, and 73 constraints, problems are : Problem set: 0 solved, 1430 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 40/41 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1430 constraints, Known Traps: 19/19 constraints]
After SMT, in 42806ms problems are : Problem set: 0 solved, 1430 unsolved
Search for dead transitions found 0 dead transitions in 42820ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42906 ms. Remains : 622/844 places, 1432/1652 transitions.
[2024-05-27 22:24:44] [INFO ] Flatten gal took : 39 ms
[2024-05-27 22:24:44] [INFO ] Flatten gal took : 43 ms
[2024-05-27 22:24:44] [INFO ] Input system was already deterministic with 1432 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 35 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:24:44] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-05-27 22:24:44] [INFO ] Computed 56 invariants in 41 ms
[2024-05-27 22:24:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:25:06] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 3 ms to minimize.
[2024-05-27 22:25:06] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-27 22:25:06] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:25:06] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:25:06] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:25:06] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:25:07] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:25:07] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:25:07] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:25:07] [INFO ] Deduced a trap composed of 433 places in 411 ms of which 6 ms to minimize.
SMT process timed out in 23412ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23432ms
Finished structural reductions in LTL mode , in 1 iterations and 23472 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-05-27 22:25:08] [INFO ] Flatten gal took : 48 ms
[2024-05-27 22:25:08] [INFO ] Flatten gal took : 49 ms
[2024-05-27 22:25:08] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 842 transition count 1582
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 150 place count 772 transition count 1572
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 160 place count 762 transition count 1572
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 160 place count 762 transition count 1542
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 220 place count 732 transition count 1542
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 14 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 320 place count 682 transition count 1492
Applied a total of 320 rules in 165 ms. Remains 682 /844 variables (removed 162) and now considering 1492/1652 (removed 160) transitions.
Running 1490 sub problems to find dead transitions.
[2024-05-27 22:25:08] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
// Phase 1: matrix 1472 rows 682 cols
[2024-05-27 22:25:08] [INFO ] Computed 56 invariants in 30 ms
[2024-05-27 22:25:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1490 unsolved
[2024-05-27 22:25:27] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2024-05-27 22:25:27] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-05-27 22:25:27] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:25:27] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 3 ms to minimize.
[2024-05-27 22:25:28] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:25:28] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:25:28] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 0 ms to minimize.
[2024-05-27 22:25:28] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:25:28] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 0 ms to minimize.
[2024-05-27 22:25:28] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2154 variables, and 64 constraints, problems are : Problem set: 0 solved, 1490 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/682 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1490/1490 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 1490 unsolved
[2024-05-27 22:25:44] [INFO ] Deduced a trap composed of 456 places in 388 ms of which 5 ms to minimize.
[2024-05-27 22:25:44] [INFO ] Deduced a trap composed of 470 places in 367 ms of which 8 ms to minimize.
[2024-05-27 22:25:46] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2154 variables, and 67 constraints, problems are : Problem set: 0 solved, 1490 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/682 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1490 constraints, Known Traps: 13/13 constraints]
After SMT, in 43392ms problems are : Problem set: 0 solved, 1490 unsolved
Search for dead transitions found 0 dead transitions in 43447ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 43617 ms. Remains : 682/844 places, 1492/1652 transitions.
[2024-05-27 22:25:51] [INFO ] Flatten gal took : 46 ms
[2024-05-27 22:25:51] [INFO ] Flatten gal took : 51 ms
[2024-05-27 22:25:52] [INFO ] Input system was already deterministic with 1492 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 29 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:25:52] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-05-27 22:25:52] [INFO ] Computed 56 invariants in 44 ms
[2024-05-27 22:25:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:26:13] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-27 22:26:13] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 1 ms to minimize.
[2024-05-27 22:26:14] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:26:14] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 3 ms to minimize.
[2024-05-27 22:26:14] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:26:14] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:26:14] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:26:14] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:26:14] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:26:15] [INFO ] Deduced a trap composed of 433 places in 407 ms of which 4 ms to minimize.
SMT process timed out in 23294ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23321ms
Finished structural reductions in LTL mode , in 1 iterations and 23355 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-05-27 22:26:15] [INFO ] Flatten gal took : 51 ms
[2024-05-27 22:26:15] [INFO ] Flatten gal took : 82 ms
[2024-05-27 22:26:15] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 842 transition count 1582
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 150 place count 772 transition count 1572
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 160 place count 762 transition count 1572
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 160 place count 762 transition count 1472
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 360 place count 662 transition count 1472
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 460 place count 612 transition count 1422
Applied a total of 460 rules in 64 ms. Remains 612 /844 variables (removed 232) and now considering 1422/1652 (removed 230) transitions.
Running 1420 sub problems to find dead transitions.
[2024-05-27 22:26:15] [INFO ] Flow matrix only has 1402 transitions (discarded 20 similar events)
// Phase 1: matrix 1402 rows 612 cols
[2024-05-27 22:26:15] [INFO ] Computed 56 invariants in 25 ms
[2024-05-27 22:26:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
[2024-05-27 22:26:31] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:26:32] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 1 ms to minimize.
[2024-05-27 22:26:32] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:26:32] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 8 ms to minimize.
[2024-05-27 22:26:32] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 1 ms to minimize.
[2024-05-27 22:26:32] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2024-05-27 22:26:32] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-05-27 22:26:32] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:26:33] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:26:35] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/2014 variables, and 64 constraints, problems are : Problem set: 0 solved, 1420 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 42/44 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1420/1420 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
[2024-05-27 22:26:41] [INFO ] Deduced a trap composed of 276 places in 286 ms of which 5 ms to minimize.
[2024-05-27 22:26:41] [INFO ] Deduced a trap composed of 247 places in 294 ms of which 4 ms to minimize.
[2024-05-27 22:26:42] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 4 ms to minimize.
[2024-05-27 22:26:42] [INFO ] Deduced a trap composed of 216 places in 294 ms of which 3 ms to minimize.
[2024-05-27 22:26:48] [INFO ] Deduced a trap composed of 385 places in 291 ms of which 5 ms to minimize.
[2024-05-27 22:26:49] [INFO ] Deduced a trap composed of 37 places in 315 ms of which 3 ms to minimize.
[2024-05-27 22:26:49] [INFO ] Deduced a trap composed of 382 places in 258 ms of which 3 ms to minimize.
[2024-05-27 22:26:54] [INFO ] Deduced a trap composed of 216 places in 247 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/2014 variables, and 72 constraints, problems are : Problem set: 0 solved, 1420 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 42/44 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1420 constraints, Known Traps: 18/18 constraints]
After SMT, in 43047ms problems are : Problem set: 0 solved, 1420 unsolved
Search for dead transitions found 0 dead transitions in 43066ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 43134 ms. Remains : 612/844 places, 1422/1652 transitions.
[2024-05-27 22:26:58] [INFO ] Flatten gal took : 106 ms
[2024-05-27 22:26:59] [INFO ] Flatten gal took : 60 ms
[2024-05-27 22:26:59] [INFO ] Input system was already deterministic with 1422 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 35 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:26:59] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-05-27 22:26:59] [INFO ] Computed 56 invariants in 19 ms
[2024-05-27 22:26:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:27:19] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 1 ms to minimize.
[2024-05-27 22:27:19] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-05-27 22:27:19] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 0 ms to minimize.
[2024-05-27 22:27:19] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:27:20] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:27:20] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:27:20] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:27:20] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:27:20] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:27:21] [INFO ] Deduced a trap composed of 433 places in 367 ms of which 5 ms to minimize.
[2024-05-27 22:27:21] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:27:21] [INFO ] Deduced a trap composed of 549 places in 414 ms of which 6 ms to minimize.
[2024-05-27 22:27:22] [INFO ] Deduced a trap composed of 223 places in 413 ms of which 6 ms to minimize.
[2024-05-27 22:27:22] [INFO ] Deduced a trap composed of 228 places in 484 ms of which 5 ms to minimize.
SMT process timed out in 23743ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23761ms
Finished structural reductions in LTL mode , in 1 iterations and 23801 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-05-27 22:27:23] [INFO ] Flatten gal took : 46 ms
[2024-05-27 22:27:23] [INFO ] Flatten gal took : 49 ms
[2024-05-27 22:27:23] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 180 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 380 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 540 place count 572 transition count 1382
Applied a total of 540 rules in 55 ms. Remains 572 /844 variables (removed 272) and now considering 1382/1652 (removed 270) transitions.
Running 1380 sub problems to find dead transitions.
[2024-05-27 22:27:23] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
// Phase 1: matrix 1362 rows 572 cols
[2024-05-27 22:27:23] [INFO ] Computed 56 invariants in 23 ms
[2024-05-27 22:27:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:27:37] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2024-05-27 22:27:38] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2024-05-27 22:27:38] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2024-05-27 22:27:38] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
[2024-05-27 22:27:38] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:27:38] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:27:38] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:27:38] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:27:38] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:27:38] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 3 ms to minimize.
[2024-05-27 22:27:39] [INFO ] Deduced a trap composed of 217 places in 252 ms of which 3 ms to minimize.
[2024-05-27 22:27:40] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:27:44] [INFO ] Deduced a trap composed of 352 places in 254 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.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 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 4.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1934 variables, and 67 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 40/41 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-05-27 22:27:50] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-27 22:27:50] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-27 22:27:53] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1934 variables, and 70 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 40/41 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 16/16 constraints]
After SMT, in 42805ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 42819ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42878 ms. Remains : 572/844 places, 1382/1652 transitions.
[2024-05-27 22:28:06] [INFO ] Flatten gal took : 42 ms
[2024-05-27 22:28:06] [INFO ] Flatten gal took : 43 ms
[2024-05-27 22:28:06] [INFO ] Input system was already deterministic with 1382 transitions.
RANDOM walk for 182 steps (0 resets) in 7 ms. (22 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J06T10-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 34 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:28:06] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-05-27 22:28:06] [INFO ] Computed 56 invariants in 36 ms
[2024-05-27 22:28:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:28:26] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 2 ms to minimize.
[2024-05-27 22:28:27] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:28:27] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:28:27] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:28:27] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:28:27] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:28:27] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:28:27] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 0 ms to minimize.
[2024-05-27 22:28:27] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2024-05-27 22:28:28] [INFO ] Deduced a trap composed of 433 places in 310 ms of which 5 ms to minimize.
[2024-05-27 22:28:28] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:28:28] [INFO ] Deduced a trap composed of 549 places in 347 ms of which 4 ms to minimize.
[2024-05-27 22:28:29] [INFO ] Deduced a trap composed of 223 places in 290 ms of which 4 ms to minimize.
[2024-05-27 22:28:29] [INFO ] Deduced a trap composed of 228 places in 310 ms of which 5 ms to minimize.
SMT process timed out in 23049ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23066ms
Finished structural reductions in LTL mode , in 1 iterations and 23104 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-05-27 22:28:29] [INFO ] Flatten gal took : 50 ms
[2024-05-27 22:28:29] [INFO ] Flatten gal took : 59 ms
[2024-05-27 22:28:29] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 38 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:28:29] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:28:29] [INFO ] Invariant cache hit.
[2024-05-27 22:28:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:28:52] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
SMT process timed out in 22753ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22770ms
Finished structural reductions in LTL mode , in 1 iterations and 22812 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-05-27 22:28:52] [INFO ] Flatten gal took : 45 ms
[2024-05-27 22:28:52] [INFO ] Flatten gal took : 47 ms
[2024-05-27 22:28:52] [INFO ] Input system was already deterministic with 1632 transitions.
[2024-05-27 22:28:52] [INFO ] Flatten gal took : 64 ms
[2024-05-27 22:28:52] [INFO ] Flatten gal took : 66 ms
[2024-05-27 22:28:53] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 20 ms.
[2024-05-27 22:28:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 844 places, 1652 transitions and 7182 arcs took 21 ms.
Total runtime 738604 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J06T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 844
TRANSITIONS: 1652
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.038s, Sys 0.000s]


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


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

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

Process ID: 1698
MODEL NAME: /home/mcc/execution/419/model
844 places, 1652 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S02J06T10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445200114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;