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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 11 16:55 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 5.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:00 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-S02J06T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716847560230

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-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:06:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 22:06:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:06:02] [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:06:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:06:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 663 ms
[2024-05-27 22:06:02] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2024-05-27 22:06:02] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 22:06:02] [INFO ] Skeletonized 13 HLPN properties in 2 ms. Removed 3 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (24 resets) in 1290 ms. (30 steps per ms) remains 5/28 properties
BEST_FIRST walk for 40000 steps (15 resets) in 295 ms. (135 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (13 resets) in 190 ms. (209 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (41 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (34 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
[2024-05-27 22:06:03] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:06:03] [INFO ] Computed 26 invariants in 15 ms
[2024-05-27 22:06:03] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 39/53 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/55 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 5 (OVERLAPS) 24/79 variables, 15/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 3 solved, 1 unsolved in 264 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: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/23 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/46 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/49 variables, 2/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-27 22:06:04] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 117 constraints, problems are : Problem set: 3 solved, 1 unsolved in 181 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: 1/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 509ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 30 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
Running 43 sub problems to find dead transitions.
[2024-05-27 22:06:04] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2024-05-27 22:06:04] [INFO ] Computed 25 invariants in 2 ms
[2024-05-27 22:06:04] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-27 22:06:04] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
[2024-05-27 22:06:04] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-27 22:06:04] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-27 22:06:04] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-27 22:06:04] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-27 22:06:04] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-27 22:06:04] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-27 22:06:04] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 3/33 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 43/102 variables, 59/92 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 8/100 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 100 constraints, problems are : Problem set: 2 solved, 41 unsolved in 1147 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 2 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 6/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-27 22:06:05] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-27 22:06:05] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-27 22:06:05] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-27 22:06:05] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-27 22:06:05] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-27 22:06:05] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-27 22:06:05] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 6/37 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 1/59 variables, 1/38 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 2/40 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-27 22:06:06] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 1/41 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 43/102 variables, 59/100 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 41/149 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-27 22:06:06] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:06:06] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/151 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 15 (OVERLAPS) 0/102 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 151 constraints, problems are : Problem set: 2 solved, 41 unsolved in 1850 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 41/43 constraints, Known Traps: 18/18 constraints]
After SMT, in 3033ms problems are : Problem set: 2 solved, 41 unsolved
Search for dead transitions found 2 dead transitions in 3035ms
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 : 59/81 places, 42/65 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 194 edges and 57 vertex of which 1 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 39 output transitions
Drop transitions (Output transitions of discarded places.) removed 39 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 9 ms. Remains 1 /59 variables (removed 58) and now considering 0/42 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3087 ms. Remains : 1/81 places, 0/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
[2024-05-27 22:06:07] [INFO ] Flatten gal took : 34 ms
[2024-05-27 22:06:07] [INFO ] Flatten gal took : 10 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:06:07] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 31 ms.
[2024-05-27 22:06:07] [INFO ] Unfolded 16 HLPN properties in 1 ms.
[2024-05-27 22:06:07] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-27 22:06:07] [INFO ] Reduced 66 identical enabling conditions.
[2024-05-27 22:06:07] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 421 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Applied a total of 0 rules in 14 ms. Remains 536 /536 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-27 22:06:07] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-27 22:06:07] [INFO ] Computed 50 invariants in 42 ms
[2024-05-27 22:06:07] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-27 22:06:18] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 2 ms to minimize.
[2024-05-27 22:06:18] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-05-27 22:06:18] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 1 ms to minimize.
[2024-05-27 22:06:18] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:06:18] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2024-05-27 22:06:19] [INFO ] Deduced a trap composed of 280 places in 318 ms of which 4 ms to minimize.
[2024-05-27 22:06:19] [INFO ] Deduced a trap composed of 280 places in 361 ms of which 6 ms to minimize.
[2024-05-27 22:06:20] [INFO ] Deduced a trap composed of 146 places in 244 ms of which 4 ms to minimize.
[2024-05-27 22:06:20] [INFO ] Deduced a trap composed of 292 places in 294 ms of which 4 ms to minimize.
[2024-05-27 22:06:21] [INFO ] Deduced a trap composed of 298 places in 367 ms of which 4 ms to minimize.
[2024-05-27 22:06:21] [INFO ] Deduced a trap composed of 268 places in 274 ms of which 4 ms to minimize.
[2024-05-27 22:06:22] [INFO ] Deduced a trap composed of 261 places in 354 ms of which 4 ms to minimize.
[2024-05-27 22:06:22] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1492 variables, and 59 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-27 22:06:31] [INFO ] Deduced a trap composed of 277 places in 267 ms of which 4 ms to minimize.
[2024-05-27 22:06:31] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-05-27 22:06:37] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 8 ms to minimize.
[2024-05-27 22:06:37] [INFO ] Deduced a trap composed of 371 places in 243 ms of which 4 ms to minimize.
[2024-05-27 22:06:37] [INFO ] Deduced a trap composed of 361 places in 212 ms of which 4 ms to minimize.
[2024-05-27 22:06:37] [INFO ] Deduced a trap composed of 369 places in 215 ms of which 4 ms to minimize.
[2024-05-27 22:06:37] [INFO ] Deduced a trap composed of 362 places in 257 ms of which 4 ms to minimize.
[2024-05-27 22:06:38] [INFO ] Deduced a trap composed of 353 places in 234 ms of which 4 ms to minimize.
[2024-05-27 22:06:43] [INFO ] Deduced a trap composed of 260 places in 277 ms of which 5 ms to minimize.
[2024-05-27 22:06:43] [INFO ] Deduced a trap composed of 282 places in 241 ms of which 4 ms to minimize.
[2024-05-27 22:06:43] [INFO ] Deduced a trap composed of 263 places in 244 ms of which 4 ms to minimize.
[2024-05-27 22:06:44] [INFO ] Deduced a trap composed of 250 places in 247 ms of which 4 ms to minimize.
[2024-05-27 22:06:44] [INFO ] Deduced a trap composed of 289 places in 256 ms of which 4 ms to minimize.
[2024-05-27 22:06:44] [INFO ] Deduced a trap composed of 293 places in 262 ms of which 4 ms to minimize.
[2024-05-27 22:06:44] [INFO ] Deduced a trap composed of 264 places in 241 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1492 variables, and 74 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 28/28 constraints]
After SMT, in 41285ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41305ms
[2024-05-27 22:06:48] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-27 22:06:48] [INFO ] Invariant cache hit.
[2024-05-27 22:06:48] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-27 22:06:48] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-27 22:06:48] [INFO ] Invariant cache hit.
[2024-05-27 22:06:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:06:50] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-05-27 22:06:50] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-27 22:06:50] [INFO ] Invariant cache hit.
[2024-05-27 22:06:50] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-27 22:06:59] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 1 ms to minimize.
[2024-05-27 22:06:59] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:06:59] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:06:59] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 2 ms to minimize.
[2024-05-27 22:06:59] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:07:00] [INFO ] Deduced a trap composed of 294 places in 277 ms of which 4 ms to minimize.
[2024-05-27 22:07:00] [INFO ] Deduced a trap composed of 294 places in 285 ms of which 4 ms to minimize.
[2024-05-27 22:07:01] [INFO ] Deduced a trap composed of 146 places in 251 ms of which 3 ms to minimize.
[2024-05-27 22:07:01] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 2 ms to minimize.
[2024-05-27 22:07:01] [INFO ] Deduced a trap composed of 286 places in 295 ms of which 12 ms to minimize.
[2024-05-27 22:07:03] [INFO ] Deduced a trap composed of 269 places in 291 ms of which 4 ms to minimize.
[2024-05-27 22:07:03] [INFO ] Deduced a trap composed of 286 places in 278 ms of which 4 ms to minimize.
[2024-05-27 22:07:03] [INFO ] Deduced a trap composed of 317 places in 287 ms of which 4 ms to minimize.
[2024-05-27 22:07:04] [INFO ] Deduced a trap composed of 368 places in 299 ms of which 4 ms to minimize.
[2024-05-27 22:07:04] [INFO ] Deduced a trap composed of 339 places in 289 ms of which 4 ms to minimize.
[2024-05-27 22:07:04] [INFO ] Deduced a trap composed of 297 places in 292 ms of which 4 ms to minimize.
[2024-05-27 22:07:05] [INFO ] Deduced a trap composed of 292 places in 266 ms of which 4 ms to minimize.
[2024-05-27 22:07:05] [INFO ] Deduced a trap composed of 260 places in 287 ms of which 4 ms to minimize.
[2024-05-27 22:07:13] [INFO ] Deduced a trap composed of 275 places in 262 ms of which 4 ms to minimize.
[2024-05-27 22:07:13] [INFO ] Deduced a trap composed of 269 places in 235 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-27 22:07:22] [INFO ] Deduced a trap composed of 270 places in 266 ms of which 5 ms to minimize.
SMT process timed out in 31331ms, After SMT, problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 31352ms
Finished structural reductions in LTL mode , in 1 iterations and 74541 ms. Remains : 536/536 places, 968/968 transitions.
Support contains 421 out of 536 places after structural reductions.
[2024-05-27 22:07:22] [INFO ] Flatten gal took : 128 ms
[2024-05-27 22:07:22] [INFO ] Flatten gal took : 93 ms
[2024-05-27 22:07:22] [INFO ] Input system was already deterministic with 968 transitions.
Reduction of identical properties reduced properties to check from 57 to 52
RANDOM walk for 40000 steps (13 resets) in 1121 ms. (35 steps per ms) remains 13/52 properties
BEST_FIRST walk for 40002 steps (8 resets) in 701 ms. (56 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (9 resets) in 512 ms. (77 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (12 resets) in 565 ms. (70 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (10 resets) in 569 ms. (70 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (11 resets) in 435 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 629 ms. (63 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 486 ms. (82 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (10 resets) in 654 ms. (61 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (29 resets) in 611 ms. (65 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (14 resets) in 588 ms. (67 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (10 resets) in 503 ms. (79 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (18 resets) in 658 ms. (60 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (10 resets) in 618 ms. (64 steps per ms) remains 13/13 properties
[2024-05-27 22:07:25] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-27 22:07:25] [INFO ] Invariant cache hit.
[2024-05-27 22:07:25] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp54 is UNSAT
At refinement iteration 3 (OVERLAPS) 297/489 variables, 15/18 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 7/496 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 6/26 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 9 (OVERLAPS) 40/536 variables, 24/50 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 0/50 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 956/1492 variables, 536/586 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1492 variables, 72/658 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1492 variables, 0/658 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1492 variables, 0/658 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1492/1492 variables, and 658 constraints, problems are : Problem set: 9 solved, 4 unsolved in 2330 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 150/170 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 1/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 34/204 variables, 2/5 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 243/447 variables, 8/13 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/13 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 9/456 variables, 3/16 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 77/533 variables, 32/48 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-05-27 22:07:29] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 2 ms to minimize.
[2024-05-27 22:07:29] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 2 ms to minimize.
[2024-05-27 22:07:29] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 1 ms to minimize.
[2024-05-27 22:07:29] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:07:29] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/533 variables, 5/53 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/533 variables, 0/53 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/534 variables, 1/54 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 0/54 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 956/1490 variables, 534/588 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1490 variables, 72/660 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1490 variables, 4/664 constraints. Problems are: Problem set: 9 solved, 4 unsolved
(s386 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 1)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 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 9)
(s147 0)
(s148 1)
(s149 1)
(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 1)
(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 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(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 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s277 0)
(s278 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 0)
(s316 1)
(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 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 3)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1490/1492 variables, and 664 constraints, problems are : Problem set: 9 solved, 4 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 534/536 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/13 constraints, Known Traps: 5/5 constraints]
After SMT, in 7545ms problems are : Problem set: 9 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 534 transition count 926
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 92 place count 492 transition count 920
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 98 place count 486 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 98 place count 486 transition count 860
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 218 place count 426 transition count 860
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 314 place count 378 transition count 812
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 326 place count 378 transition count 800
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 338 place count 366 transition count 800
Applied a total of 338 rules in 228 ms. Remains 366 /536 variables (removed 170) and now considering 800/968 (removed 168) transitions.
Running 798 sub problems to find dead transitions.
[2024-05-27 22:07:33] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
// Phase 1: matrix 788 rows 366 cols
[2024-05-27 22:07:33] [INFO ] Computed 48 invariants in 23 ms
[2024-05-27 22:07:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-27 22:07:39] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 2 ms to minimize.
[2024-05-27 22:07:39] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:07:39] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-05-27 22:07:39] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:07:39] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:07:39] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 3 ms to minimize.
[2024-05-27 22:07:39] [INFO ] Deduced a trap composed of 146 places in 198 ms of which 3 ms to minimize.
[2024-05-27 22:07:41] [INFO ] Deduced a trap composed of 210 places in 209 ms of which 3 ms to minimize.
[2024-05-27 22:07:45] [INFO ] Deduced a trap composed of 123 places in 203 ms of which 3 ms to minimize.
[2024-05-27 22:07:45] [INFO ] Deduced a trap composed of 102 places in 207 ms of which 3 ms to minimize.
[2024-05-27 22:07:46] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 3 ms to minimize.
[2024-05-27 22:07:46] [INFO ] Deduced a trap composed of 135 places in 208 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-27 22:07:48] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-05-27 22:07:48] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 2 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 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.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 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 9.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.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 1.0)
(s192 0.0)
(s193 0.0)
(s194 1.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1154 variables, and 60 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-27 22:07:58] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-27 22:08:01] [INFO ] Deduced a trap composed of 220 places in 166 ms of which 2 ms to minimize.
[2024-05-27 22:08:01] [INFO ] Deduced a trap composed of 114 places in 175 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-27 22:08:09] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 4)
(s1 6)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 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 9)
(s129 0)
(s130 1)
(s131 1)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(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 1)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(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)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 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 1)
(s279 0)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 9)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 timeout
0)
(s348 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1154 variables, and 64 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 18/18 constraints]
After SMT, in 41454ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 41467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41698 ms. Remains : 366/536 places, 800/968 transitions.
RANDOM walk for 40000 steps (24 resets) in 873 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (10 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (12 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (11 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 158062 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 4
Probabilistic random walk after 158062 steps, saw 91768 distinct states, run finished after 3005 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-27 22:08:18] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2024-05-27 22:08:18] [INFO ] Invariant cache hit.
[2024-05-27 22:08:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 157/177 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/192 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 156/348 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/350 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 22:08:19] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-27 22:08:19] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:08:19] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:08:19] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:08:19] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 13/363 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/364 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 788/1152 variables, 364/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1152 variables, 72/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1152 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/1154 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1154 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1154 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1154 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1154/1154 variables, and 491 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2292 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 157/177 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/192 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 156/348 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 22:08:21] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/350 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 13/363 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/364 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 22:08:21] [INFO ] Deduced a trap composed of 147 places in 212 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/364 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 788/1152 variables, 364/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1152 variables, 72/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1152 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1152 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/1154 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1154 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1154/1154 variables, and 497 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 47318ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 800/800 transitions.
Applied a total of 0 rules in 42 ms. Remains 366 /366 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 366/366 places, 800/800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 800/800 transitions.
Applied a total of 0 rules in 31 ms. Remains 366 /366 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2024-05-27 22:09:06] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2024-05-27 22:09:06] [INFO ] Invariant cache hit.
[2024-05-27 22:09:06] [INFO ] Implicit Places using invariants in 552 ms returned [330, 331, 332, 333, 334, 335]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 556 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 360/366 places, 800/800 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 354 transition count 794
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 354 transition count 794
Applied a total of 12 rules in 34 ms. Remains 354 /360 variables (removed 6) and now considering 794/800 (removed 6) transitions.
[2024-05-27 22:09:06] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
// Phase 1: matrix 782 rows 354 cols
[2024-05-27 22:09:06] [INFO ] Computed 42 invariants in 32 ms
[2024-05-27 22:09:07] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-05-27 22:09:07] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
[2024-05-27 22:09:07] [INFO ] Invariant cache hit.
[2024-05-27 22:09:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 22:09:10] [INFO ] Implicit Places using invariants and state equation in 3035 ms returned []
Implicit Place search using SMT with State Equation took 3651 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 354/366 places, 794/800 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4273 ms. Remains : 354/366 places, 794/800 transitions.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J06T06-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:09:10] [INFO ] Flatten gal took : 87 ms
[2024-05-27 22:09:10] [INFO ] Flatten gal took : 69 ms
[2024-05-27 22:09:10] [INFO ] Input system was already deterministic with 968 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 536 transition count 938
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 506 transition count 932
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 500 transition count 932
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 72 place count 500 transition count 872
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 192 place count 440 transition count 872
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 204 place count 434 transition count 866
Applied a total of 204 rules in 61 ms. Remains 434 /536 variables (removed 102) and now considering 866/968 (removed 102) transitions.
Running 864 sub problems to find dead transitions.
[2024-05-27 22:09:11] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 434 cols
[2024-05-27 22:09:11] [INFO ] Computed 50 invariants in 29 ms
[2024-05-27 22:09:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-05-27 22:09:18] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 3 ms to minimize.
[2024-05-27 22:09:18] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:09:18] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:09:18] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:09:18] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 1 ms to minimize.
[2024-05-27 22:09:18] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-27 22:09:18] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:09:19] [INFO ] Deduced a trap composed of 173 places in 179 ms of which 2 ms to minimize.
[2024-05-27 22:09:19] [INFO ] Deduced a trap composed of 159 places in 180 ms of which 3 ms to minimize.
[2024-05-27 22:09:19] [INFO ] Deduced a trap composed of 173 places in 216 ms of which 3 ms to minimize.
[2024-05-27 22:09:20] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:09:25] [INFO ] Deduced a trap composed of 142 places in 237 ms of which 4 ms to minimize.
[2024-05-27 22:09:25] [INFO ] Deduced a trap composed of 148 places in 201 ms of which 3 ms to minimize.
[2024-05-27 22:09:26] [INFO ] Deduced a trap composed of 83 places in 219 ms of which 3 ms to minimize.
[2024-05-27 22:09:26] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 2 ms to minimize.
[2024-05-27 22:09:27] [INFO ] Deduced a trap composed of 167 places in 180 ms of which 3 ms to minimize.
[2024-05-27 22:09:27] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 3 ms to minimize.
[2024-05-27 22:09:28] [INFO ] Deduced a trap composed of 97 places in 178 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1288 variables, and 64 constraints, problems are : Problem set: 0 solved, 864 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/434 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-05-27 22:09:33] [INFO ] Deduced a trap composed of 187 places in 229 ms of which 3 ms to minimize.
[2024-05-27 22:09:33] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-27 22:09:37] [INFO ] Deduced a trap composed of 165 places in 225 ms of which 3 ms to minimize.
[2024-05-27 22:09:40] [INFO ] Deduced a trap composed of 156 places in 249 ms of which 4 ms to minimize.
[2024-05-27 22:09:40] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1288 variables, and 69 constraints, problems are : Problem set: 0 solved, 864 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/434 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 23/23 constraints]
After SMT, in 41207ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 41218ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41283 ms. Remains : 434/536 places, 866/968 transitions.
[2024-05-27 22:09:52] [INFO ] Flatten gal took : 31 ms
[2024-05-27 22:09:52] [INFO ] Flatten gal took : 35 ms
[2024-05-27 22:09:52] [INFO ] Input system was already deterministic with 866 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 534 transition count 932
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 498 transition count 926
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 492 transition count 926
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 84 place count 492 transition count 866
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 204 place count 432 transition count 866
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 300 place count 384 transition count 818
Applied a total of 300 rules in 45 ms. Remains 384 /536 variables (removed 152) and now considering 818/968 (removed 150) transitions.
Running 816 sub problems to find dead transitions.
[2024-05-27 22:09:52] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 384 cols
[2024-05-27 22:09:52] [INFO ] Computed 48 invariants in 10 ms
[2024-05-27 22:09:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 22:09:58] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:09:58] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-27 22:09:58] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:09:58] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:09:58] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:09:58] [INFO ] Deduced a trap composed of 147 places in 203 ms of which 3 ms to minimize.
[2024-05-27 22:09:58] [INFO ] Deduced a trap composed of 181 places in 221 ms of which 3 ms to minimize.
[2024-05-27 22:09:59] [INFO ] Deduced a trap composed of 157 places in 214 ms of which 3 ms to minimize.
[2024-05-27 22:09:59] [INFO ] Deduced a trap composed of 145 places in 219 ms of which 4 ms to minimize.
[2024-05-27 22:10:00] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:10:01] [INFO ] Deduced a trap composed of 228 places in 208 ms of which 3 ms to minimize.
[2024-05-27 22:10:06] [INFO ] Deduced a trap composed of 114 places in 237 ms of which 3 ms to minimize.
[2024-05-27 22:10:06] [INFO ] Deduced a trap composed of 163 places in 204 ms of which 3 ms to minimize.
[2024-05-27 22:10:07] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 3 ms to minimize.
[2024-05-27 22:10:07] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 22:10:08] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 3 ms to minimize.
[2024-05-27 22:10:08] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.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 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 1.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.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 9.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 1.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 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 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 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 4.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 1.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1190 variables, and 62 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/36 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 22:10:15] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 2 ms to minimize.
[2024-05-27 22:10:17] [INFO ] Deduced a trap composed of 140 places in 164 ms of which 2 ms to minimize.
[2024-05-27 22:10:22] [INFO ] Deduced a trap composed of 127 places in 193 ms of which 2 ms to minimize.
[2024-05-27 22:10:23] [INFO ] Deduced a trap composed of 172 places in 213 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 22:10:33] [INFO ] Deduced a trap composed of 132 places in 214 ms of which 5 ms to minimize.
[2024-05-27 22:10:33] [INFO ] Deduced a trap composed of 195 places in 152 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1190 variables, and 68 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/36 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 23/23 constraints]
After SMT, in 41093ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 41104ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41151 ms. Remains : 384/536 places, 818/968 transitions.
[2024-05-27 22:10:33] [INFO ] Flatten gal took : 33 ms
[2024-05-27 22:10:33] [INFO ] Flatten gal took : 33 ms
[2024-05-27 22:10:33] [INFO ] Input system was already deterministic with 818 transitions.
RANDOM walk for 177 steps (0 resets) in 5 ms. (29 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J06T06-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 17 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-27 22:10:33] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-05-27 22:10:33] [INFO ] Computed 48 invariants in 27 ms
[2024-05-27 22:10:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-27 22:10:42] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-05-27 22:10:42] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:10:42] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:10:42] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:10:42] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:10:43] [INFO ] Deduced a trap composed of 292 places in 256 ms of which 4 ms to minimize.
[2024-05-27 22:10:43] [INFO ] Deduced a trap composed of 304 places in 228 ms of which 4 ms to minimize.
[2024-05-27 22:10:43] [INFO ] Deduced a trap composed of 281 places in 241 ms of which 4 ms to minimize.
[2024-05-27 22:10:44] [INFO ] Deduced a trap composed of 240 places in 235 ms of which 3 ms to minimize.
[2024-05-27 22:10:44] [INFO ] Deduced a trap composed of 124 places in 215 ms of which 4 ms to minimize.
[2024-05-27 22:10:44] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:10:45] [INFO ] Deduced a trap composed of 281 places in 268 ms of which 3 ms to minimize.
[2024-05-27 22:10:45] [INFO ] Deduced a trap composed of 243 places in 210 ms of which 4 ms to minimize.
[2024-05-27 22:10:55] [INFO ] Deduced a trap composed of 221 places in 233 ms of which 4 ms to minimize.
SMT process timed out in 21311ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 21321ms
Finished structural reductions in LTL mode , in 1 iterations and 21340 ms. Remains : 522/536 places, 956/968 transitions.
[2024-05-27 22:10:55] [INFO ] Flatten gal took : 59 ms
[2024-05-27 22:10:55] [INFO ] Flatten gal took : 39 ms
[2024-05-27 22:10:55] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 530 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 530 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 524 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 524 transition count 956
Applied a total of 24 rules in 14 ms. Remains 524 /536 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-27 22:10:55] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 524 cols
[2024-05-27 22:10:55] [INFO ] Computed 50 invariants in 23 ms
[2024-05-27 22:10:55] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-27 22:11:03] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:11:03] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:11:03] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:11:03] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 0 ms to minimize.
[2024-05-27 22:11:03] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:11:04] [INFO ] Deduced a trap composed of 254 places in 254 ms of which 4 ms to minimize.
[2024-05-27 22:11:04] [INFO ] Deduced a trap composed of 148 places in 218 ms of which 4 ms to minimize.
[2024-05-27 22:11:04] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:11:05] [INFO ] Deduced a trap composed of 281 places in 295 ms of which 5 ms to minimize.
[2024-05-27 22:11:05] [INFO ] Deduced a trap composed of 294 places in 257 ms of which 4 ms to minimize.
[2024-05-27 22:11:06] [INFO ] Deduced a trap composed of 297 places in 250 ms of which 4 ms to minimize.
[2024-05-27 22:11:06] [INFO ] Deduced a trap composed of 279 places in 251 ms of which 3 ms to minimize.
[2024-05-27 22:11:06] [INFO ] Deduced a trap composed of 289 places in 212 ms of which 3 ms to minimize.
[2024-05-27 22:11:14] [INFO ] Deduced a trap composed of 272 places in 260 ms of which 4 ms to minimize.
[2024-05-27 22:11:14] [INFO ] Deduced a trap composed of 247 places in 229 ms of which 3 ms to minimize.
[2024-05-27 22:11:14] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1468 variables, and 62 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/524 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-27 22:11:18] [INFO ] Deduced a trap composed of 256 places in 246 ms of which 4 ms to minimize.
[2024-05-27 22:11:18] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-05-27 22:11:23] [INFO ] Deduced a trap composed of 274 places in 220 ms of which 4 ms to minimize.
[2024-05-27 22:11:23] [INFO ] Deduced a trap composed of 350 places in 265 ms of which 4 ms to minimize.
[2024-05-27 22:11:24] [INFO ] Deduced a trap composed of 358 places in 230 ms of which 3 ms to minimize.
[2024-05-27 22:11:27] [INFO ] Deduced a trap composed of 246 places in 223 ms of which 3 ms to minimize.
[2024-05-27 22:11:30] [INFO ] Deduced a trap composed of 118 places in 258 ms of which 4 ms to minimize.
[2024-05-27 22:11:30] [INFO ] Deduced a trap composed of 115 places in 257 ms of which 3 ms to minimize.
[2024-05-27 22:11:30] [INFO ] Deduced a trap composed of 307 places in 189 ms of which 2 ms to minimize.
[2024-05-27 22:11:31] [INFO ] Deduced a trap composed of 314 places in 183 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1468 variables, and 72 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/524 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 41098ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41107ms
Finished structural reductions in LTL mode , in 1 iterations and 41125 ms. Remains : 524/536 places, 956/968 transitions.
[2024-05-27 22:11:36] [INFO ] Flatten gal took : 43 ms
[2024-05-27 22:11:36] [INFO ] Flatten gal took : 55 ms
[2024-05-27 22:11:36] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 534 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 486 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 486 transition count 860
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 426 transition count 860
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 288 place count 390 transition count 824
Applied a total of 288 rules in 44 ms. Remains 390 /536 variables (removed 146) and now considering 824/968 (removed 144) transitions.
Running 822 sub problems to find dead transitions.
[2024-05-27 22:11:36] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 390 cols
[2024-05-27 22:11:36] [INFO ] Computed 48 invariants in 9 ms
[2024-05-27 22:11:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-27 22:11:42] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-27 22:11:42] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:11:42] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:11:42] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:11:42] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:11:43] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 3 ms to minimize.
[2024-05-27 22:11:43] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
[2024-05-27 22:11:49] [INFO ] Deduced a trap composed of 67 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-27 22:11:50] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-05-27 22:11:51] [INFO ] Deduced a trap composed of 234 places in 190 ms of which 3 ms to minimize.
[2024-05-27 22:11:53] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 3 ms to minimize.
[2024-05-27 22:11:56] [INFO ] Deduced a trap composed of 131 places in 168 ms of which 2 ms to minimize.
[2024-05-27 22:11:56] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-27 22:11:56] [INFO ] Deduced a trap composed of 149 places in 164 ms of which 2 ms to minimize.
[2024-05-27 22:11:57] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1202 variables, and 61 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-27 22:12:06] [INFO ] Deduced a trap composed of 132 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1202 variables, and 62 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 16/16 constraints]
After SMT, in 41274ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41285ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41333 ms. Remains : 390/536 places, 824/968 transitions.
[2024-05-27 22:12:17] [INFO ] Flatten gal took : 51 ms
[2024-05-27 22:12:17] [INFO ] Flatten gal took : 43 ms
[2024-05-27 22:12:18] [INFO ] Input system was already deterministic with 824 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 534 transition count 932
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 498 transition count 926
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 492 transition count 926
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 84 place count 492 transition count 860
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 216 place count 426 transition count 860
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 420 transition count 854
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 420 transition count 854
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 300 place count 384 transition count 818
Applied a total of 300 rules in 47 ms. Remains 384 /536 variables (removed 152) and now considering 818/968 (removed 150) transitions.
Running 816 sub problems to find dead transitions.
[2024-05-27 22:12:18] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 384 cols
[2024-05-27 22:12:18] [INFO ] Computed 48 invariants in 13 ms
[2024-05-27 22:12:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 22:12:23] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 2 ms to minimize.
[2024-05-27 22:12:23] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 5 ms to minimize.
[2024-05-27 22:12:23] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:12:23] [INFO ] Deduced a trap composed of 48 places in 35 ms of which 0 ms to minimize.
[2024-05-27 22:12:23] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:12:24] [INFO ] Deduced a trap composed of 156 places in 143 ms of which 2 ms to minimize.
[2024-05-27 22:12:24] [INFO ] Deduced a trap composed of 174 places in 151 ms of which 4 ms to minimize.
[2024-05-27 22:12:24] [INFO ] Deduced a trap composed of 143 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:12:24] [INFO ] Deduced a trap composed of 189 places in 156 ms of which 2 ms to minimize.
[2024-05-27 22:12:24] [INFO ] Deduced a trap composed of 161 places in 152 ms of which 2 ms to minimize.
[2024-05-27 22:12:24] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 3 ms to minimize.
[2024-05-27 22:12:25] [INFO ] Deduced a trap composed of 148 places in 148 ms of which 3 ms to minimize.
[2024-05-27 22:12:25] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 2 ms to minimize.
[2024-05-27 22:12:25] [INFO ] Deduced a trap composed of 143 places in 149 ms of which 2 ms to minimize.
[2024-05-27 22:12:25] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:12:27] [INFO ] Deduced a trap composed of 228 places in 144 ms of which 3 ms to minimize.
[2024-05-27 22:12:29] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-27 22:12:32] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 816 unsolved
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 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.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 timeout
0.0)
(s68 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 816 unsolved
SMT process timed out in 21012ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 21022ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 21071 ms. Remains : 384/536 places, 818/968 transitions.
[2024-05-27 22:12:39] [INFO ] Flatten gal took : 26 ms
[2024-05-27 22:12:39] [INFO ] Flatten gal took : 56 ms
[2024-05-27 22:12:39] [INFO ] Input system was already deterministic with 818 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 18 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-27 22:12:39] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-05-27 22:12:39] [INFO ] Computed 48 invariants in 11 ms
[2024-05-27 22:12:39] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-27 22:12:48] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:12:48] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:12:48] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:12:48] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-05-27 22:12:48] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 1 ms to minimize.
[2024-05-27 22:12:48] [INFO ] Deduced a trap composed of 292 places in 229 ms of which 4 ms to minimize.
[2024-05-27 22:12:49] [INFO ] Deduced a trap composed of 304 places in 236 ms of which 3 ms to minimize.
[2024-05-27 22:12:49] [INFO ] Deduced a trap composed of 281 places in 219 ms of which 4 ms to minimize.
[2024-05-27 22:12:49] [INFO ] Deduced a trap composed of 240 places in 299 ms of which 19 ms to minimize.
[2024-05-27 22:12:50] [INFO ] Deduced a trap composed of 124 places in 204 ms of which 3 ms to minimize.
[2024-05-27 22:12:50] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 0 ms to minimize.
[2024-05-27 22:12:50] [INFO ] Deduced a trap composed of 281 places in 229 ms of which 3 ms to minimize.
[2024-05-27 22:12:51] [INFO ] Deduced a trap composed of 243 places in 191 ms of which 3 ms to minimize.
[2024-05-27 22:13:00] [INFO ] Deduced a trap composed of 221 places in 354 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 60 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-27 22:13:02] [INFO ] Deduced a trap composed of 221 places in 262 ms of which 3 ms to minimize.
[2024-05-27 22:13:06] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2024-05-27 22:13:07] [INFO ] Deduced a trap composed of 276 places in 204 ms of which 3 ms to minimize.
[2024-05-27 22:13:07] [INFO ] Deduced a trap composed of 354 places in 205 ms of which 3 ms to minimize.
[2024-05-27 22:13:11] [INFO ] Deduced a trap composed of 272 places in 200 ms of which 3 ms to minimize.
[2024-05-27 22:13:11] [INFO ] Deduced a trap composed of 246 places in 198 ms of which 3 ms to minimize.
[2024-05-27 22:13:12] [INFO ] Deduced a trap composed of 277 places in 207 ms of which 4 ms to minimize.
[2024-05-27 22:13:12] [INFO ] Deduced a trap composed of 62 places in 241 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 68 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 22/22 constraints]
After SMT, in 41334ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41347ms
Finished structural reductions in LTL mode , in 1 iterations and 41370 ms. Remains : 522/536 places, 956/968 transitions.
[2024-05-27 22:13:20] [INFO ] Flatten gal took : 29 ms
[2024-05-27 22:13:20] [INFO ] Flatten gal took : 30 ms
[2024-05-27 22:13:20] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 536 transition count 950
Reduce places removed 18 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 30 rules applied. Total rules applied 48 place count 518 transition count 938
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 60 place count 506 transition count 938
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 60 place count 506 transition count 878
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 180 place count 446 transition count 878
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 228 place count 422 transition count 854
Applied a total of 228 rules in 40 ms. Remains 422 /536 variables (removed 114) and now considering 854/968 (removed 114) transitions.
Running 852 sub problems to find dead transitions.
[2024-05-27 22:13:20] [INFO ] Flow matrix only has 842 transitions (discarded 12 similar events)
// Phase 1: matrix 842 rows 422 cols
[2024-05-27 22:13:20] [INFO ] Computed 50 invariants in 10 ms
[2024-05-27 22:13:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-05-27 22:13:26] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2024-05-27 22:13:26] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:13:26] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:13:26] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:13:26] [INFO ] Deduced a trap composed of 54 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:13:27] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 2 ms to minimize.
[2024-05-27 22:13:27] [INFO ] Deduced a trap composed of 174 places in 196 ms of which 3 ms to minimize.
[2024-05-27 22:13:27] [INFO ] Deduced a trap composed of 191 places in 171 ms of which 3 ms to minimize.
[2024-05-27 22:13:27] [INFO ] Deduced a trap composed of 169 places in 184 ms of which 3 ms to minimize.
[2024-05-27 22:13:27] [INFO ] Deduced a trap composed of 161 places in 179 ms of which 3 ms to minimize.
[2024-05-27 22:13:28] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:13:28] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 1 ms to minimize.
[2024-05-27 22:13:32] [INFO ] Deduced a trap composed of 228 places in 179 ms of which 3 ms to minimize.
[2024-05-27 22:13:33] [INFO ] Deduced a trap composed of 103 places in 178 ms of which 2 ms to minimize.
[2024-05-27 22:13:33] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-05-27 22:13:35] [INFO ] Deduced a trap composed of 170 places in 189 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-05-27 22:13:36] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-27 22:13:40] [INFO ] Deduced a trap composed of 206 places in 153 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1264 variables, and 64 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/422 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-05-27 22:13:44] [INFO ] Deduced a trap composed of 272 places in 215 ms of which 3 ms to minimize.
[2024-05-27 22:13:50] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-05-27 22:13:51] [INFO ] Deduced a trap composed of 229 places in 152 ms of which 2 ms to minimize.
[2024-05-27 22:13:51] [INFO ] Deduced a trap composed of 208 places in 178 ms of which 3 ms to minimize.
[2024-05-27 22:13:51] [INFO ] Deduced a trap composed of 245 places in 162 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1264 variables, and 69 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/422 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/852 constraints, Known Traps: 23/23 constraints]
After SMT, in 40900ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 40909ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40951 ms. Remains : 422/536 places, 854/968 transitions.
[2024-05-27 22:14:01] [INFO ] Flatten gal took : 25 ms
[2024-05-27 22:14:01] [INFO ] Flatten gal took : 27 ms
[2024-05-27 22:14:01] [INFO ] Input system was already deterministic with 854 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Applied a total of 2 rules in 7 ms. Remains 534 /536 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-27 22:14:01] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 534 cols
[2024-05-27 22:14:01] [INFO ] Computed 48 invariants in 53 ms
[2024-05-27 22:14:01] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-27 22:14:10] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:14:10] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:14:10] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:14:10] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:14:10] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:14:10] [INFO ] Deduced a trap composed of 255 places in 249 ms of which 4 ms to minimize.
[2024-05-27 22:14:10] [INFO ] Deduced a trap composed of 148 places in 202 ms of which 4 ms to minimize.
[2024-05-27 22:14:11] [INFO ] Deduced a trap composed of 146 places in 196 ms of which 4 ms to minimize.
[2024-05-27 22:14:11] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:14:11] [INFO ] Deduced a trap composed of 311 places in 200 ms of which 3 ms to minimize.
[2024-05-27 22:14:12] [INFO ] Deduced a trap composed of 286 places in 248 ms of which 4 ms to minimize.
[2024-05-27 22:14:12] [INFO ] Deduced a trap composed of 288 places in 205 ms of which 4 ms to minimize.
[2024-05-27 22:14:12] [INFO ] Deduced a trap composed of 292 places in 232 ms of which 3 ms to minimize.
[2024-05-27 22:14:12] [INFO ] Deduced a trap composed of 310 places in 224 ms of which 3 ms to minimize.
[2024-05-27 22:14:13] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2024-05-27 22:14:13] [INFO ] Deduced a trap composed of 276 places in 249 ms of which 4 ms to minimize.
[2024-05-27 22:14:13] [INFO ] Deduced a trap composed of 274 places in 214 ms of which 3 ms to minimize.
[2024-05-27 22:14:13] [INFO ] Deduced a trap composed of 290 places in 213 ms of which 3 ms to minimize.
[2024-05-27 22:14:14] [INFO ] Deduced a trap composed of 281 places in 209 ms of which 4 ms to minimize.
[2024-05-27 22:14:21] [INFO ] Deduced a trap composed of 280 places in 214 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1490 variables, and 66 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-27 22:14:32] [INFO ] Deduced a trap composed of 275 places in 214 ms of which 4 ms to minimize.
[2024-05-27 22:14:33] [INFO ] Deduced a trap composed of 275 places in 252 ms of which 4 ms to minimize.
[2024-05-27 22:14:33] [INFO ] Deduced a trap composed of 302 places in 228 ms of which 5 ms to minimize.
[2024-05-27 22:14:33] [INFO ] Deduced a trap composed of 284 places in 229 ms of which 3 ms to minimize.
[2024-05-27 22:14:33] [INFO ] Deduced a trap composed of 247 places in 224 ms of which 3 ms to minimize.
[2024-05-27 22:14:34] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 3 ms to minimize.
[2024-05-27 22:14:34] [INFO ] Deduced a trap composed of 282 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 4)
(s1 6)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 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 9)
(s147 0)
(s148 1)
(s149 1)
(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 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 1)
(s184 0)
(s185 0)
(s186 1)
(s187 1)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1490 variables, and 73 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 27/27 constraints]
After SMT, in 41030ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41039ms
Finished structural reductions in LTL mode , in 1 iterations and 41049 ms. Remains : 534/536 places, 968/968 transitions.
[2024-05-27 22:14:42] [INFO ] Flatten gal took : 28 ms
[2024-05-27 22:14:42] [INFO ] Flatten gal took : 29 ms
[2024-05-27 22:14:43] [INFO ] Input system was already deterministic with 968 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 536 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 488 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 488 transition count 860
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 428 transition count 860
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 276 place count 398 transition count 830
Applied a total of 276 rules in 33 ms. Remains 398 /536 variables (removed 138) and now considering 830/968 (removed 138) transitions.
Running 828 sub problems to find dead transitions.
[2024-05-27 22:14:43] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
// Phase 1: matrix 818 rows 398 cols
[2024-05-27 22:14:43] [INFO ] Computed 50 invariants in 8 ms
[2024-05-27 22:14:43] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2024-05-27 22:14:48] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2024-05-27 22:14:48] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:14:48] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 0 ms to minimize.
[2024-05-27 22:14:48] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
[2024-05-27 22:14:48] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
[2024-05-27 22:14:48] [INFO ] Deduced a trap composed of 113 places in 160 ms of which 2 ms to minimize.
[2024-05-27 22:14:48] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 2 ms to minimize.
[2024-05-27 22:14:49] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2024-05-27 22:14:51] [INFO ] Deduced a trap composed of 240 places in 157 ms of which 2 ms to minimize.
[2024-05-27 22:14:53] [INFO ] Deduced a trap composed of 183 places in 158 ms of which 2 ms to minimize.
[2024-05-27 22:14:53] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-05-27 22:14:56] [INFO ] Deduced a trap composed of 144 places in 170 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2024-05-27 22:15:00] [INFO ] Deduced a trap composed of 146 places in 168 ms of which 2 ms to minimize.
[2024-05-27 22:15:03] [INFO ] Deduced a trap composed of 155 places in 197 ms of which 3 ms to minimize.
[2024-05-27 22:15:03] [INFO ] Deduced a trap composed of 140 places in 229 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1216 variables, and 61 constraints, problems are : Problem set: 0 solved, 828 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/398 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 828/828 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 828 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2024-05-27 22:15:05] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-27 22:15:09] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2024-05-27 22:15:19] [INFO ] Deduced a trap composed of 154 places in 186 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1216 variables, and 64 constraints, problems are : Problem set: 0 solved, 828 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/398 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/828 constraints, Known Traps: 18/18 constraints]
After SMT, in 40877ms problems are : Problem set: 0 solved, 828 unsolved
Search for dead transitions found 0 dead transitions in 40884ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40919 ms. Remains : 398/536 places, 830/968 transitions.
[2024-05-27 22:15:23] [INFO ] Flatten gal took : 28 ms
[2024-05-27 22:15:24] [INFO ] Flatten gal took : 26 ms
[2024-05-27 22:15:24] [INFO ] Input system was already deterministic with 830 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Applied a total of 14 rules in 10 ms. Remains 528 /536 variables (removed 8) and now considering 962/968 (removed 6) transitions.
Running 960 sub problems to find dead transitions.
[2024-05-27 22:15:24] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
// Phase 1: matrix 950 rows 528 cols
[2024-05-27 22:15:24] [INFO ] Computed 48 invariants in 23 ms
[2024-05-27 22:15:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-27 22:15:32] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:15:32] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:15:32] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:15:32] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:15:32] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:15:33] [INFO ] Deduced a trap composed of 261 places in 226 ms of which 3 ms to minimize.
[2024-05-27 22:15:33] [INFO ] Deduced a trap composed of 149 places in 173 ms of which 3 ms to minimize.
[2024-05-27 22:15:33] [INFO ] Deduced a trap composed of 131 places in 192 ms of which 3 ms to minimize.
[2024-05-27 22:15:33] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:15:34] [INFO ] Deduced a trap composed of 303 places in 247 ms of which 3 ms to minimize.
[2024-05-27 22:15:34] [INFO ] Deduced a trap composed of 278 places in 271 ms of which 4 ms to minimize.
[2024-05-27 22:15:34] [INFO ] Deduced a trap composed of 282 places in 265 ms of which 4 ms to minimize.
[2024-05-27 22:15:41] [INFO ] Deduced a trap composed of 274 places in 266 ms of which 4 ms to minimize.
[2024-05-27 22:15:41] [INFO ] Deduced a trap composed of 275 places in 213 ms of which 3 ms to minimize.
[2024-05-27 22:15:42] [INFO ] Deduced a trap composed of 247 places in 187 ms of which 3 ms to minimize.
[2024-05-27 22:15:42] [INFO ] Deduced a trap composed of 284 places in 182 ms of which 3 ms to minimize.
[2024-05-27 22:15:42] [INFO ] Deduced a trap composed of 269 places in 190 ms of which 3 ms to minimize.
[2024-05-27 22:15:43] [INFO ] Deduced a trap composed of 290 places in 179 ms of which 3 ms to minimize.
[2024-05-27 22:15:43] [INFO ] Deduced a trap composed of 286 places in 212 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1478 variables, and 65 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-27 22:15:47] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-05-27 22:15:51] [INFO ] Deduced a trap composed of 260 places in 262 ms of which 4 ms to minimize.
[2024-05-27 22:15:52] [INFO ] Deduced a trap composed of 275 places in 244 ms of which 4 ms to minimize.
[2024-05-27 22:15:52] [INFO ] Deduced a trap composed of 281 places in 263 ms of which 4 ms to minimize.
[2024-05-27 22:15:52] [INFO ] Deduced a trap composed of 271 places in 224 ms of which 3 ms to minimize.
[2024-05-27 22:15:53] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-05-27 22:15:57] [INFO ] Deduced a trap composed of 283 places in 269 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1478 variables, and 72 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 26/26 constraints]
After SMT, in 41134ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 41143ms
Finished structural reductions in LTL mode , in 1 iterations and 41156 ms. Remains : 528/536 places, 962/968 transitions.
[2024-05-27 22:16:05] [INFO ] Flatten gal took : 28 ms
[2024-05-27 22:16:05] [INFO ] Flatten gal took : 31 ms
[2024-05-27 22:16:05] [INFO ] Input system was already deterministic with 962 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 15 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-27 22:16:05] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-05-27 22:16:05] [INFO ] Computed 48 invariants in 18 ms
[2024-05-27 22:16:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-27 22:16:13] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-05-27 22:16:13] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:16:13] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:16:14] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:16:14] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:16:14] [INFO ] Deduced a trap composed of 292 places in 267 ms of which 4 ms to minimize.
[2024-05-27 22:16:14] [INFO ] Deduced a trap composed of 304 places in 214 ms of which 3 ms to minimize.
[2024-05-27 22:16:15] [INFO ] Deduced a trap composed of 281 places in 217 ms of which 3 ms to minimize.
[2024-05-27 22:16:15] [INFO ] Deduced a trap composed of 240 places in 250 ms of which 4 ms to minimize.
[2024-05-27 22:16:15] [INFO ] Deduced a trap composed of 124 places in 219 ms of which 3 ms to minimize.
[2024-05-27 22:16:15] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:16:16] [INFO ] Deduced a trap composed of 281 places in 275 ms of which 4 ms to minimize.
[2024-05-27 22:16:16] [INFO ] Deduced a trap composed of 243 places in 248 ms of which 3 ms to minimize.
[2024-05-27 22:16:25] [INFO ] Deduced a trap composed of 221 places in 261 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 60 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-27 22:16:27] [INFO ] Deduced a trap composed of 221 places in 265 ms of which 4 ms to minimize.
[2024-05-27 22:16:32] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 3 ms to minimize.
[2024-05-27 22:16:32] [INFO ] Deduced a trap composed of 276 places in 255 ms of which 4 ms to minimize.
[2024-05-27 22:16:32] [INFO ] Deduced a trap composed of 354 places in 257 ms of which 3 ms to minimize.
[2024-05-27 22:16:36] [INFO ] Deduced a trap composed of 272 places in 276 ms of which 4 ms to minimize.
[2024-05-27 22:16:36] [INFO ] Deduced a trap composed of 246 places in 254 ms of which 4 ms to minimize.
[2024-05-27 22:16:37] [INFO ] Deduced a trap composed of 277 places in 214 ms of which 3 ms to minimize.
[2024-05-27 22:16:37] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 68 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 22/22 constraints]
After SMT, in 40949ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40961ms
Finished structural reductions in LTL mode , in 1 iterations and 40979 ms. Remains : 522/536 places, 956/968 transitions.
[2024-05-27 22:16:46] [INFO ] Flatten gal took : 26 ms
[2024-05-27 22:16:46] [INFO ] Flatten gal took : 29 ms
[2024-05-27 22:16:46] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 530 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 530 transition count 962
Applied a total of 12 rules in 9 ms. Remains 530 /536 variables (removed 6) and now considering 962/968 (removed 6) transitions.
Running 960 sub problems to find dead transitions.
[2024-05-27 22:16:46] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
// Phase 1: matrix 950 rows 530 cols
[2024-05-27 22:16:46] [INFO ] Computed 50 invariants in 10 ms
[2024-05-27 22:16:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-27 22:16:54] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 2 ms to minimize.
[2024-05-27 22:16:54] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:16:54] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 2 ms to minimize.
[2024-05-27 22:16:54] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:16:54] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:16:55] [INFO ] Deduced a trap composed of 268 places in 258 ms of which 4 ms to minimize.
[2024-05-27 22:16:55] [INFO ] Deduced a trap composed of 293 places in 240 ms of which 3 ms to minimize.
[2024-05-27 22:16:55] [INFO ] Deduced a trap composed of 118 places in 227 ms of which 4 ms to minimize.
[2024-05-27 22:16:56] [INFO ] Deduced a trap composed of 151 places in 230 ms of which 4 ms to minimize.
[2024-05-27 22:16:56] [INFO ] Deduced a trap composed of 133 places in 216 ms of which 4 ms to minimize.
[2024-05-27 22:16:56] [INFO ] Deduced a trap composed of 303 places in 252 ms of which 4 ms to minimize.
[2024-05-27 22:16:57] [INFO ] Deduced a trap composed of 287 places in 240 ms of which 3 ms to minimize.
[2024-05-27 22:16:57] [INFO ] Deduced a trap composed of 305 places in 213 ms of which 3 ms to minimize.
[2024-05-27 22:16:57] [INFO ] Deduced a trap composed of 268 places in 213 ms of which 3 ms to minimize.
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 72 places in 184 ms of which 3 ms to minimize.
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 293 places in 211 ms of which 3 ms to minimize.
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 293 places in 193 ms of which 4 ms to minimize.
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 292 places in 262 ms of which 4 ms to minimize.
[2024-05-27 22:16:59] [INFO ] Deduced a trap composed of 273 places in 240 ms of which 4 ms to minimize.
[2024-05-27 22:17:06] [INFO ] Deduced a trap composed of 58 places in 268 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-27 22:17:07] [INFO ] Deduced a trap composed of 303 places in 271 ms of which 5 ms to minimize.
SMT process timed out in 21033ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 21044ms
Finished structural reductions in LTL mode , in 1 iterations and 21056 ms. Remains : 530/536 places, 962/968 transitions.
[2024-05-27 22:17:07] [INFO ] Flatten gal took : 37 ms
[2024-05-27 22:17:07] [INFO ] Flatten gal took : 38 ms
[2024-05-27 22:17:07] [INFO ] Input system was already deterministic with 962 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 534 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 486 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 486 transition count 860
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 426 transition count 860
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 300 place count 384 transition count 818
Applied a total of 300 rules in 35 ms. Remains 384 /536 variables (removed 152) and now considering 818/968 (removed 150) transitions.
Running 816 sub problems to find dead transitions.
[2024-05-27 22:17:07] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 384 cols
[2024-05-27 22:17:07] [INFO ] Computed 48 invariants in 21 ms
[2024-05-27 22:17:07] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 22:17:13] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 2 ms to minimize.
[2024-05-27 22:17:13] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:17:13] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
[2024-05-27 22:17:13] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:17:13] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:17:14] [INFO ] Deduced a trap composed of 146 places in 174 ms of which 3 ms to minimize.
[2024-05-27 22:17:14] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 2 ms to minimize.
[2024-05-27 22:17:14] [INFO ] Deduced a trap composed of 130 places in 160 ms of which 3 ms to minimize.
[2024-05-27 22:17:14] [INFO ] Deduced a trap composed of 145 places in 171 ms of which 3 ms to minimize.
[2024-05-27 22:17:16] [INFO ] Deduced a trap composed of 228 places in 199 ms of which 3 ms to minimize.
[2024-05-27 22:17:19] [INFO ] Deduced a trap composed of 125 places in 220 ms of which 3 ms to minimize.
[2024-05-27 22:17:22] [INFO ] Deduced a trap composed of 119 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 22:17:23] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-27 22:17:26] [INFO ] Deduced a trap composed of 167 places in 186 ms of which 3 ms to minimize.
[2024-05-27 22:17:26] [INFO ] Deduced a trap composed of 168 places in 159 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1190 variables, and 61 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 22:17:37] [INFO ] Deduced a trap composed of 202 places in 184 ms of which 3 ms to minimize.
[2024-05-27 22:17:37] [INFO ] Deduced a trap composed of 127 places in 186 ms of which 2 ms to minimize.
[2024-05-27 22:17:37] [INFO ] Deduced a trap composed of 226 places in 183 ms of which 2 ms to minimize.
[2024-05-27 22:17:38] [INFO ] Deduced a trap composed of 134 places in 177 ms of which 3 ms to minimize.
[2024-05-27 22:17:38] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 2 ms to minimize.
[2024-05-27 22:17:38] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 2 ms to minimize.
[2024-05-27 22:17:39] [INFO ] Deduced a trap composed of 161 places in 191 ms of which 2 ms to minimize.
[2024-05-27 22:17:39] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 2 ms to minimize.
[2024-05-27 22:17:43] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-27 22:17:43] [INFO ] Deduced a trap composed of 132 places in 172 ms of which 3 ms to minimize.
[2024-05-27 22:17:44] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 3 ms to minimize.
[2024-05-27 22:17:45] [INFO ] Deduced a trap composed of 88 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1190 variables, and 73 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 27/27 constraints]
After SMT, in 41169ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 41180ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41219 ms. Remains : 384/536 places, 818/968 transitions.
[2024-05-27 22:17:48] [INFO ] Flatten gal took : 31 ms
[2024-05-27 22:17:49] [INFO ] Flatten gal took : 32 ms
[2024-05-27 22:17:49] [INFO ] Input system was already deterministic with 818 transitions.
RANDOM walk for 66 steps (0 resets) in 6 ms. (9 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J06T06-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 15 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-27 22:17:49] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-05-27 22:17:49] [INFO ] Computed 48 invariants in 14 ms
[2024-05-27 22:17:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-27 22:17:57] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-27 22:17:57] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 2 ms to minimize.
[2024-05-27 22:17:57] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 2 ms to minimize.
[2024-05-27 22:17:57] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:17:57] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:17:57] [INFO ] Deduced a trap composed of 292 places in 255 ms of which 3 ms to minimize.
[2024-05-27 22:17:58] [INFO ] Deduced a trap composed of 304 places in 237 ms of which 4 ms to minimize.
[2024-05-27 22:17:58] [INFO ] Deduced a trap composed of 281 places in 180 ms of which 3 ms to minimize.
[2024-05-27 22:17:58] [INFO ] Deduced a trap composed of 240 places in 162 ms of which 3 ms to minimize.
[2024-05-27 22:17:58] [INFO ] Deduced a trap composed of 124 places in 202 ms of which 3 ms to minimize.
[2024-05-27 22:17:59] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:17:59] [INFO ] Deduced a trap composed of 281 places in 199 ms of which 4 ms to minimize.
[2024-05-27 22:18:00] [INFO ] Deduced a trap composed of 243 places in 241 ms of which 4 ms to minimize.
[2024-05-27 22:18:09] [INFO ] Deduced a trap composed of 221 places in 247 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 60 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-27 22:18:12] [INFO ] Deduced a trap composed of 221 places in 292 ms of which 3 ms to minimize.
[2024-05-27 22:18:16] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 3 ms to minimize.
[2024-05-27 22:18:17] [INFO ] Deduced a trap composed of 276 places in 260 ms of which 9 ms to minimize.
[2024-05-27 22:18:17] [INFO ] Deduced a trap composed of 354 places in 228 ms of which 3 ms to minimize.
[2024-05-27 22:18:21] [INFO ] Deduced a trap composed of 272 places in 264 ms of which 4 ms to minimize.
[2024-05-27 22:18:21] [INFO ] Deduced a trap composed of 246 places in 238 ms of which 4 ms to minimize.
[2024-05-27 22:18:22] [INFO ] Deduced a trap composed of 277 places in 267 ms of which 4 ms to minimize.
[2024-05-27 22:18:22] [INFO ] Deduced a trap composed of 62 places in 247 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 68 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 22/22 constraints]
After SMT, in 41096ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41107ms
Finished structural reductions in LTL mode , in 1 iterations and 41124 ms. Remains : 522/536 places, 956/968 transitions.
[2024-05-27 22:18:30] [INFO ] Flatten gal took : 37 ms
[2024-05-27 22:18:30] [INFO ] Flatten gal took : 39 ms
[2024-05-27 22:18:30] [INFO ] Input system was already deterministic with 956 transitions.
[2024-05-27 22:18:30] [INFO ] Flatten gal took : 36 ms
[2024-05-27 22:18:30] [INFO ] Flatten gal took : 36 ms
[2024-05-27 22:18:30] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 14 ms.
[2024-05-27 22:18:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 536 places, 968 transitions and 4194 arcs took 8 ms.
Total runtime 748696 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J06T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/425/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 536
TRANSITIONS: 968
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.026s, Sys 0.002s]


SAVING FILE /home/mcc/execution/425/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 2086
MODEL NAME: /home/mcc/execution/425/model
536 places, 968 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PolyORBLF-COL-S02J06T06-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

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-S02J06T06"
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-S02J06T06, 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-171654445200098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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