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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:52 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.6K 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.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717248229007

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-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:23:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:23:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:23:50] [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:23:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:23:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 655 ms
[2024-06-01 13:23:51] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2024-06-01 13:23:51] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 13:23:51] [INFO ] Skeletonized 15 HLPN properties in 3 ms. Removed 1 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 62 to 61
RANDOM walk for 40000 steps (23 resets) in 1513 ms. (26 steps per ms) remains 14/61 properties
BEST_FIRST walk for 40002 steps (14 resets) in 509 ms. (78 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40000 steps (13 resets) in 152 ms. (261 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (10 resets) in 175 ms. (227 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (13 resets) in 260 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (15 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (12 resets) in 306 ms. (130 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (13 resets) in 137 ms. (289 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (10 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (10 resets) in 177 ms. (224 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (12 resets) in 112 ms. (353 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (18 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
[2024-06-01 13:23:52] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:23:52] [INFO ] Computed 26 invariants in 6 ms
[2024-06-01 13:23:52] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/58 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/9 constraints. Problems are: Problem set: 4 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/61 variables, 3/12 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp43 is UNSAT
At refinement iteration 6 (OVERLAPS) 16/77 variables, 11/23 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-06-01 13:23:52] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/24 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 0/113 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/145 variables, 2/115 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 1/116 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 116 constraints, problems are : Problem set: 9 solved, 4 unsolved in 442 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: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/46 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/5 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/52 variables, 4/9 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/53 variables, 1/10 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/73 variables, 11/21 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 4/117 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/117 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/145 variables, 2/119 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 1/120 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 0/120 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/145 variables, 0/120 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 120 constraints, problems are : Problem set: 9 solved, 4 unsolved in 301 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/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 793ms problems are : Problem set: 9 solved, 4 unsolved
Parikh walk visited 0 properties in 3505 ms.
Support contains 11 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 60
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 75 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 73 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 15 place count 73 transition count 55
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 21 place count 70 transition count 55
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 31 place count 65 transition count 50
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 65 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 63 transition count 48
Applied a total of 35 rules in 31 ms. Remains 63 /81 variables (removed 18) and now considering 48/65 (removed 17) transitions.
Running 47 sub problems to find dead transitions.
[2024-06-01 13:23:56] [INFO ] Flow matrix only has 47 transitions (discarded 1 similar events)
// Phase 1: matrix 47 rows 63 cols
[2024-06-01 13:23:56] [INFO ] Computed 25 invariants in 3 ms
[2024-06-01 13:23:56] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 13:23:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-06-01 13:23:57] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:23:57] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:23:57] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:23:57] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:23:57] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 5/31 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-06-01 13:23:57] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-06-01 13:23:57] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:23:57] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:23:57] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 3/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 47/110 variables, 63/98 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 106 constraints, problems are : Problem set: 2 solved, 45 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 2 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 7/31 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 3/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 47/110 variables, 63/98 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 45/151 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-06-01 13:23:59] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 1/152 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-06-01 13:24:00] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/110 variables, 1/153 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 0/110 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 153 constraints, problems are : Problem set: 2 solved, 45 unsolved in 2133 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/47 constraints, Known Traps: 12/12 constraints]
After SMT, in 3957ms problems are : Problem set: 2 solved, 45 unsolved
Search for dead transitions found 2 dead transitions in 3959ms
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 : 63/81 places, 46/65 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 0 places and 2 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4007 ms. Remains : 63/81 places, 42/65 transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Successfully simplified 13 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S02J04T08-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:24:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 13:24:01] [INFO ] Flatten gal took : 34 ms
FORMULA PolyORBLF-COL-S02J04T08-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:24:01] [INFO ] Flatten gal took : 11 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:24:01] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 33 ms.
[2024-06-01 13:24:01] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-06-01 13:24:01] [INFO ] Reduced 88 identical enabling conditions.
[2024-06-01 13:24:01] [INFO ] Reduced 32 identical enabling conditions.
[2024-06-01 13:24:01] [INFO ] Reduced 88 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 571 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Applied a total of 2 rules in 14 ms. Remains 612 /614 variables (removed 2) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-06-01 13:24:01] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-06-01 13:24:01] [INFO ] Computed 48 invariants in 42 ms
[2024-06-01 13:24:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 13:24:15] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:24:15] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 66 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:24:18] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:24:20] [INFO ] Deduced a trap composed of 300 places in 311 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1710 variables, and 56 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 13:24:25] [INFO ] Deduced a trap composed of 139 places in 286 ms of which 6 ms to minimize.
[2024-06-01 13:24:25] [INFO ] Deduced a trap composed of 184 places in 259 ms of which 5 ms to minimize.
[2024-06-01 13:24:25] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:24:26] [INFO ] Deduced a trap composed of 317 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:24:26] [INFO ] Deduced a trap composed of 371 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:24:39] [INFO ] Deduced a trap composed of 284 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:24:39] [INFO ] Deduced a trap composed of 324 places in 230 ms of which 5 ms to minimize.
[2024-06-01 13:24:39] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:24:40] [INFO ] Deduced a trap composed of 327 places in 301 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1710 variables, and 68 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 22/22 constraints]
After SMT, in 41581ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41597ms
[2024-06-01 13:24:42] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 13:24:42] [INFO ] Invariant cache hit.
[2024-06-01 13:24:42] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 13:24:42] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 13:24:42] [INFO ] Invariant cache hit.
[2024-06-01 13:24:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:24:44] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
Running 1112 sub problems to find dead transitions.
[2024-06-01 13:24:44] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 13:24:44] [INFO ] Invariant cache hit.
[2024-06-01 13:24:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 13:24:56] [INFO ] Deduced a trap composed of 65 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:24:58] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:24:58] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:24:58] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:24:58] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 2 ms to minimize.
[2024-06-01 13:24:58] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:24:58] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:24:58] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:25:01] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 308 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 326 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 340 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 338 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:25:08] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 3 ms to minimize.
[2024-06-01 13:25:08] [INFO ] Deduced a trap composed of 328 places in 250 ms of which 5 ms to minimize.
[2024-06-01 13:25:08] [INFO ] Deduced a trap composed of 344 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 332 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 333 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 333 places in 233 ms of which 4 ms to minimize.
[2024-06-01 13:25:10] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 13:25:11] [INFO ] Deduced a trap composed of 314 places in 312 ms of which 7 ms to minimize.
[2024-06-01 13:25:11] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:25:11] [INFO ] Deduced a trap composed of 183 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:25:12] [INFO ] Deduced a trap composed of 197 places in 209 ms of which 4 ms to minimize.
[2024-06-01 13:25:12] [INFO ] Deduced a trap composed of 201 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:25:12] [INFO ] Deduced a trap composed of 369 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:25:13] [INFO ] Deduced a trap composed of 372 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:25:13] [INFO ] Deduced a trap composed of 314 places in 274 ms of which 3 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 331 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 320 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 322 places in 218 ms of which 4 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 329 places in 235 ms of which 4 ms to minimize.
[2024-06-01 13:25:15] [INFO ] Deduced a trap composed of 348 places in 235 ms of which 4 ms to minimize.
[2024-06-01 13:25:15] [INFO ] Deduced a trap composed of 333 places in 275 ms of which 3 ms to minimize.
[2024-06-01 13:25:15] [INFO ] Deduced a trap composed of 332 places in 199 ms of which 3 ms to minimize.
SMT process timed out in 31316ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 31338ms
Starting structural reductions in LTL mode, iteration 1 : 612/614 places, 1114/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74551 ms. Remains : 612/614 places, 1114/1114 transitions.
Support contains 571 out of 612 places after structural reductions.
[2024-06-01 13:25:15] [INFO ] Flatten gal took : 96 ms
[2024-06-01 13:25:16] [INFO ] Flatten gal took : 84 ms
[2024-06-01 13:25:16] [INFO ] Input system was already deterministic with 1114 transitions.
Support contains 563 out of 612 places (down from 571) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 66 to 63
RANDOM walk for 40000 steps (12 resets) in 1461 ms. (27 steps per ms) remains 12/63 properties
BEST_FIRST walk for 40004 steps (9 resets) in 629 ms. (63 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 393 ms. (101 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (10 resets) in 460 ms. (86 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 505 ms. (79 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 374 ms. (106 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 404 ms. (98 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (11 resets) in 322 ms. (123 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (9 resets) in 304 ms. (131 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 412 ms. (96 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 422 ms. (94 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (13 resets) in 316 ms. (126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 359 ms. (111 steps per ms) remains 12/12 properties
[2024-06-01 13:25:18] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 13:25:18] [INFO ] Invariant cache hit.
[2024-06-01 13:25:18] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 323/544 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp55 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 3/17 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/545 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 7 (OVERLAPS) 59/604 variables, 23/41 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/41 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6/610 variables, 6/47 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/47 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1098/1708 variables, 610/657 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1708 variables, 96/753 constraints. Problems are: Problem set: 8 solved, 4 unsolved
[2024-06-01 13:25:20] [INFO ] Deduced a trap composed of 381 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:25:20] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1708 variables, 2/755 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1708 variables, 0/755 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/1710 variables, 2/757 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1710 variables, 1/758 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1710/1710 variables, and 758 constraints, problems are : Problem set: 8 solved, 4 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 612/612 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 8 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 463/523 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 2/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/525 variables, 2/8 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 79/604 variables, 33/41 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 2/43 constraints. Problems are: Problem set: 8 solved, 4 unsolved
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 65 places in 303 ms of which 3 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 324 places in 209 ms of which 4 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:25:25] [INFO ] Deduced a trap composed of 284 places in 205 ms of which 4 ms to minimize.
[2024-06-01 13:25:25] [INFO ] Deduced a trap composed of 315 places in 200 ms of which 4 ms to minimize.
[2024-06-01 13:25:25] [INFO ] Deduced a trap composed of 315 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:25:25] [INFO ] Deduced a trap composed of 329 places in 197 ms of which 4 ms to minimize.
[2024-06-01 13:25:25] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 66 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 11/54 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 0/54 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/610 variables, 6/60 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/60 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1098/1708 variables, 610/670 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1710 variables, and 766 constraints, problems are : Problem set: 8 solved, 4 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 610/612 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 13/13 constraints]
After SMT, in 10142ms problems are : Problem set: 8 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 612 transition count 1074
Reduce places removed 40 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 56 rules applied. Total rules applied 96 place count 572 transition count 1058
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 112 place count 556 transition count 1058
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 112 place count 556 transition count 994
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 240 place count 492 transition count 994
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 336 place count 444 transition count 946
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 352 place count 444 transition count 930
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 368 place count 428 transition count 930
Applied a total of 368 rules in 173 ms. Remains 428 /612 variables (removed 184) and now considering 930/1114 (removed 184) transitions.
Running 928 sub problems to find dead transitions.
[2024-06-01 13:25:28] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
// Phase 1: matrix 914 rows 428 cols
[2024-06-01 13:25:28] [INFO ] Computed 48 invariants in 31 ms
[2024-06-01 13:25:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:25:35] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:25:35] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:25:35] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:25:35] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:25:35] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:25:35] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:25:35] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:25:35] [INFO ] Deduced a trap composed of 181 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:25:35] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:25:36] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:25:36] [INFO ] Deduced a trap composed of 148 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:25:38] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:25:45] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:25:48] [INFO ] Deduced a trap composed of 173 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:25:49] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1342 variables, and 61 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 56 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 83 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/1342 variables, and 64 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 18/18 constraints]
After SMT, in 41548ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41559ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41734 ms. Remains : 428/612 places, 930/1114 transitions.
RANDOM walk for 40000 steps (16 resets) in 465 ms. (85 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (9 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 164255 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 4
Probabilistic random walk after 164255 steps, saw 96487 distinct states, run finished after 3004 ms. (steps per millisecond=54 ) properties seen :0
[2024-06-01 13:26:13] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:26:13] [INFO ] Invariant cache hit.
[2024-06-01 13:26:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 313/381 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/392 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/425 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/426 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 914/1340 variables, 426/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1340 variables, 96/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1340 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/1342 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1342 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1342 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1342/1342 variables, and 572 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1904 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 428/428 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 313/381 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 13:26:15] [INFO ] Deduced a trap composed of 204 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 194 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/392 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 33/425 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 3 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 914/1340 variables, 426/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1340 variables, 96/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1340 variables, 4/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 13:26:27] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1340 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1340 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/1342 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 46937ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1344 ms.
Support contains 60 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 930/930 transitions.
Applied a total of 0 rules in 19 ms. Remains 428 /428 variables (removed 0) and now considering 930/930 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 428/428 places, 930/930 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 930/930 transitions.
Applied a total of 0 rules in 32 ms. Remains 428 /428 variables (removed 0) and now considering 930/930 (removed 0) transitions.
[2024-06-01 13:27:02] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:27:02] [INFO ] Invariant cache hit.
[2024-06-01 13:27:02] [INFO ] Implicit Places using invariants in 300 ms returned [382, 383, 384, 385, 386, 387, 388, 389]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 303 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 420/428 places, 930/930 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 412 transition count 922
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 412 transition count 922
Applied a total of 16 rules in 27 ms. Remains 412 /420 variables (removed 8) and now considering 922/930 (removed 8) transitions.
[2024-06-01 13:27:02] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
// Phase 1: matrix 906 rows 412 cols
[2024-06-01 13:27:02] [INFO ] Computed 40 invariants in 19 ms
[2024-06-01 13:27:02] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-06-01 13:27:02] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-06-01 13:27:02] [INFO ] Invariant cache hit.
[2024-06-01 13:27:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:27:08] [INFO ] Implicit Places using invariants and state equation in 5976 ms returned []
Implicit Place search using SMT with State Equation took 6247 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 412/428 places, 922/930 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6610 ms. Remains : 412/428 places, 922/930 transitions.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
[2024-06-01 13:27:08] [INFO ] Flatten gal took : 78 ms
[2024-06-01 13:27:08] [INFO ] Flatten gal took : 82 ms
[2024-06-01 13:27:09] [INFO ] Input system was already deterministic with 1114 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 39 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:27:09] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-06-01 13:27:09] [INFO ] Computed 48 invariants in 36 ms
[2024-06-01 13:27:09] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 328 places in 256 ms of which 5 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 316 places in 249 ms of which 5 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 327 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 320 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 183 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 327 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 379 places in 237 ms of which 5 ms to minimize.
[2024-06-01 13:27:24] [INFO ] Deduced a trap composed of 313 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:27:24] [INFO ] Deduced a trap composed of 388 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:27:24] [INFO ] Deduced a trap composed of 301 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:27:24] [INFO ] Deduced a trap composed of 314 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:27:25] [INFO ] Deduced a trap composed of 324 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:27:25] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:27:26] [INFO ] Deduced a trap composed of 356 places in 251 ms of which 5 ms to minimize.
[2024-06-01 13:27:30] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 69 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 23/69 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:27:41] [INFO ] Deduced a trap composed of 294 places in 250 ms of which 7 ms to minimize.
[2024-06-01 13:27:41] [INFO ] Deduced a trap composed of 314 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:27:44] [INFO ] Deduced a trap composed of 365 places in 239 ms of which 4 ms to minimize.
[2024-06-01 13:27:44] [INFO ] Deduced a trap composed of 409 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:27:45] [INFO ] Deduced a trap composed of 318 places in 216 ms of which 4 ms to minimize.
[2024-06-01 13:27:45] [INFO ] Deduced a trap composed of 347 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:27:46] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 76 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 30/30 constraints]
After SMT, in 41284ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41296ms
Finished structural reductions in LTL mode , in 1 iterations and 41339 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 13:27:50] [INFO ] Flatten gal took : 67 ms
[2024-06-01 13:27:50] [INFO ] Flatten gal took : 55 ms
[2024-06-01 13:27:50] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 59 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:27:50] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:27:50] [INFO ] Invariant cache hit.
[2024-06-01 13:27:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:28:02] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:28:04] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 4 ms to minimize.
[2024-06-01 13:28:04] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:28:04] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:28:04] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:28:04] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:28:04] [INFO ] Deduced a trap composed of 63 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:28:04] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:28:04] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:28:05] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:28:07] [INFO ] Deduced a trap composed of 347 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:28:07] [INFO ] Deduced a trap composed of 338 places in 260 ms of which 3 ms to minimize.
[2024-06-01 13:28:07] [INFO ] Deduced a trap composed of 276 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:28:07] [INFO ] Deduced a trap composed of 300 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:28:08] [INFO ] Deduced a trap composed of 340 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:28:08] [INFO ] Deduced a trap composed of 315 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:28:08] [INFO ] Deduced a trap composed of 323 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:28:13] [INFO ] Deduced a trap composed of 148 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:28:13] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:28:14] [INFO ] Deduced a trap composed of 180 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:28:14] [INFO ] Deduced a trap composed of 185 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:28:14] [INFO ] Deduced a trap composed of 293 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:28:22] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:28:25] [INFO ] Deduced a trap composed of 305 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:28:26] [INFO ] Deduced a trap composed of 414 places in 296 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 71 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 25/25 constraints]
After SMT, in 41249ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41261ms
Finished structural reductions in LTL mode , in 1 iterations and 41323 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 13:28:32] [INFO ] Flatten gal took : 35 ms
[2024-06-01 13:28:32] [INFO ] Flatten gal took : 38 ms
[2024-06-01 13:28:32] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 18 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:28:32] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:28:32] [INFO ] Invariant cache hit.
[2024-06-01 13:28:32] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:28:44] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:28:46] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:28:46] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:28:46] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:28:46] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:28:46] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:28:46] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:28:47] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:28:47] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:28:48] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:28:49] [INFO ] Deduced a trap composed of 347 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:28:49] [INFO ] Deduced a trap composed of 338 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 276 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 340 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 315 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 323 places in 229 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:28:54] [INFO ] Deduced a trap composed of 148 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:28:55] [INFO ] Deduced a trap composed of 167 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:28:55] [INFO ] Deduced a trap composed of 180 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:28:55] [INFO ] Deduced a trap composed of 185 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:28:56] [INFO ] Deduced a trap composed of 293 places in 266 ms of which 5 ms to minimize.
[2024-06-01 13:29:03] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:29:06] [INFO ] Deduced a trap composed of 305 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 414 places in 269 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:29:13] [INFO ] Deduced a trap composed of 355 places in 267 ms of which 4 ms to minimize.
SMT process timed out in 41329ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41340ms
Finished structural reductions in LTL mode , in 1 iterations and 41361 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 13:29:13] [INFO ] Flatten gal took : 44 ms
[2024-06-01 13:29:13] [INFO ] Flatten gal took : 44 ms
[2024-06-01 13:29:13] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 18 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:29:13] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:29:13] [INFO ] Invariant cache hit.
[2024-06-01 13:29:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:29:24] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:29:26] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:29:27] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:29:27] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:29:27] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:29:27] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:29:27] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 2 ms to minimize.
[2024-06-01 13:29:27] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:29:27] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:29:28] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:29:30] [INFO ] Deduced a trap composed of 347 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:29:30] [INFO ] Deduced a trap composed of 338 places in 233 ms of which 4 ms to minimize.
[2024-06-01 13:29:30] [INFO ] Deduced a trap composed of 276 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:29:31] [INFO ] Deduced a trap composed of 300 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:29:31] [INFO ] Deduced a trap composed of 340 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:29:31] [INFO ] Deduced a trap composed of 315 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:29:32] [INFO ] Deduced a trap composed of 323 places in 233 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:29:36] [INFO ] Deduced a trap composed of 148 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:29:36] [INFO ] Deduced a trap composed of 167 places in 203 ms of which 4 ms to minimize.
[2024-06-01 13:29:37] [INFO ] Deduced a trap composed of 180 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:29:37] [INFO ] Deduced a trap composed of 185 places in 208 ms of which 4 ms to minimize.
[2024-06-01 13:29:37] [INFO ] Deduced a trap composed of 293 places in 287 ms of which 5 ms to minimize.
[2024-06-01 13:29:45] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 3 ms to minimize.
[2024-06-01 13:29:48] [INFO ] Deduced a trap composed of 305 places in 256 ms of which 5 ms to minimize.
[2024-06-01 13:29:49] [INFO ] Deduced a trap composed of 414 places in 266 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:29:54] [INFO ] Deduced a trap composed of 355 places in 268 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 72 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 41132ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41144ms
Finished structural reductions in LTL mode , in 1 iterations and 41165 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 13:29:54] [INFO ] Flatten gal took : 31 ms
[2024-06-01 13:29:55] [INFO ] Flatten gal took : 34 ms
[2024-06-01 13:29:55] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 18 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:29:55] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:29:55] [INFO ] Invariant cache hit.
[2024-06-01 13:29:55] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:30:05] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 63 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 63 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:30:08] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:30:08] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:30:10] [INFO ] Deduced a trap composed of 347 places in 265 ms of which 5 ms to minimize.
[2024-06-01 13:30:10] [INFO ] Deduced a trap composed of 338 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:30:10] [INFO ] Deduced a trap composed of 276 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:30:10] [INFO ] Deduced a trap composed of 300 places in 283 ms of which 5 ms to minimize.
[2024-06-01 13:30:11] [INFO ] Deduced a trap composed of 340 places in 299 ms of which 5 ms to minimize.
[2024-06-01 13:30:11] [INFO ] Deduced a trap composed of 315 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:30:11] [INFO ] Deduced a trap composed of 323 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:30:15] [INFO ] Deduced a trap composed of 185 places in 275 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 9.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:30:18] [INFO ] Deduced a trap composed of 280 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:30:25] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:30:30] [INFO ] Deduced a trap composed of 180 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:30:31] [INFO ] Deduced a trap composed of 311 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:30:34] [INFO ] Deduced a trap composed of 321 places in 255 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(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 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(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 9)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 0)
(s350 2)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(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 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 1)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 1)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 3)
(s529 0)
(s530 0)
(s531 1)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 69 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints]
After SMT, in 41198ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41208ms
Finished structural reductions in LTL mode , in 1 iterations and 41228 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 13:30:36] [INFO ] Flatten gal took : 85 ms
[2024-06-01 13:30:36] [INFO ] Flatten gal took : 59 ms
[2024-06-01 13:30:36] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Applied a total of 16 rules in 15 ms. Remains 604 /612 variables (removed 8) and now considering 1106/1114 (removed 8) transitions.
Running 1104 sub problems to find dead transitions.
[2024-06-01 13:30:36] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 604 cols
[2024-06-01 13:30:36] [INFO ] Computed 48 invariants in 17 ms
[2024-06-01 13:30:36] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:30:48] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:30:48] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:30:49] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:30:49] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:30:49] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:30:49] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:30:50] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 3 ms to minimize.
[2024-06-01 13:30:52] [INFO ] Deduced a trap composed of 337 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:30:52] [INFO ] Deduced a trap composed of 299 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:30:52] [INFO ] Deduced a trap composed of 329 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:30:52] [INFO ] Deduced a trap composed of 367 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:30:53] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:30:53] [INFO ] Deduced a trap composed of 342 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:30:53] [INFO ] Deduced a trap composed of 350 places in 189 ms of which 5 ms to minimize.
[2024-06-01 13:30:53] [INFO ] Deduced a trap composed of 333 places in 257 ms of which 5 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 322 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 319 places in 233 ms of which 4 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 316 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:30:55] [INFO ] Deduced a trap composed of 300 places in 233 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-06-01 13:30:56] [INFO ] Deduced a trap composed of 156 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:30:56] [INFO ] Deduced a trap composed of 176 places in 210 ms of which 4 ms to minimize.
[2024-06-01 13:30:56] [INFO ] Deduced a trap composed of 195 places in 233 ms of which 4 ms to minimize.
[2024-06-01 13:30:56] [INFO ] Deduced a trap composed of 146 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:30:57] [INFO ] Deduced a trap composed of 297 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:30:57] [INFO ] Deduced a trap composed of 190 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:30:57] [INFO ] Deduced a trap composed of 302 places in 275 ms of which 4 ms to minimize.
SMT process timed out in 21356ms, After SMT, problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 21369ms
Finished structural reductions in LTL mode , in 1 iterations and 21386 ms. Remains : 604/612 places, 1106/1114 transitions.
[2024-06-01 13:30:57] [INFO ] Flatten gal took : 66 ms
[2024-06-01 13:30:58] [INFO ] Flatten gal took : 57 ms
[2024-06-01 13:30:58] [INFO ] Input system was already deterministic with 1106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Applied a total of 0 rules in 5 ms. Remains 612 /612 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-06-01 13:30:58] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-06-01 13:30:58] [INFO ] Computed 48 invariants in 21 ms
[2024-06-01 13:30:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 13:31:10] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:31:10] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:31:10] [INFO ] Deduced a trap composed of 65 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:31:10] [INFO ] Deduced a trap composed of 65 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:31:10] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 66 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 300 places in 266 ms of which 5 ms to minimize.
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 312 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 322 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 318 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:31:18] [INFO ] Deduced a trap composed of 310 places in 238 ms of which 6 ms to minimize.
[2024-06-01 13:31:19] [INFO ] Deduced a trap composed of 339 places in 231 ms of which 5 ms to minimize.
[2024-06-01 13:31:19] [INFO ] Deduced a trap composed of 327 places in 211 ms of which 3 ms to minimize.
SMT process timed out in 21339ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 21352ms
Finished structural reductions in LTL mode , in 1 iterations and 21361 ms. Remains : 612/612 places, 1114/1114 transitions.
[2024-06-01 13:31:19] [INFO ] Flatten gal took : 27 ms
[2024-06-01 13:31:19] [INFO ] Flatten gal took : 30 ms
[2024-06-01 13:31:19] [INFO ] Input system was already deterministic with 1114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 16 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:31:19] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-06-01 13:31:19] [INFO ] Computed 48 invariants in 17 ms
[2024-06-01 13:31:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:31:30] [INFO ] Deduced a trap composed of 328 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:31:30] [INFO ] Deduced a trap composed of 316 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:31:30] [INFO ] Deduced a trap composed of 327 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:31:31] [INFO ] Deduced a trap composed of 320 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:31:31] [INFO ] Deduced a trap composed of 302 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:31:31] [INFO ] Deduced a trap composed of 183 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:31:33] [INFO ] Deduced a trap composed of 327 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:31:33] [INFO ] Deduced a trap composed of 379 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:31:33] [INFO ] Deduced a trap composed of 313 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:31:33] [INFO ] Deduced a trap composed of 388 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:31:34] [INFO ] Deduced a trap composed of 301 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:31:34] [INFO ] Deduced a trap composed of 314 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:31:34] [INFO ] Deduced a trap composed of 324 places in 244 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:31:34] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:31:35] [INFO ] Deduced a trap composed of 356 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:31:39] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 69 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 23/69 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:31:51] [INFO ] Deduced a trap composed of 294 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:31:51] [INFO ] Deduced a trap composed of 314 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 365 places in 313 ms of which 4 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 409 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 318 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:31:55] [INFO ] Deduced a trap composed of 347 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:31:56] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 76 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 30/30 constraints]
After SMT, in 41149ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41159ms
Finished structural reductions in LTL mode , in 1 iterations and 41177 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 13:32:00] [INFO ] Flatten gal took : 56 ms
[2024-06-01 13:32:00] [INFO ] Flatten gal took : 45 ms
[2024-06-01 13:32:00] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 18 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:32:01] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:32:01] [INFO ] Invariant cache hit.
[2024-06-01 13:32:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:32:13] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 63 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:32:15] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:32:16] [INFO ] Deduced a trap composed of 347 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 338 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 276 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 300 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 340 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 315 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 323 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 185 places in 243 ms of which 4 ms to minimize.
SMT process timed out in 21308ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 21320ms
Finished structural reductions in LTL mode , in 1 iterations and 21342 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 13:32:22] [INFO ] Flatten gal took : 37 ms
[2024-06-01 13:32:22] [INFO ] Flatten gal took : 39 ms
[2024-06-01 13:32:22] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 19 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:32:22] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:32:22] [INFO ] Invariant cache hit.
[2024-06-01 13:32:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:32:33] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:32:35] [INFO ] Deduced a trap composed of 63 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:32:35] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:32:35] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 347 places in 270 ms of which 3 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 338 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 276 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 300 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:32:40] [INFO ] Deduced a trap composed of 340 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:32:40] [INFO ] Deduced a trap composed of 315 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:32:40] [INFO ] Deduced a trap composed of 323 places in 268 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 148 places in 218 ms of which 4 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 167 places in 212 ms of which 4 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 180 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 185 places in 216 ms of which 4 ms to minimize.
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 293 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:32:52] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 305 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 414 places in 274 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:33:01] [INFO ] Deduced a trap composed of 355 places in 274 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 72 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 41069ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41081ms
Finished structural reductions in LTL mode , in 1 iterations and 41103 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 13:33:03] [INFO ] Flatten gal took : 37 ms
[2024-06-01 13:33:03] [INFO ] Flatten gal took : 40 ms
[2024-06-01 13:33:03] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 17 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:33:03] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:33:03] [INFO ] Invariant cache hit.
[2024-06-01 13:33:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:33:14] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 63 places in 182 ms of which 3 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 63 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 347 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 338 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 276 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 300 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 340 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 315 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 323 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 185 places in 262 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 280 places in 264 ms of which 5 ms to minimize.
[2024-06-01 13:33:34] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:33:39] [INFO ] Deduced a trap composed of 180 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:33:40] [INFO ] Deduced a trap composed of 311 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:33:43] [INFO ] Deduced a trap composed of 321 places in 286 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 69 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints]
After SMT, in 41083ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41094ms
Finished structural reductions in LTL mode , in 1 iterations and 41114 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 13:33:44] [INFO ] Flatten gal took : 40 ms
[2024-06-01 13:33:44] [INFO ] Flatten gal took : 42 ms
[2024-06-01 13:33:45] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 16 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:33:45] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:33:45] [INFO ] Invariant cache hit.
[2024-06-01 13:33:45] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:33:58] [INFO ] Deduced a trap composed of 63 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:33:58] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:33:59] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:33:59] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:33:59] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:33:59] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:33:59] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:33:59] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:34:00] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:34:01] [INFO ] Deduced a trap composed of 347 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 338 places in 262 ms of which 5 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 276 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 300 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:34:03] [INFO ] Deduced a trap composed of 340 places in 249 ms of which 4 ms to minimize.
[2024-06-01 13:34:03] [INFO ] Deduced a trap composed of 315 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:34:03] [INFO ] Deduced a trap composed of 323 places in 253 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:34:07] [INFO ] Deduced a trap composed of 148 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:34:08] [INFO ] Deduced a trap composed of 167 places in 209 ms of which 4 ms to minimize.
[2024-06-01 13:34:08] [INFO ] Deduced a trap composed of 180 places in 217 ms of which 4 ms to minimize.
[2024-06-01 13:34:08] [INFO ] Deduced a trap composed of 185 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:34:09] [INFO ] Deduced a trap composed of 293 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 305 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:34:20] [INFO ] Deduced a trap composed of 414 places in 288 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:34:25] [INFO ] Deduced a trap composed of 355 places in 256 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 72 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 41217ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41231ms
Finished structural reductions in LTL mode , in 1 iterations and 41250 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 13:34:26] [INFO ] Flatten gal took : 27 ms
[2024-06-01 13:34:26] [INFO ] Flatten gal took : 29 ms
[2024-06-01 13:34:26] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 15 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:34:26] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:34:26] [INFO ] Invariant cache hit.
[2024-06-01 13:34:26] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:34:37] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 63 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 63 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 63 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 63 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 63 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:34:41] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:34:43] [INFO ] Deduced a trap composed of 347 places in 334 ms of which 5 ms to minimize.
[2024-06-01 13:34:43] [INFO ] Deduced a trap composed of 338 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:34:43] [INFO ] Deduced a trap composed of 276 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:34:44] [INFO ] Deduced a trap composed of 300 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:34:44] [INFO ] Deduced a trap composed of 340 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:34:44] [INFO ] Deduced a trap composed of 315 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:34:44] [INFO ] Deduced a trap composed of 323 places in 232 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 148 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 167 places in 210 ms of which 4 ms to minimize.
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 180 places in 210 ms of which 4 ms to minimize.
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 185 places in 210 ms of which 4 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 293 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:34:57] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:35:00] [INFO ] Deduced a trap composed of 305 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:35:01] [INFO ] Deduced a trap composed of 414 places in 290 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:35:06] [INFO ] Deduced a trap composed of 355 places in 234 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 72 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 41215ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41224ms
Finished structural reductions in LTL mode , in 1 iterations and 41241 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 13:35:07] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:35:07] [INFO ] Flatten gal took : 40 ms
[2024-06-01 13:35:07] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Applied a total of 0 rules in 6 ms. Remains 612 /612 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-06-01 13:35:07] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-06-01 13:35:07] [INFO ] Computed 48 invariants in 28 ms
[2024-06-01 13:35:07] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 1 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 65 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 65 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:35:22] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:35:23] [INFO ] Deduced a trap composed of 300 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:35:27] [INFO ] Deduced a trap composed of 312 places in 257 ms of which 5 ms to minimize.
[2024-06-01 13:35:27] [INFO ] Deduced a trap composed of 322 places in 312 ms of which 4 ms to minimize.
[2024-06-01 13:35:27] [INFO ] Deduced a trap composed of 318 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:35:28] [INFO ] Deduced a trap composed of 310 places in 290 ms of which 7 ms to minimize.
[2024-06-01 13:35:29] [INFO ] Deduced a trap composed of 339 places in 242 ms of which 5 ms to minimize.
SMT process timed out in 21299ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 21311ms
Finished structural reductions in LTL mode , in 1 iterations and 21319 ms. Remains : 612/612 places, 1114/1114 transitions.
[2024-06-01 13:35:29] [INFO ] Flatten gal took : 27 ms
[2024-06-01 13:35:29] [INFO ] Flatten gal took : 30 ms
[2024-06-01 13:35:29] [INFO ] Input system was already deterministic with 1114 transitions.
[2024-06-01 13:35:29] [INFO ] Flatten gal took : 39 ms
[2024-06-01 13:35:29] [INFO ] Flatten gal took : 39 ms
[2024-06-01 13:35:29] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 19 ms.
[2024-06-01 13:35:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 612 places, 1114 transitions and 4818 arcs took 6 ms.
Total runtime 699267 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-S02J04T08-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-CTLFireability-2024-15

BK_STOP 1717248929925

--------------------
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-S02J04T08-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/2040/ctl_0_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/2040/ctl_1_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/2040/ctl_2_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/2040/ctl_3_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/2040/ctl_4_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/2040/ctl_5_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/2040/ctl_6_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/2040/ctl_7_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/2040/ctl_8_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/2040/ctl_9_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/2040/ctl_10_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/2040/ctl_11_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/2040/ctl_12_
ctl formula name PolyORBLF-COL-S02J04T08-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/2040/ctl_13_
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-S02J04T08"
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-S02J04T08, 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-171654446300082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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