Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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-S02J04T10-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717248282796

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:24:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:24:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:24:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:24:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:24:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 585 ms
[2024-06-01 13:24:44] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2024-06-01 13:24:44] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 13:24:44] [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 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 55 to 53
RANDOM walk for 40000 steps (13 resets) in 2039 ms. (19 steps per ms) remains 16/53 properties
BEST_FIRST walk for 4000 steps (9 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (9 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (9 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (9 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
[2024-06-01 13:24:45] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:24:45] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 13:24:45] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/59 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 12 unsolved
Problem AtomicPropp49 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/9 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 3/62 variables, 2/11 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 1/12 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 11 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 7 (OVERLAPS) 17/79 variables, 12/24 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/24 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/80 variables, 1/25 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 12 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 12 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 12 solved, 4 unsolved in 420 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: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 2/2 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 12 solved, 4 unsolved
[2024-06-01 13:24:46] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 4/117 constraints. Problems are: Problem set: 12 solved, 4 unsolved
[2024-06-01 13:24:46] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 1/118 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/143 variables, 0/118 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/145 variables, 2/120 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 1/121 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/145 variables, 0/121 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/145 variables, 0/121 constraints. Problems are: Problem set: 12 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 121 constraints, problems are : Problem set: 12 solved, 4 unsolved in 400 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/16 constraints, Known Traps: 2/2 constraints]
After SMT, in 871ms problems are : Problem set: 12 solved, 4 unsolved
Parikh walk visited 0 properties in 3212 ms.
Support contains 5 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 54 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-06-01 13:24:50] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-06-01 13:24:50] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 13:24:50] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 13:24:50] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:24:50] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
[2024-06-01 13:24:50] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:24:50] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:24:50] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:24:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:24:50] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 6/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 44/104 variables, 60/92 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 8/100 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:24:51] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:24:51] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 2/102 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:24:51] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:24:51] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/104 variables, 2/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 104 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 7/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:24:51] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/97 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/105 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/147 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 147 constraints, problems are : Problem set: 2 solved, 42 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 12/12 constraints]
After SMT, in 2622ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 2624ms
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 : 60/81 places, 43/65 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 0 places and 2 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2715 ms. Remains : 60/81 places, 39/65 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Successfully simplified 16 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:24:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 13:24:52] [INFO ] Flatten gal took : 26 ms
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:24:52] [INFO ] Flatten gal took : 13 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:24:52] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 49 ms.
[2024-06-01 13:24:52] [INFO ] Unfolded 13 HLPN properties in 1 ms.
[2024-06-01 13:24:52] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 13:24:52] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 13:24:52] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 13:24:52] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 13:24:52] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 13:24:52] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 13:24:52] [INFO ] Reduced 40 identical enabling conditions.
[2024-06-01 13:24:52] [INFO ] Reduced 40 identical enabling conditions.
[2024-06-01 13:24:52] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 13:24:52] [INFO ] Reduced 40 identical enabling conditions.
[2024-06-01 13:24:52] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 13:24:52] [INFO ] Reduced 40 identical enabling conditions.
[2024-06-01 13:24:52] [INFO ] Reduced 40 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 630 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 14 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 13:24:52] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-06-01 13:24:52] [INFO ] Computed 54 invariants in 54 ms
[2024-06-01 13:24:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:25:10] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:25:10] [INFO ] Deduced a trap composed of 373 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:25:11] [INFO ] Deduced a trap composed of 381 places in 249 ms of which 4 ms to minimize.
[2024-06-01 13:25:11] [INFO ] Deduced a trap composed of 237 places in 323 ms of which 3 ms to minimize.
[2024-06-01 13:25:12] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:25:13] [INFO ] Deduced a trap composed of 407 places in 419 ms of which 6 ms to minimize.
[2024-06-01 13:25:13] [INFO ] Deduced a trap composed of 441 places in 338 ms of which 4 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 432 places in 357 ms of which 4 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 413 places in 323 ms of which 5 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 410 places in 302 ms of which 5 ms to minimize.
[2024-06-01 13:25:15] [INFO ] Deduced a trap composed of 381 places in 335 ms of which 4 ms to minimize.
SMT process timed out in 22394ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 22412ms
[2024-06-01 13:25:15] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 13:25:15] [INFO ] Invariant cache hit.
[2024-06-01 13:25:15] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-06-01 13:25:15] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 13:25:15] [INFO ] Invariant cache hit.
[2024-06-01 13:25:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:25:19] [INFO ] Implicit Places using invariants and state equation in 3890 ms returned []
Implicit Place search using SMT with State Equation took 4124 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2024-06-01 13:25:19] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 13:25:19] [INFO ] Invariant cache hit.
[2024-06-01 13:25:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 13:25:37] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:25:42] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:25:42] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:25:42] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:25:43] [INFO ] Deduced a trap composed of 66 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:25:43] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:25:43] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 2 ms to minimize.
[2024-06-01 13:25:43] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:25:43] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:25:43] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:25:44] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:25:46] [INFO ] Deduced a trap composed of 432 places in 434 ms of which 5 ms to minimize.
[2024-06-01 13:25:46] [INFO ] Deduced a trap composed of 397 places in 392 ms of which 5 ms to minimize.
[2024-06-01 13:25:47] [INFO ] Deduced a trap composed of 369 places in 398 ms of which 5 ms to minimize.
[2024-06-01 13:25:47] [INFO ] Deduced a trap composed of 384 places in 374 ms of which 5 ms to minimize.
[2024-06-01 13:25:48] [INFO ] Deduced a trap composed of 424 places in 357 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 13:25:53] [INFO ] Deduced a trap composed of 205 places in 326 ms of which 5 ms to minimize.
[2024-06-01 13:25:53] [INFO ] Deduced a trap composed of 246 places in 341 ms of which 5 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 381 places in 363 ms of which 6 ms to minimize.
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 451 places in 359 ms of which 6 ms to minimize.
[2024-06-01 13:25:56] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:26:04] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 4 ms to minimize.
[2024-06-01 13:26:05] [INFO ] Deduced a trap composed of 415 places in 354 ms of which 6 ms to minimize.
[2024-06-01 13:26:13] [INFO ] Deduced a trap composed of 402 places in 358 ms of which 6 ms to minimize.
[2024-06-01 13:26:15] [INFO ] Deduced a trap composed of 377 places in 348 ms of which 5 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 402 places in 378 ms of which 6 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 369 places in 340 ms of which 5 ms to minimize.
[2024-06-01 13:26:19] [INFO ] Deduced a trap composed of 524 places in 425 ms of which 5 ms to minimize.
[2024-06-01 13:26:20] [INFO ] Deduced a trap composed of 462 places in 338 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2144 variables, and 79 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 29/29 constraints]
After SMT, in 61942ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 61955ms
Finished structural reductions in LTL mode , in 1 iterations and 88518 ms. Remains : 752/752 places, 1412/1412 transitions.
Support contains 630 out of 752 places after structural reductions.
[2024-06-01 13:26:21] [INFO ] Flatten gal took : 120 ms
[2024-06-01 13:26:21] [INFO ] Flatten gal took : 124 ms
[2024-06-01 13:26:22] [INFO ] Input system was already deterministic with 1412 transitions.
Reduction of identical properties reduced properties to check from 64 to 63
RANDOM walk for 40000 steps (12 resets) in 1585 ms. (25 steps per ms) remains 16/63 properties
BEST_FIRST walk for 4001 steps (8 resets) in 128 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 158 ms. (25 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 128 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 131 ms. (30 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 91 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 114 ms. (34 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 92 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 83 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 94 ms. (42 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
[2024-06-01 13:26:23] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 13:26:23] [INFO ] Invariant cache hit.
[2024-06-01 13:26:23] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 198/492 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 12/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 4 (OVERLAPS) 256/748 variables, 25/50 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 0/50 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/750 variables, 2/52 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 0/52 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/752 variables, 2/54 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 0/54 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1392/2144 variables, 752/806 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2144 variables, 120/926 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2144 variables, 0/926 constraints. Problems are: Problem set: 11 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 926 constraints, problems are : Problem set: 11 solved, 5 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 262/321 variables, 6/6 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 1/7 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 33/354 variables, 6/13 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/13 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 373/727 variables, 26/39 constraints. Problems are: Problem set: 11 solved, 5 unsolved
[2024-06-01 13:26:29] [INFO ] Deduced a trap composed of 65 places in 377 ms of which 6 ms to minimize.
[2024-06-01 13:26:29] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 9 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:26:31] [INFO ] Deduced a trap composed of 95 places in 374 ms of which 4 ms to minimize.
[2024-06-01 13:26:31] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:26:31] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 5 ms to minimize.
[2024-06-01 13:26:32] [INFO ] Deduced a trap composed of 376 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:26:32] [INFO ] Deduced a trap composed of 440 places in 366 ms of which 5 ms to minimize.
[2024-06-01 13:26:32] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:26:33] [INFO ] Deduced a trap composed of 435 places in 532 ms of which 20 ms to minimize.
[2024-06-01 13:26:33] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 727/2144 variables, and 52 constraints, problems are : Problem set: 11 solved, 5 unsolved in 5038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 27/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/16 constraints, Known Traps: 13/13 constraints]
After SMT, in 10429ms problems are : Problem set: 11 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 752 transition count 1352
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 692 transition count 1342
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 682 transition count 1342
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 140 place count 682 transition count 1262
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 300 place count 602 transition count 1262
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 380 place count 562 transition count 1222
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 400 place count 562 transition count 1202
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 420 place count 542 transition count 1202
Applied a total of 420 rules in 315 ms. Remains 542 /752 variables (removed 210) and now considering 1202/1412 (removed 210) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 13:26:34] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
// Phase 1: matrix 1182 rows 542 cols
[2024-06-01 13:26:34] [INFO ] Computed 54 invariants in 39 ms
[2024-06-01 13:26:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:26:45] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:26:45] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:26:45] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:26:45] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:26:47] [INFO ] Deduced a trap composed of 209 places in 310 ms of which 3 ms to minimize.
[2024-06-01 13:26:49] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:26:51] [INFO ] Deduced a trap composed of 330 places in 333 ms of which 5 ms to minimize.
[2024-06-01 13:26:54] [INFO ] Deduced a trap composed of 231 places in 342 ms of which 3 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 278 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 276 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 88 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 133 places in 285 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1724 variables, and 67 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/542 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 230 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:27:05] [INFO ] Deduced a trap composed of 56 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:27:11] [INFO ] Deduced a trap composed of 202 places in 323 ms of which 4 ms to minimize.
[2024-06-01 13:27:11] [INFO ] Deduced a trap composed of 241 places in 277 ms of which 3 ms to minimize.
[2024-06-01 13:27:12] [INFO ] Deduced a trap composed of 242 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:27:12] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:27:12] [INFO ] Deduced a trap composed of 211 places in 300 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1724 variables, and 75 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/542 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 25/25 constraints]
After SMT, in 42953ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 42968ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43287 ms. Remains : 542/752 places, 1202/1412 transitions.
RANDOM walk for 40000 steps (17 resets) in 792 ms. (50 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (9 resets) in 320 ms. (124 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 343 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (11 resets) in 304 ms. (131 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 242 ms. (164 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (9 resets) in 304 ms. (131 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 133533 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 5
Probabilistic random walk after 133533 steps, saw 80277 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :0
[2024-06-01 13:27:20] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-06-01 13:27:20] [INFO ] Invariant cache hit.
[2024-06-01 13:27:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 373/432 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/432 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 11/443 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 97/540 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 209 places in 310 ms of which 4 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 45 places in 295 ms of which 5 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:27:24] [INFO ] Deduced a trap composed of 243 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:27:24] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:27:24] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:27:24] [INFO ] Deduced a trap composed of 218 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:27:25] [INFO ] Deduced a trap composed of 249 places in 293 ms of which 2 ms to minimize.
[2024-06-01 13:27:25] [INFO ] Deduced a trap composed of 211 places in 279 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/542 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1182/1724 variables, 542/611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1724 variables, 120/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1724 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/1724 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1724/1724 variables, and 731 constraints, problems are : Problem set: 0 solved, 5 unsolved in 9722 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 542/542 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 373/432 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/432 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 11/443 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 97/540 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/542 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1182/1724 variables, 542/611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1724 variables, 120/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1724 variables, 5/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1724 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/1724 variables, and 736 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 542/542 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 15/15 constraints]
After SMT, in 54770ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1202/1202 transitions.
Applied a total of 0 rules in 51 ms. Remains 542 /542 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 542/542 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1202/1202 transitions.
Applied a total of 0 rules in 111 ms. Remains 542 /542 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-06-01 13:28:15] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-06-01 13:28:15] [INFO ] Invariant cache hit.
[2024-06-01 13:28:16] [INFO ] Implicit Places using invariants in 512 ms returned [486, 487, 488, 489, 490, 491, 492, 493, 494, 495]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 520 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 532/542 places, 1202/1202 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 522 transition count 1192
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 522 transition count 1192
Applied a total of 20 rules in 52 ms. Remains 522 /532 variables (removed 10) and now considering 1192/1202 (removed 10) transitions.
[2024-06-01 13:28:16] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
// Phase 1: matrix 1172 rows 522 cols
[2024-06-01 13:28:16] [INFO ] Computed 44 invariants in 56 ms
[2024-06-01 13:28:17] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-06-01 13:28:17] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:28:17] [INFO ] Invariant cache hit.
[2024-06-01 13:28:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:28:22] [INFO ] Implicit Places using invariants and state equation in 4983 ms returned []
Implicit Place search using SMT with State Equation took 5621 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 522/542 places, 1192/1202 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6305 ms. Remains : 522/542 places, 1192/1202 transitions.
Successfully simplified 11 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:28:22] [INFO ] Flatten gal took : 108 ms
[2024-06-01 13:28:22] [INFO ] Flatten gal took : 107 ms
[2024-06-01 13:28:22] [INFO ] Input system was already deterministic with 1412 transitions.
Support contains 599 out of 752 places (down from 619) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 750 transition count 1352
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 690 transition count 1342
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 680 transition count 1342
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 140 place count 680 transition count 1282
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 260 place count 620 transition count 1282
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 400 place count 550 transition count 1212
Applied a total of 400 rules in 106 ms. Remains 550 /752 variables (removed 202) and now considering 1212/1412 (removed 200) transitions.
Running 1210 sub problems to find dead transitions.
[2024-06-01 13:28:22] [INFO ] Flow matrix only has 1192 transitions (discarded 20 similar events)
// Phase 1: matrix 1192 rows 550 cols
[2024-06-01 13:28:22] [INFO ] Computed 52 invariants in 19 ms
[2024-06-01 13:28:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-06-01 13:28:33] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:28:33] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:28:33] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:28:33] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:28:33] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:28:33] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:28:33] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:28:34] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:28:34] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:28:34] [INFO ] Deduced a trap composed of 254 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:28:35] [INFO ] Deduced a trap composed of 255 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:28:35] [INFO ] Deduced a trap composed of 233 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:28:35] [INFO ] Deduced a trap composed of 255 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:28:36] [INFO ] Deduced a trap composed of 222 places in 282 ms of which 3 ms to minimize.
[2024-06-01 13:28:37] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 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 548/1742 variables, and 65 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 5 ms to minimize.
[2024-06-01 13:28:55] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-06-01 13:29:03] [INFO ] Deduced a trap composed of 222 places in 279 ms of which 5 ms to minimize.
[2024-06-01 13:29:04] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 10)
(s183 0)
(s184 1)
(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 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 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 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(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 1)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s331 1)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 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 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/1742 variables, and 69 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1210 constraints, Known Traps: 19/19 constraints]
After SMT, in 42188ms problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 42207ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42318 ms. Remains : 550/752 places, 1212/1412 transitions.
[2024-06-01 13:29:05] [INFO ] Flatten gal took : 48 ms
[2024-06-01 13:29:05] [INFO ] Flatten gal took : 50 ms
[2024-06-01 13:29:05] [INFO ] Input system was already deterministic with 1212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 28 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 13:29:05] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-06-01 13:29:05] [INFO ] Computed 52 invariants in 23 ms
[2024-06-01 13:29:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 2 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:29:21] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 2 ms to minimize.
[2024-06-01 13:29:21] [INFO ] Deduced a trap composed of 404 places in 325 ms of which 5 ms to minimize.
[2024-06-01 13:29:22] [INFO ] Deduced a trap composed of 209 places in 321 ms of which 5 ms to minimize.
[2024-06-01 13:29:23] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:29:23] [INFO ] Deduced a trap composed of 440 places in 352 ms of which 6 ms to minimize.
[2024-06-01 13:29:24] [INFO ] Deduced a trap composed of 432 places in 336 ms of which 4 ms to minimize.
[2024-06-01 13:29:24] [INFO ] Deduced a trap composed of 393 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:29:24] [INFO ] Deduced a trap composed of 411 places in 278 ms of which 3 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 392 places in 283 ms of which 3 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 370 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 404 places in 333 ms of which 4 ms to minimize.
[2024-06-01 13:29:26] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 360 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:29:38] [INFO ] Deduced a trap composed of 491 places in 361 ms of which 6 ms to minimize.
[2024-06-01 13:29:38] [INFO ] Deduced a trap composed of 493 places in 307 ms of which 5 ms to minimize.
[2024-06-01 13:29:39] [INFO ] Deduced a trap composed of 389 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:29:39] [INFO ] Deduced a trap composed of 381 places in 402 ms of which 6 ms to minimize.
[2024-06-01 13:29:40] [INFO ] Deduced a trap composed of 379 places in 369 ms of which 5 ms to minimize.
[2024-06-01 13:29:40] [INFO ] Deduced a trap composed of 448 places in 323 ms of which 5 ms to minimize.
[2024-06-01 13:29:40] [INFO ] Deduced a trap composed of 357 places in 334 ms of which 4 ms to minimize.
[2024-06-01 13:29:43] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:29:43] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 80 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 30/30 constraints]
After SMT, in 42021ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42037ms
Finished structural reductions in LTL mode , in 1 iterations and 42067 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-06-01 13:29:47] [INFO ] Flatten gal took : 119 ms
[2024-06-01 13:29:47] [INFO ] Flatten gal took : 92 ms
[2024-06-01 13:29:47] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 660 transition count 1322
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 180 place count 660 transition count 1262
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 300 place count 600 transition count 1262
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 460 place count 520 transition count 1182
Applied a total of 460 rules in 67 ms. Remains 520 /752 variables (removed 232) and now considering 1182/1412 (removed 230) transitions.
Running 1180 sub problems to find dead transitions.
[2024-06-01 13:29:47] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 520 cols
[2024-06-01 13:29:47] [INFO ] Computed 52 invariants in 29 ms
[2024-06-01 13:29:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:30:00] [INFO ] Deduced a trap composed of 220 places in 320 ms of which 4 ms to minimize.
[2024-06-01 13:30:00] [INFO ] Deduced a trap composed of 192 places in 322 ms of which 4 ms to minimize.
[2024-06-01 13:30:01] [INFO ] Deduced a trap composed of 213 places in 338 ms of which 5 ms to minimize.
[2024-06-01 13:30:01] [INFO ] Deduced a trap composed of 212 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:30:02] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1682 variables, and 64 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:30:13] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:30:14] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 3 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 2 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:30:27] [INFO ] Deduced a trap composed of 190 places in 282 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1682 variables, and 69 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 19/19 constraints]
After SMT, in 42213ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 42228ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42299 ms. Remains : 520/752 places, 1182/1412 transitions.
[2024-06-01 13:30:30] [INFO ] Flatten gal took : 62 ms
[2024-06-01 13:30:30] [INFO ] Flatten gal took : 54 ms
[2024-06-01 13:30:30] [INFO ] Input system was already deterministic with 1182 transitions.
RANDOM walk for 244 steps (0 resets) in 5 ms. (40 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
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 750 transition count 1382
Reduce places removed 30 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 40 rules applied. Total rules applied 70 place count 720 transition count 1372
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 80 place count 710 transition count 1372
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 80 place count 710 transition count 1292
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 240 place count 630 transition count 1292
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 280 place count 610 transition count 1272
Applied a total of 280 rules in 69 ms. Remains 610 /752 variables (removed 142) and now considering 1272/1412 (removed 140) transitions.
Running 1270 sub problems to find dead transitions.
[2024-06-01 13:30:30] [INFO ] Flow matrix only has 1252 transitions (discarded 20 similar events)
// Phase 1: matrix 1252 rows 610 cols
[2024-06-01 13:30:30] [INFO ] Computed 52 invariants in 36 ms
[2024-06-01 13:30:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
[2024-06-01 13:30:46] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:30:46] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 74 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 51 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 2 ms to minimize.
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:30:50] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:30:50] [INFO ] Deduced a trap composed of 213 places in 298 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/1862 variables, and 62 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/610 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1270/1270 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 331 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 332 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 384 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 374 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:30:55] [INFO ] Deduced a trap composed of 433 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:30:59] [INFO ] Deduced a trap composed of 110 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:30:59] [INFO ] Deduced a trap composed of 161 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:31:02] [INFO ] Deduced a trap composed of 328 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:31:02] [INFO ] Deduced a trap composed of 266 places in 275 ms of which 3 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:31:08] [INFO ] Deduced a trap composed of 242 places in 330 ms of which 4 ms to minimize.
[2024-06-01 13:31:09] [INFO ] Deduced a trap composed of 332 places in 313 ms of which 4 ms to minimize.
[2024-06-01 13:31:09] [INFO ] Deduced a trap composed of 268 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:31:10] [INFO ] Deduced a trap composed of 3 places in 310 ms of which 4 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 401 places in 301 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/1862 variables, and 77 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/610 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1270 constraints, Known Traps: 27/27 constraints]
After SMT, in 42291ms problems are : Problem set: 0 solved, 1270 unsolved
Search for dead transitions found 0 dead transitions in 42310ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42383 ms. Remains : 610/752 places, 1272/1412 transitions.
[2024-06-01 13:31:12] [INFO ] Flatten gal took : 76 ms
[2024-06-01 13:31:12] [INFO ] Flatten gal took : 58 ms
[2024-06-01 13:31:12] [INFO ] Input system was already deterministic with 1272 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Applied a total of 22 rules in 23 ms. Remains 740 /752 variables (removed 12) and now considering 1402/1412 (removed 10) transitions.
Running 1400 sub problems to find dead transitions.
[2024-06-01 13:31:12] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 740 cols
[2024-06-01 13:31:12] [INFO ] Computed 52 invariants in 22 ms
[2024-06-01 13:31:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:31:26] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 1 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:31:28] [INFO ] Deduced a trap composed of 420 places in 379 ms of which 5 ms to minimize.
[2024-06-01 13:31:28] [INFO ] Deduced a trap composed of 393 places in 358 ms of which 5 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 396 places in 328 ms of which 5 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 421 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:31:30] [INFO ] Deduced a trap composed of 216 places in 335 ms of which 5 ms to minimize.
[2024-06-01 13:31:31] [INFO ] Deduced a trap composed of 395 places in 249 ms of which 4 ms to minimize.
[2024-06-01 13:31:32] [INFO ] Deduced a trap composed of 416 places in 430 ms of which 6 ms to minimize.
[2024-06-01 13:31:32] [INFO ] Deduced a trap composed of 412 places in 429 ms of which 6 ms to minimize.
[2024-06-01 13:31:33] [INFO ] Deduced a trap composed of 404 places in 389 ms of which 5 ms to minimize.
[2024-06-01 13:31:33] [INFO ] Deduced a trap composed of 409 places in 397 ms of which 4 ms to minimize.
[2024-06-01 13:31:34] [INFO ] Deduced a trap composed of 410 places in 329 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:31:34] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:31:35] [INFO ] Deduced a trap composed of 420 places in 386 ms of which 6 ms to minimize.
SMT process timed out in 22472ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 22491ms
Finished structural reductions in LTL mode , in 1 iterations and 22517 ms. Remains : 740/752 places, 1402/1412 transitions.
[2024-06-01 13:31:35] [INFO ] Flatten gal took : 54 ms
[2024-06-01 13:31:35] [INFO ] Flatten gal took : 53 ms
[2024-06-01 13:31:35] [INFO ] Input system was already deterministic with 1402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 31 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 13:31:35] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-06-01 13:31:35] [INFO ] Computed 52 invariants in 23 ms
[2024-06-01 13:31:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:31:51] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 2 ms to minimize.
[2024-06-01 13:31:51] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:31:51] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 404 places in 366 ms of which 5 ms to minimize.
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 209 places in 328 ms of which 5 ms to minimize.
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 440 places in 329 ms of which 4 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 432 places in 360 ms of which 5 ms to minimize.
[2024-06-01 13:31:55] [INFO ] Deduced a trap composed of 393 places in 368 ms of which 5 ms to minimize.
[2024-06-01 13:31:55] [INFO ] Deduced a trap composed of 411 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:31:55] [INFO ] Deduced a trap composed of 392 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:31:56] [INFO ] Deduced a trap composed of 370 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:31:56] [INFO ] Deduced a trap composed of 404 places in 401 ms of which 5 ms to minimize.
[2024-06-01 13:31:57] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 13:32:00] [INFO ] Deduced a trap composed of 360 places in 370 ms of which 5 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 491 places in 353 ms of which 5 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 493 places in 384 ms of which 5 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 389 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 381 places in 394 ms of which 6 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 379 places in 302 ms of which 5 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 448 places in 392 ms of which 5 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 357 places in 345 ms of which 5 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 80 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 30/30 constraints]
After SMT, in 42109ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42126ms
Finished structural reductions in LTL mode , in 1 iterations and 42161 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-06-01 13:32:17] [INFO ] Flatten gal took : 38 ms
[2024-06-01 13:32:17] [INFO ] Flatten gal took : 42 ms
[2024-06-01 13:32:17] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 742 transition count 1402
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 742 transition count 1402
Applied a total of 20 rules in 15 ms. Remains 742 /752 variables (removed 10) and now considering 1402/1412 (removed 10) transitions.
Running 1400 sub problems to find dead transitions.
[2024-06-01 13:32:18] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 742 cols
[2024-06-01 13:32:18] [INFO ] Computed 54 invariants in 39 ms
[2024-06-01 13:32:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:32:33] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:32:33] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:32:33] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 3 ms to minimize.
[2024-06-01 13:32:33] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:32:33] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 13 ms to minimize.
[2024-06-01 13:32:33] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:32:33] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:32:34] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:32:34] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:32:34] [INFO ] Deduced a trap composed of 414 places in 308 ms of which 5 ms to minimize.
[2024-06-01 13:32:35] [INFO ] Deduced a trap composed of 235 places in 343 ms of which 5 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 387 places in 388 ms of which 5 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 413 places in 357 ms of which 5 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 352 places in 353 ms of which 5 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 429 places in 381 ms of which 5 ms to minimize.
[2024-06-01 13:32:38] [INFO ] Deduced a trap composed of 413 places in 320 ms of which 5 ms to minimize.
[2024-06-01 13:32:38] [INFO ] Deduced a trap composed of 387 places in 264 ms of which 3 ms to minimize.
[2024-06-01 13:32:38] [INFO ] Deduced a trap composed of 410 places in 382 ms of which 4 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 394 places in 390 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/2124 variables, and 70 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/742 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:32:42] [INFO ] Deduced a trap composed of 369 places in 355 ms of which 5 ms to minimize.
[2024-06-01 13:32:43] [INFO ] Deduced a trap composed of 392 places in 374 ms of which 5 ms to minimize.
[2024-06-01 13:32:44] [INFO ] Deduced a trap composed of 426 places in 417 ms of which 6 ms to minimize.
[2024-06-01 13:32:44] [INFO ] Deduced a trap composed of 385 places in 375 ms of which 5 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 385 places in 355 ms of which 5 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 422 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 430 places in 332 ms of which 4 ms to minimize.
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 412 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 379 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 411 places in 367 ms of which 5 ms to minimize.
[2024-06-01 13:32:47] [INFO ] Deduced a trap composed of 399 places in 393 ms of which 6 ms to minimize.
[2024-06-01 13:32:47] [INFO ] Deduced a trap composed of 383 places in 388 ms of which 5 ms to minimize.
[2024-06-01 13:32:48] [INFO ] Deduced a trap composed of 468 places in 449 ms of which 5 ms to minimize.
[2024-06-01 13:32:48] [INFO ] Deduced a trap composed of 427 places in 352 ms of which 5 ms to minimize.
[2024-06-01 13:32:51] [INFO ] Deduced a trap composed of 75 places in 187 ms of which 2 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 500 places in 350 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/2124 variables, and 86 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/742 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 36/36 constraints]
After SMT, in 42195ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 42212ms
Finished structural reductions in LTL mode , in 1 iterations and 42230 ms. Remains : 742/752 places, 1402/1412 transitions.
[2024-06-01 13:33:00] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:33:00] [INFO ] Flatten gal took : 41 ms
[2024-06-01 13:33:00] [INFO ] Input system was already deterministic with 1402 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 180 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 340 place count 580 transition count 1242
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
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 460 place count 520 transition count 1182
Applied a total of 460 rules in 41 ms. Remains 520 /752 variables (removed 232) and now considering 1182/1412 (removed 230) transitions.
Running 1180 sub problems to find dead transitions.
[2024-06-01 13:33:00] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 520 cols
[2024-06-01 13:33:00] [INFO ] Computed 52 invariants in 23 ms
[2024-06-01 13:33:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:33:12] [INFO ] Deduced a trap composed of 192 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:33:12] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:33:12] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 229 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 68 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 113 places in 208 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1682 variables, and 65 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:33:31] [INFO ] Deduced a trap composed of 245 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:33:36] [INFO ] Deduced a trap composed of 196 places in 178 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1682 variables, and 69 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 19/19 constraints]
After SMT, in 41871ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 41881ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41926 ms. Remains : 520/752 places, 1182/1412 transitions.
[2024-06-01 13:33:42] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:33:42] [INFO ] Flatten gal took : 51 ms
[2024-06-01 13:33:42] [INFO ] Input system was already deterministic with 1182 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 750 transition count 1362
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 700 transition count 1352
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 690 transition count 1352
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 120 place count 690 transition count 1292
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 240 place count 630 transition count 1292
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 3 with 60 rules applied. Total rules applied 300 place count 600 transition count 1262
Applied a total of 300 rules in 61 ms. Remains 600 /752 variables (removed 152) and now considering 1262/1412 (removed 150) transitions.
Running 1260 sub problems to find dead transitions.
[2024-06-01 13:33:42] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 600 cols
[2024-06-01 13:33:42] [INFO ] Computed 52 invariants in 41 ms
[2024-06-01 13:33:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2024-06-01 13:33:53] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2024-06-01 13:33:53] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:33:53] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:33:53] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:33:54] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:33:54] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:33:54] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:33:54] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:33:54] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 241 places in 285 ms of which 3 ms to minimize.
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 255 places in 324 ms of which 4 ms to minimize.
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 3 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 259 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 213 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 212 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 258 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 278 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:34:03] [INFO ] Deduced a trap composed of 257 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:34:03] [INFO ] Deduced a trap composed of 257 places in 228 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2024-06-01 13:34:04] [INFO ] Deduced a trap composed of 264 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:34:04] [INFO ] Deduced a trap composed of 250 places in 224 ms of which 4 ms to minimize.
SMT process timed out in 22155ms, After SMT, problems are : Problem set: 0 solved, 1260 unsolved
Search for dead transitions found 0 dead transitions in 22171ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22236 ms. Remains : 600/752 places, 1262/1412 transitions.
[2024-06-01 13:34:04] [INFO ] Flatten gal took : 32 ms
[2024-06-01 13:34:04] [INFO ] Flatten gal took : 34 ms
[2024-06-01 13:34:04] [INFO ] Input system was already deterministic with 1262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 29 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 13:34:05] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-06-01 13:34:05] [INFO ] Computed 52 invariants in 37 ms
[2024-06-01 13:34:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:34:20] [INFO ] Deduced a trap composed of 404 places in 395 ms of which 5 ms to minimize.
[2024-06-01 13:34:20] [INFO ] Deduced a trap composed of 209 places in 317 ms of which 5 ms to minimize.
[2024-06-01 13:34:21] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 440 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 432 places in 343 ms of which 4 ms to minimize.
[2024-06-01 13:34:23] [INFO ] Deduced a trap composed of 393 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:34:23] [INFO ] Deduced a trap composed of 411 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:34:23] [INFO ] Deduced a trap composed of 392 places in 277 ms of which 3 ms to minimize.
[2024-06-01 13:34:23] [INFO ] Deduced a trap composed of 370 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:34:24] [INFO ] Deduced a trap composed of 404 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:34:25] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 13:34:29] [INFO ] Deduced a trap composed of 360 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:34:38] [INFO ] Deduced a trap composed of 491 places in 419 ms of which 6 ms to minimize.
[2024-06-01 13:34:38] [INFO ] Deduced a trap composed of 493 places in 340 ms of which 5 ms to minimize.
[2024-06-01 13:34:38] [INFO ] Deduced a trap composed of 389 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:34:39] [INFO ] Deduced a trap composed of 381 places in 390 ms of which 5 ms to minimize.
[2024-06-01 13:34:39] [INFO ] Deduced a trap composed of 379 places in 312 ms of which 4 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 448 places in 341 ms of which 5 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 357 places in 391 ms of which 5 ms to minimize.
[2024-06-01 13:34:43] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:34:43] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 80 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 30/30 constraints]
After SMT, in 41952ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41966ms
Finished structural reductions in LTL mode , in 1 iterations and 41999 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-06-01 13:34:47] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:34:47] [INFO ] Flatten gal took : 39 ms
[2024-06-01 13:34:47] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 23 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 13:34:47] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 13:34:47] [INFO ] Invariant cache hit.
[2024-06-01 13:34:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 13:35:03] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 1 ms to minimize.
[2024-06-01 13:35:06] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:35:06] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:35:06] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 13:35:11] [INFO ] Deduced a trap composed of 203 places in 350 ms of which 5 ms to minimize.
[2024-06-01 13:35:11] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:35:11] [INFO ] Deduced a trap composed of 367 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:35:18] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:35:19] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:35:19] [INFO ] Deduced a trap composed of 491 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 491 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 491 places in 271 ms of which 3 ms to minimize.
[2024-06-01 13:35:29] [INFO ] Deduced a trap composed of 384 places in 319 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 68 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 18/18 constraints]
After SMT, in 41988ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41999ms
Finished structural reductions in LTL mode , in 1 iterations and 42026 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-06-01 13:35:29] [INFO ] Flatten gal took : 38 ms
[2024-06-01 13:35:29] [INFO ] Flatten gal took : 37 ms
[2024-06-01 13:35:29] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Applied a total of 2 rules in 10 ms. Remains 750 /752 variables (removed 2) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 13:35:29] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 750 cols
[2024-06-01 13:35:29] [INFO ] Computed 52 invariants in 14 ms
[2024-06-01 13:35:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 13:35:43] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:35:44] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:35:44] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:35:44] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:35:44] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:35:44] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:35:44] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:35:44] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:35:44] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:35:45] [INFO ] Deduced a trap composed of 414 places in 337 ms of which 5 ms to minimize.
[2024-06-01 13:35:45] [INFO ] Deduced a trap composed of 389 places in 313 ms of which 4 ms to minimize.
[2024-06-01 13:35:46] [INFO ] Deduced a trap composed of 406 places in 329 ms of which 4 ms to minimize.
[2024-06-01 13:35:46] [INFO ] Deduced a trap composed of 243 places in 324 ms of which 5 ms to minimize.
[2024-06-01 13:35:46] [INFO ] Deduced a trap composed of 376 places in 270 ms of which 3 ms to minimize.
[2024-06-01 13:35:47] [INFO ] Deduced a trap composed of 247 places in 307 ms of which 5 ms to minimize.
[2024-06-01 13:35:48] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:35:49] [INFO ] Deduced a trap composed of 413 places in 288 ms of which 3 ms to minimize.
[2024-06-01 13:35:49] [INFO ] Deduced a trap composed of 400 places in 347 ms of which 4 ms to minimize.
[2024-06-01 13:35:49] [INFO ] Deduced a trap composed of 393 places in 334 ms of which 4 ms to minimize.
[2024-06-01 13:35:50] [INFO ] Deduced a trap composed of 475 places in 330 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2142 variables, and 70 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/750 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 13:35:53] [INFO ] Deduced a trap composed of 458 places in 315 ms of which 4 ms to minimize.
[2024-06-01 13:35:54] [INFO ] Deduced a trap composed of 395 places in 395 ms of which 6 ms to minimize.
[2024-06-01 13:35:55] [INFO ] Deduced a trap composed of 393 places in 351 ms of which 4 ms to minimize.
[2024-06-01 13:35:55] [INFO ] Deduced a trap composed of 393 places in 351 ms of which 5 ms to minimize.
[2024-06-01 13:35:56] [INFO ] Deduced a trap composed of 412 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:35:56] [INFO ] Deduced a trap composed of 396 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:35:56] [INFO ] Deduced a trap composed of 416 places in 294 ms of which 3 ms to minimize.
[2024-06-01 13:35:56] [INFO ] Deduced a trap composed of 379 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:36:05] [INFO ] Deduced a trap composed of 514 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:36:05] [INFO ] Deduced a trap composed of 528 places in 330 ms of which 4 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2142 variables, and 82 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/750 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 32/32 constraints]
After SMT, in 41929ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 41942ms
Finished structural reductions in LTL mode , in 1 iterations and 41955 ms. Remains : 750/752 places, 1412/1412 transitions.
[2024-06-01 13:36:11] [INFO ] Flatten gal took : 33 ms
[2024-06-01 13:36:11] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:36:11] [INFO ] Input system was already deterministic with 1412 transitions.
[2024-06-01 13:36:11] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:36:11] [INFO ] Flatten gal took : 69 ms
[2024-06-01 13:36:11] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 26 ms.
[2024-06-01 13:36:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 752 places, 1412 transitions and 6142 arcs took 11 ms.
Total runtime 687695 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-CTLFireability-2024-14

BK_STOP 1717248972242

--------------------
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
mcc2024
ctl formula name PolyORBLF-COL-S02J04T10-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1954/ctl_0_
ctl formula name PolyORBLF-COL-S02J04T10-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1954/ctl_1_
ctl formula name PolyORBLF-COL-S02J04T10-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1954/ctl_2_
ctl formula name PolyORBLF-COL-S02J04T10-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1954/ctl_3_
ctl formula name PolyORBLF-COL-S02J04T10-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1954/ctl_4_
ctl formula name PolyORBLF-COL-S02J04T10-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1954/ctl_5_
ctl formula name PolyORBLF-COL-S02J04T10-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1954/ctl_6_
ctl formula name PolyORBLF-COL-S02J04T10-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1954/ctl_7_
ctl formula name PolyORBLF-COL-S02J04T10-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1954/ctl_8_
ctl formula name PolyORBLF-COL-S02J04T10-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1954/ctl_9_
ctl formula name PolyORBLF-COL-S02J04T10-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1954/ctl_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S02J04T10, 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 r516-tajo-171654446300090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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