Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716877814338

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:30:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 06:30:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:30:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 06:30:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 06:30:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 792 ms
[2024-05-28 06:30:17] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
[2024-05-28 06:30:17] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2024-05-28 06:30:17] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40006 steps (3203 resets) in 1481 ms. (26 steps per ms) remains 22/44 properties
BEST_FIRST walk for 4002 steps (89 resets) in 113 ms. (35 steps per ms) remains 7/22 properties
BEST_FIRST walk for 4001 steps (101 resets) in 70 ms. (56 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000 steps (137 resets) in 78 ms. (50 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4001 steps (109 resets) in 91 ms. (43 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4003 steps (80 resets) in 120 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4004 steps (156 resets) in 71 ms. (55 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4004 steps (105 resets) in 75 ms. (52 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4003 steps (103 resets) in 73 ms. (54 steps per ms) remains 7/7 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 06:30:18] [INFO ] Computed 13 invariants in 5 ms
[2024-05-28 06:30:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 8/31 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp42 is UNSAT
After SMT solving in domain Real declared 47/86 variables, and 12 constraints, problems are : Problem set: 7 solved, 0 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
[2024-05-28 06:30:18] [INFO ] Flatten gal took : 22 ms
[2024-05-28 06:30:18] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 06:30:18] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 60 ms.
[2024-05-28 06:30:18] [INFO ] Unfolded 16 HLPN properties in 2 ms.
[2024-05-28 06:30:18] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 06:30:18] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 06:30:18] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 06:30:18] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 06:30:18] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 06:30:18] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 06:30:18] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 06:30:18] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 06:30:18] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 06:30:18] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 06:30:18] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 06:30:18] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 06:30:18] [INFO ] Reduced 90 identical enabling conditions.
Deduced a syphon composed of 60 places in 16 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 909 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Applied a total of 0 rules in 19 ms. Remains 909 /909 variables (removed 0) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2024-05-28 06:30:18] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-28 06:30:18] [INFO ] Computed 142 invariants in 105 ms
[2024-05-28 06:30:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2220 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 126/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2220 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 44148ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 44175ms
[2024-05-28 06:31:02] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 06:31:02] [INFO ] Invariant cache hit.
[2024-05-28 06:31:03] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-28 06:31:03] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 06:31:03] [INFO ] Invariant cache hit.
[2024-05-28 06:31:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:31:03] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2024-05-28 06:31:03] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 06:31:03] [INFO ] Invariant cache hit.
[2024-05-28 06:31:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD556 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 9/907 variables, 9/140 constraints. Problems are: Problem set: 78 solved, 1231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/2220 variables, and 140 constraints, problems are : Problem set: 78 solved, 1231 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 1231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 78 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 78 solved, 1231 unsolved
[2024-05-28 06:31:45] [INFO ] Deduced a trap composed of 14 places in 311 ms of which 39 ms to minimize.
[2024-05-28 06:31:46] [INFO ] Deduced a trap composed of 12 places in 384 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 2/133 constraints. Problems are: Problem set: 78 solved, 1231 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2220 variables, and 133 constraints, problems are : Problem set: 78 solved, 1231 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 2/2 constraints]
After SMT, in 63490ms problems are : Problem set: 78 solved, 1231 unsolved
Search for dead transitions found 78 dead transitions in 63514ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in LTL mode, iteration 1 : 909/909 places, 1237/1315 transitions.
Applied a total of 0 rules in 8 ms. Remains 909 /909 variables (removed 0) and now considering 1237/1237 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108653 ms. Remains : 909/909 places, 1237/1315 transitions.
Support contains 909 out of 909 places after structural reductions.
[2024-05-28 06:32:07] [INFO ] Flatten gal took : 273 ms
[2024-05-28 06:32:08] [INFO ] Flatten gal took : 124 ms
[2024-05-28 06:32:08] [INFO ] Input system was already deterministic with 1237 transitions.
Reduction of identical properties reduced properties to check from 60 to 58
RANDOM walk for 40000 steps (2748 resets) in 1682 ms. (23 steps per ms) remains 10/58 properties
BEST_FIRST walk for 40004 steps (265 resets) in 1921 ms. (20 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1015 resets) in 296 ms. (134 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (512 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (249 resets) in 585 ms. (68 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1024 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (537 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1212 resets) in 277 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (496 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (463 resets) in 228 ms. (174 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (111 resets) in 484 ms. (82 steps per ms) remains 10/10 properties
[2024-05-28 06:32:11] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
// Phase 1: matrix 1233 rows 909 cols
[2024-05-28 06:32:11] [INFO ] Computed 142 invariants in 63 ms
[2024-05-28 06:32:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp49 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
At refinement iteration 1 (OVERLAPS) 628/902 variables, 134/134 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/902 variables, 1/135 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/902 variables, 0/135 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 4 (OVERLAPS) 6/908 variables, 6/141 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/908 variables, 0/141 constraints. Problems are: Problem set: 9 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/909 variables, 1/142 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/909 variables, 0/142 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1233/2142 variables, 909/1051 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2142 variables, 1/1052 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2142 variables, 0/1052 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2142 variables, 0/1052 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2142/2142 variables, and 1052 constraints, problems are : Problem set: 9 solved, 1 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 449/450 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/574 variables, 63/65 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/65 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 305/879 variables, 61/126 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/126 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/895 variables, 8/134 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/895 variables, 0/134 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/907 variables, 7/141 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/907 variables, 0/141 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/908 variables, 1/142 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/908 variables, 0/142 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1233/2141 variables, 908/1050 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2141 variables, 1/1051 constraints. Problems are: Problem set: 9 solved, 1 unsolved
[2024-05-28 06:32:14] [INFO ] Deduced a trap composed of 372 places in 496 ms of which 7 ms to minimize.
[2024-05-28 06:32:15] [INFO ] Deduced a trap composed of 366 places in 400 ms of which 8 ms to minimize.
[2024-05-28 06:32:15] [INFO ] Deduced a trap composed of 366 places in 326 ms of which 5 ms to minimize.
[2024-05-28 06:32:15] [INFO ] Deduced a trap composed of 372 places in 388 ms of which 5 ms to minimize.
[2024-05-28 06:32:16] [INFO ] Deduced a trap composed of 393 places in 393 ms of which 10 ms to minimize.
[2024-05-28 06:32:16] [INFO ] Deduced a trap composed of 384 places in 409 ms of which 7 ms to minimize.
[2024-05-28 06:32:17] [INFO ] Deduced a trap composed of 390 places in 458 ms of which 6 ms to minimize.
[2024-05-28 06:32:17] [INFO ] Deduced a trap composed of 384 places in 397 ms of which 5 ms to minimize.
[2024-05-28 06:32:18] [INFO ] Deduced a trap composed of 372 places in 400 ms of which 6 ms to minimize.
SMT process timed out in 6983ms, After SMT, problems are : Problem set: 9 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1171
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1105
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1103
Applied a total of 273 rules in 227 ms. Remains 770 /909 variables (removed 139) and now considering 1103/1237 (removed 134) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:32:18] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 06:32:18] [INFO ] Computed 137 invariants in 27 ms
[2024-05-28 06:32:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:32:31] [INFO ] Deduced a trap composed of 239 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:32:31] [INFO ] Deduced a trap composed of 233 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:32:31] [INFO ] Deduced a trap composed of 227 places in 307 ms of which 5 ms to minimize.
[2024-05-28 06:32:32] [INFO ] Deduced a trap composed of 236 places in 277 ms of which 4 ms to minimize.
[2024-05-28 06:32:32] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 5 ms to minimize.
[2024-05-28 06:32:32] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 5 ms to minimize.
[2024-05-28 06:32:33] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 7 ms to minimize.
[2024-05-28 06:32:33] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:32:33] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 4 ms to minimize.
[2024-05-28 06:32:34] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:32:34] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 5 ms to minimize.
[2024-05-28 06:32:34] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:32:35] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:32:35] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:32:35] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:32:36] [INFO ] Deduced a trap composed of 196 places in 330 ms of which 5 ms to minimize.
[2024-05-28 06:32:36] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 5 ms to minimize.
[2024-05-28 06:32:36] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:32:36] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 6 ms to minimize.
[2024-05-28 06:32:37] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:32:37] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 5 ms to minimize.
[2024-05-28 06:32:38] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-05-28 06:32:38] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 06:32:39] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 5 ms to minimize.
[2024-05-28 06:32:39] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 5 ms to minimize.
[2024-05-28 06:32:39] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 5 ms to minimize.
[2024-05-28 06:32:39] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2024-05-28 06:32:40] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:32:40] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 5 ms to minimize.
[2024-05-28 06:32:40] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:32:40] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
SMT process timed out in 22448ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22461ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22693 ms. Remains : 770/909 places, 1103/1237 transitions.
RANDOM walk for 40000 steps (2091 resets) in 1021 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (130 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 345887 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 345887 steps, saw 105227 distinct states, run finished after 3004 ms. (steps per millisecond=115 ) properties seen :0
[2024-05-28 06:32:44] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:32:44] [INFO ] Invariant cache hit.
[2024-05-28 06:32:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:32:46] [INFO ] Deduced a trap composed of 152 places in 379 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2176ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 82 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 49 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 06:32:46] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:32:46] [INFO ] Invariant cache hit.
[2024-05-28 06:32:47] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2024-05-28 06:32:47] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:32:47] [INFO ] Invariant cache hit.
[2024-05-28 06:32:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:32:56] [INFO ] Implicit Places using invariants and state equation in 8490 ms returned []
Implicit Place search using SMT with State Equation took 9540 ms to find 0 implicit places.
[2024-05-28 06:32:56] [INFO ] Redundant transitions in 55 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:32:56] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:32:56] [INFO ] Invariant cache hit.
[2024-05-28 06:32:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:33:09] [INFO ] Deduced a trap composed of 245 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:33:09] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:33:10] [INFO ] Deduced a trap composed of 233 places in 325 ms of which 5 ms to minimize.
[2024-05-28 06:33:10] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 4 ms to minimize.
[2024-05-28 06:33:10] [INFO ] Deduced a trap composed of 230 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:33:11] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:33:11] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:33:11] [INFO ] Deduced a trap composed of 245 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:33:11] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:33:12] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:33:12] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-05-28 06:33:12] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-05-28 06:33:13] [INFO ] Deduced a trap composed of 196 places in 343 ms of which 11 ms to minimize.
[2024-05-28 06:33:13] [INFO ] Deduced a trap composed of 254 places in 323 ms of which 5 ms to minimize.
[2024-05-28 06:33:13] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 5 ms to minimize.
[2024-05-28 06:33:14] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 5 ms to minimize.
[2024-05-28 06:33:14] [INFO ] Deduced a trap composed of 242 places in 348 ms of which 5 ms to minimize.
[2024-05-28 06:33:14] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:33:15] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 3 ms to minimize.
[2024-05-28 06:33:15] [INFO ] Deduced a trap composed of 242 places in 336 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:33:16] [INFO ] Deduced a trap composed of 254 places in 334 ms of which 6 ms to minimize.
[2024-05-28 06:33:16] [INFO ] Deduced a trap composed of 245 places in 282 ms of which 4 ms to minimize.
[2024-05-28 06:33:17] [INFO ] Deduced a trap composed of 248 places in 299 ms of which 5 ms to minimize.
[2024-05-28 06:33:17] [INFO ] Deduced a trap composed of 196 places in 353 ms of which 5 ms to minimize.
[2024-05-28 06:33:17] [INFO ] Deduced a trap composed of 251 places in 283 ms of which 4 ms to minimize.
[2024-05-28 06:33:18] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:33:18] [INFO ] Deduced a trap composed of 233 places in 314 ms of which 5 ms to minimize.
[2024-05-28 06:33:18] [INFO ] Deduced a trap composed of 236 places in 301 ms of which 4 ms to minimize.
[2024-05-28 06:33:19] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:33:19] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 5 ms to minimize.
[2024-05-28 06:33:19] [INFO ] Deduced a trap composed of 260 places in 260 ms of which 4 ms to minimize.
[2024-05-28 06:33:19] [INFO ] Deduced a trap composed of 236 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:33:20] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:33:20] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:33:20] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:33:21] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:33:21] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 10 ms to minimize.
[2024-05-28 06:33:21] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 3 ms to minimize.
[2024-05-28 06:33:21] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:33:22] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 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 2.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 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 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 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 4.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 9.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:33:33] [INFO ] Deduced a trap composed of 200 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:33:33] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:33:33] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:33:34] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:33:34] [INFO ] Deduced a trap composed of 200 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:33:34] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:33:35] [INFO ] Deduced a trap composed of 200 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:33:35] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:33:35] [INFO ] Deduced a trap composed of 200 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:33:35] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:33:36] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:33:36] [INFO ] Deduced a trap composed of 200 places in 274 ms of which 4 ms to minimize.
[2024-05-28 06:33:36] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2024-05-28 06:33:37] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
[2024-05-28 06:33:37] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-05-28 06:33:37] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:33:37] [INFO ] Deduced a trap composed of 200 places in 267 ms of which 3 ms to minimize.
[2024-05-28 06:33:38] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 06:33:38] [INFO ] Deduced a trap composed of 200 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:33:38] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:33:41] [INFO ] Deduced a trap composed of 249 places in 338 ms of which 6 ms to minimize.
[2024-05-28 06:33:42] [INFO ] Deduced a trap composed of 248 places in 318 ms of which 5 ms to minimize.
[2024-05-28 06:33:42] [INFO ] Deduced a trap composed of 237 places in 322 ms of which 5 ms to minimize.
[2024-05-28 06:33:42] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 5 ms to minimize.
[2024-05-28 06:33:42] [INFO ] Deduced a trap composed of 248 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:33:43] [INFO ] Deduced a trap composed of 255 places in 279 ms of which 4 ms to minimize.
[2024-05-28 06:33:43] [INFO ] Deduced a trap composed of 237 places in 217 ms of which 3 ms to minimize.
[2024-05-28 06:33:43] [INFO ] Deduced a trap composed of 248 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:33:44] [INFO ] Deduced a trap composed of 242 places in 214 ms of which 4 ms to minimize.
[2024-05-28 06:33:44] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:33:44] [INFO ] Deduced a trap composed of 254 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:33:45] [INFO ] Deduced a trap composed of 245 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:33:45] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 4 ms to minimize.
[2024-05-28 06:33:46] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-05-28 06:33:46] [INFO ] Deduced a trap composed of 216 places in 331 ms of which 5 ms to minimize.
[2024-05-28 06:33:46] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-05-28 06:33:47] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:33:47] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:33:47] [INFO ] Deduced a trap composed of 261 places in 317 ms of which 4 ms to minimize.
[2024-05-28 06:33:48] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 62585ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62596ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72255 ms. Remains : 770/770 places, 1103/1103 transitions.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-05-28 06:33:58] [INFO ] Flatten gal took : 76 ms
[2024-05-28 06:33:59] [INFO ] Flatten gal took : 96 ms
[2024-05-28 06:33:59] [INFO ] Input system was already deterministic with 1237 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 904 transition count 1174
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 128 place count 841 transition count 1172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 839 transition count 1172
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 839 transition count 1108
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 775 transition count 1108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 262 place count 773 transition count 1106
Applied a total of 262 rules in 89 ms. Remains 773 /909 variables (removed 136) and now considering 1106/1237 (removed 131) transitions.
Running 1100 sub problems to find dead transitions.
[2024-05-28 06:33:59] [INFO ] Flow matrix only has 1102 transitions (discarded 4 similar events)
// Phase 1: matrix 1102 rows 773 cols
[2024-05-28 06:33:59] [INFO ] Computed 137 invariants in 18 ms
[2024-05-28 06:33:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 243 places in 352 ms of which 4 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 198 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:34:14] [INFO ] Deduced a trap composed of 235 places in 278 ms of which 4 ms to minimize.
[2024-05-28 06:34:14] [INFO ] Deduced a trap composed of 199 places in 288 ms of which 4 ms to minimize.
[2024-05-28 06:34:14] [INFO ] Deduced a trap composed of 199 places in 262 ms of which 4 ms to minimize.
[2024-05-28 06:34:15] [INFO ] Deduced a trap composed of 198 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:34:15] [INFO ] Deduced a trap composed of 252 places in 282 ms of which 4 ms to minimize.
[2024-05-28 06:34:15] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:34:16] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:34:16] [INFO ] Deduced a trap composed of 198 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:34:16] [INFO ] Deduced a trap composed of 198 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:34:16] [INFO ] Deduced a trap composed of 249 places in 276 ms of which 4 ms to minimize.
[2024-05-28 06:34:17] [INFO ] Deduced a trap composed of 198 places in 282 ms of which 4 ms to minimize.
[2024-05-28 06:34:17] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:34:17] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 3 ms to minimize.
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 240 places in 311 ms of which 4 ms to minimize.
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 244 places in 286 ms of which 4 ms to minimize.
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 199 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 199 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:34:19] [INFO ] Deduced a trap composed of 199 places in 233 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-28 06:34:19] [INFO ] Deduced a trap composed of 200 places in 228 ms of which 8 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 200 places in 271 ms of which 4 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 200 places in 303 ms of which 4 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 198 places in 284 ms of which 4 ms to minimize.
[2024-05-28 06:34:21] [INFO ] Deduced a trap composed of 198 places in 274 ms of which 4 ms to minimize.
[2024-05-28 06:34:21] [INFO ] Deduced a trap composed of 200 places in 286 ms of which 5 ms to minimize.
[2024-05-28 06:34:21] [INFO ] Deduced a trap composed of 198 places in 248 ms of which 5 ms to minimize.
[2024-05-28 06:34:22] [INFO ] Deduced a trap composed of 198 places in 270 ms of which 4 ms to minimize.
[2024-05-28 06:34:22] [INFO ] Deduced a trap composed of 200 places in 276 ms of which 4 ms to minimize.
SMT process timed out in 22656ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 22667ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22758 ms. Remains : 773/909 places, 1106/1237 transitions.
[2024-05-28 06:34:22] [INFO ] Flatten gal took : 42 ms
[2024-05-28 06:34:22] [INFO ] Flatten gal took : 58 ms
[2024-05-28 06:34:22] [INFO ] Input system was already deterministic with 1106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1236
Applied a total of 7 rules in 56 ms. Remains 903 /909 variables (removed 6) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 06:34:22] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 06:34:22] [INFO ] Computed 137 invariants in 18 ms
[2024-05-28 06:34:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 42877ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42891ms
Finished structural reductions in LTL mode , in 1 iterations and 42962 ms. Remains : 903/909 places, 1236/1237 transitions.
[2024-05-28 06:35:05] [INFO ] Flatten gal took : 51 ms
[2024-05-28 06:35:05] [INFO ] Flatten gal took : 54 ms
[2024-05-28 06:35:05] [INFO ] Input system was already deterministic with 1236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 904 transition count 1235
Reduce places removed 2 places and 0 transitions.
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Iterating post reduction 1 with 63 rules applied. Total rules applied 65 place count 902 transition count 1174
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 126 place count 841 transition count 1174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 126 place count 841 transition count 1172
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 839 transition count 1172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 837 transition count 1170
Applied a total of 134 rules in 87 ms. Remains 837 /909 variables (removed 72) and now considering 1170/1237 (removed 67) transitions.
Running 1164 sub problems to find dead transitions.
[2024-05-28 06:35:05] [INFO ] Flow matrix only has 1166 transitions (discarded 4 similar events)
// Phase 1: matrix 1166 rows 837 cols
[2024-05-28 06:35:06] [INFO ] Computed 137 invariants in 22 ms
[2024-05-28 06:35:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/831 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/831 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 831/2003 variables, and 131 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/837 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1164/1164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/831 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/831 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/831 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 3 (OVERLAPS) 5/836 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 06:35:45] [INFO ] Deduced a trap composed of 301 places in 330 ms of which 5 ms to minimize.
[2024-05-28 06:35:45] [INFO ] Deduced a trap composed of 301 places in 295 ms of which 4 ms to minimize.
[2024-05-28 06:35:45] [INFO ] Deduced a trap composed of 283 places in 315 ms of which 4 ms to minimize.
[2024-05-28 06:35:46] [INFO ] Deduced a trap composed of 295 places in 296 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/2003 variables, and 140 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/837 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1164 constraints, Known Traps: 4/4 constraints]
After SMT, in 42505ms problems are : Problem set: 0 solved, 1164 unsolved
Search for dead transitions found 0 dead transitions in 42519ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42609 ms. Remains : 837/909 places, 1170/1237 transitions.
[2024-05-28 06:35:48] [INFO ] Flatten gal took : 37 ms
[2024-05-28 06:35:48] [INFO ] Flatten gal took : 40 ms
[2024-05-28 06:35:48] [INFO ] Input system was already deterministic with 1170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1237
Applied a total of 5 rules in 13 ms. Remains 904 /909 variables (removed 5) and now considering 1237/1237 (removed 0) transitions.
Running 1231 sub problems to find dead transitions.
[2024-05-28 06:35:48] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
// Phase 1: matrix 1233 rows 904 cols
[2024-05-28 06:35:48] [INFO ] Computed 137 invariants in 17 ms
[2024-05-28 06:35:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2137 variables, and 131 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1231/1231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
[2024-05-28 06:36:19] [INFO ] Deduced a trap composed of 14 places in 250 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2137 variables, and 132 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1231 constraints, Known Traps: 1/1 constraints]
After SMT, in 42444ms problems are : Problem set: 0 solved, 1231 unsolved
Search for dead transitions found 0 dead transitions in 42457ms
Finished structural reductions in LTL mode , in 1 iterations and 42498 ms. Remains : 904/909 places, 1237/1237 transitions.
[2024-05-28 06:36:31] [INFO ] Flatten gal took : 40 ms
[2024-05-28 06:36:31] [INFO ] Flatten gal took : 44 ms
[2024-05-28 06:36:31] [INFO ] Input system was already deterministic with 1237 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1236
Applied a total of 7 rules in 14 ms. Remains 903 /909 variables (removed 6) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 06:36:31] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 06:36:31] [INFO ] Computed 137 invariants in 18 ms
[2024-05-28 06:36:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
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 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 42642ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42654ms
Finished structural reductions in LTL mode , in 1 iterations and 42671 ms. Remains : 903/909 places, 1236/1237 transitions.
[2024-05-28 06:37:14] [INFO ] Flatten gal took : 39 ms
[2024-05-28 06:37:14] [INFO ] Flatten gal took : 43 ms
[2024-05-28 06:37:14] [INFO ] Input system was already deterministic with 1236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1171
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1105
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1103
Applied a total of 268 rules in 68 ms. Remains 770 /909 variables (removed 139) and now considering 1103/1237 (removed 134) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:37:14] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 06:37:14] [INFO ] Computed 137 invariants in 22 ms
[2024-05-28 06:37:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:27] [INFO ] Deduced a trap composed of 239 places in 318 ms of which 5 ms to minimize.
[2024-05-28 06:37:27] [INFO ] Deduced a trap composed of 233 places in 297 ms of which 5 ms to minimize.
[2024-05-28 06:37:27] [INFO ] Deduced a trap composed of 227 places in 288 ms of which 5 ms to minimize.
[2024-05-28 06:37:28] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:37:28] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:37:28] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 5 ms to minimize.
[2024-05-28 06:37:29] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 4 ms to minimize.
[2024-05-28 06:37:29] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:37:29] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-05-28 06:37:29] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:37:30] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 5 ms to minimize.
[2024-05-28 06:37:30] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:37:30] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:37:31] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:37:31] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:37:31] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 5 ms to minimize.
[2024-05-28 06:37:31] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 5 ms to minimize.
[2024-05-28 06:37:32] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 5 ms to minimize.
[2024-05-28 06:37:32] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:37:32] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:33] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:37:33] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:37:34] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:37:34] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 5 ms to minimize.
[2024-05-28 06:37:34] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 06:37:35] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:37:35] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:37:35] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:37:35] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:37:36] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 5 ms to minimize.
[2024-05-28 06:37:36] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 4 ms to minimize.
[2024-05-28 06:37:36] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:37:37] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 4 ms to minimize.
SMT process timed out in 22763ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22774ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22845 ms. Remains : 770/909 places, 1103/1237 transitions.
[2024-05-28 06:37:37] [INFO ] Flatten gal took : 54 ms
[2024-05-28 06:37:37] [INFO ] Flatten gal took : 46 ms
[2024-05-28 06:37:37] [INFO ] Input system was already deterministic with 1103 transitions.
RANDOM walk for 371 steps (20 resets) in 8 ms. (41 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-COL-S05J60-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 904 transition count 1235
Reduce places removed 2 places and 0 transitions.
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Iterating post reduction 1 with 63 rules applied. Total rules applied 65 place count 902 transition count 1174
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 126 place count 841 transition count 1174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 126 place count 841 transition count 1173
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 840 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 839 transition count 1172
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 839 transition count 1172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 837 transition count 1170
Applied a total of 134 rules in 88 ms. Remains 837 /909 variables (removed 72) and now considering 1170/1237 (removed 67) transitions.
Running 1164 sub problems to find dead transitions.
[2024-05-28 06:37:37] [INFO ] Flow matrix only has 1166 transitions (discarded 4 similar events)
// Phase 1: matrix 1166 rows 837 cols
[2024-05-28 06:37:37] [INFO ] Computed 137 invariants in 16 ms
[2024-05-28 06:37:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 06:37:53] [INFO ] Deduced a trap composed of 264 places in 325 ms of which 5 ms to minimize.
[2024-05-28 06:37:54] [INFO ] Deduced a trap composed of 264 places in 312 ms of which 4 ms to minimize.
[2024-05-28 06:37:54] [INFO ] Deduced a trap composed of 264 places in 352 ms of which 5 ms to minimize.
[2024-05-28 06:37:54] [INFO ] Deduced a trap composed of 264 places in 290 ms of which 4 ms to minimize.
[2024-05-28 06:37:55] [INFO ] Deduced a trap composed of 264 places in 297 ms of which 5 ms to minimize.
[2024-05-28 06:37:55] [INFO ] Deduced a trap composed of 408 places in 309 ms of which 5 ms to minimize.
[2024-05-28 06:37:55] [INFO ] Deduced a trap composed of 264 places in 302 ms of which 4 ms to minimize.
[2024-05-28 06:37:56] [INFO ] Deduced a trap composed of 264 places in 348 ms of which 6 ms to minimize.
[2024-05-28 06:37:56] [INFO ] Deduced a trap composed of 264 places in 297 ms of which 5 ms to minimize.
[2024-05-28 06:37:56] [INFO ] Deduced a trap composed of 264 places in 348 ms of which 6 ms to minimize.
[2024-05-28 06:37:57] [INFO ] Deduced a trap composed of 264 places in 355 ms of which 6 ms to minimize.
[2024-05-28 06:37:57] [INFO ] Deduced a trap composed of 264 places in 304 ms of which 5 ms to minimize.
[2024-05-28 06:37:58] [INFO ] Deduced a trap composed of 264 places in 338 ms of which 6 ms to minimize.
[2024-05-28 06:37:58] [INFO ] Deduced a trap composed of 264 places in 341 ms of which 4 ms to minimize.
[2024-05-28 06:37:58] [INFO ] Deduced a trap composed of 264 places in 298 ms of which 5 ms to minimize.
[2024-05-28 06:37:59] [INFO ] Deduced a trap composed of 264 places in 327 ms of which 5 ms to minimize.
[2024-05-28 06:37:59] [INFO ] Deduced a trap composed of 264 places in 270 ms of which 5 ms to minimize.
[2024-05-28 06:38:00] [INFO ] Deduced a trap composed of 264 places in 365 ms of which 6 ms to minimize.
SMT process timed out in 22533ms, After SMT, problems are : Problem set: 0 solved, 1164 unsolved
Search for dead transitions found 0 dead transitions in 22550ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22642 ms. Remains : 837/909 places, 1170/1237 transitions.
[2024-05-28 06:38:00] [INFO ] Flatten gal took : 49 ms
[2024-05-28 06:38:00] [INFO ] Flatten gal took : 55 ms
[2024-05-28 06:38:00] [INFO ] Input system was already deterministic with 1170 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 904 transition count 1173
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 840 transition count 1172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 839 transition count 1172
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 839 transition count 1108
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 775 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 774 transition count 1107
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 774 transition count 1107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 772 transition count 1105
Applied a total of 264 rules in 132 ms. Remains 772 /909 variables (removed 137) and now considering 1105/1237 (removed 132) transitions.
Running 1099 sub problems to find dead transitions.
[2024-05-28 06:38:00] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
// Phase 1: matrix 1101 rows 772 cols
[2024-05-28 06:38:00] [INFO ] Computed 137 invariants in 37 ms
[2024-05-28 06:38:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:38:14] [INFO ] Deduced a trap composed of 198 places in 330 ms of which 6 ms to minimize.
[2024-05-28 06:38:15] [INFO ] Deduced a trap composed of 238 places in 350 ms of which 5 ms to minimize.
[2024-05-28 06:38:15] [INFO ] Deduced a trap composed of 198 places in 323 ms of which 6 ms to minimize.
[2024-05-28 06:38:16] [INFO ] Deduced a trap composed of 198 places in 315 ms of which 5 ms to minimize.
[2024-05-28 06:38:16] [INFO ] Deduced a trap composed of 198 places in 328 ms of which 5 ms to minimize.
[2024-05-28 06:38:16] [INFO ] Deduced a trap composed of 198 places in 303 ms of which 5 ms to minimize.
[2024-05-28 06:38:17] [INFO ] Deduced a trap composed of 198 places in 313 ms of which 5 ms to minimize.
[2024-05-28 06:38:17] [INFO ] Deduced a trap composed of 198 places in 291 ms of which 4 ms to minimize.
[2024-05-28 06:38:17] [INFO ] Deduced a trap composed of 198 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:38:18] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:38:18] [INFO ] Deduced a trap composed of 198 places in 281 ms of which 5 ms to minimize.
[2024-05-28 06:38:18] [INFO ] Deduced a trap composed of 198 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:38:18] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:38:19] [INFO ] Deduced a trap composed of 198 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:38:19] [INFO ] Deduced a trap composed of 250 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:38:19] [INFO ] Deduced a trap composed of 241 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:38:20] [INFO ] Deduced a trap composed of 198 places in 248 ms of which 5 ms to minimize.
[2024-05-28 06:38:20] [INFO ] Deduced a trap composed of 198 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:38:20] [INFO ] Deduced a trap composed of 198 places in 320 ms of which 5 ms to minimize.
[2024-05-28 06:38:21] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.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 1.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 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1873 variables, and 152 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:38:25] [INFO ] Deduced a trap composed of 198 places in 290 ms of which 4 ms to minimize.
[2024-05-28 06:38:25] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:38:25] [INFO ] Deduced a trap composed of 198 places in 261 ms of which 5 ms to minimize.
[2024-05-28 06:38:26] [INFO ] Deduced a trap composed of 198 places in 277 ms of which 6 ms to minimize.
[2024-05-28 06:38:26] [INFO ] Deduced a trap composed of 198 places in 259 ms of which 5 ms to minimize.
[2024-05-28 06:38:26] [INFO ] Deduced a trap composed of 198 places in 313 ms of which 5 ms to minimize.
[2024-05-28 06:38:27] [INFO ] Deduced a trap composed of 198 places in 297 ms of which 4 ms to minimize.
[2024-05-28 06:38:27] [INFO ] Deduced a trap composed of 198 places in 284 ms of which 4 ms to minimize.
[2024-05-28 06:38:27] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:38:28] [INFO ] Deduced a trap composed of 198 places in 320 ms of which 5 ms to minimize.
[2024-05-28 06:38:28] [INFO ] Deduced a trap composed of 198 places in 312 ms of which 5 ms to minimize.
[2024-05-28 06:38:29] [INFO ] Deduced a trap composed of 198 places in 317 ms of which 5 ms to minimize.
[2024-05-28 06:38:29] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 5 ms to minimize.
[2024-05-28 06:38:29] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:38:30] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:38:30] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:38:30] [INFO ] Deduced a trap composed of 198 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:38:31] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:38:31] [INFO ] Deduced a trap composed of 198 places in 300 ms of which 5 ms to minimize.
[2024-05-28 06:38:31] [INFO ] Deduced a trap composed of 198 places in 257 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:38:32] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 5 ms to minimize.
[2024-05-28 06:38:33] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:38:33] [INFO ] Deduced a trap composed of 198 places in 306 ms of which 5 ms to minimize.
[2024-05-28 06:38:33] [INFO ] Deduced a trap composed of 198 places in 311 ms of which 5 ms to minimize.
[2024-05-28 06:38:34] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:38:34] [INFO ] Deduced a trap composed of 198 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:38:34] [INFO ] Deduced a trap composed of 198 places in 263 ms of which 5 ms to minimize.
[2024-05-28 06:38:34] [INFO ] Deduced a trap composed of 198 places in 327 ms of which 5 ms to minimize.
[2024-05-28 06:38:35] [INFO ] Deduced a trap composed of 198 places in 262 ms of which 4 ms to minimize.
[2024-05-28 06:38:35] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:38:38] [INFO ] Deduced a trap composed of 198 places in 317 ms of which 5 ms to minimize.
[2024-05-28 06:38:39] [INFO ] Deduced a trap composed of 198 places in 271 ms of which 5 ms to minimize.
[2024-05-28 06:38:39] [INFO ] Deduced a trap composed of 198 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:38:39] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 5 ms to minimize.
[2024-05-28 06:38:40] [INFO ] Deduced a trap composed of 198 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:38:40] [INFO ] Deduced a trap composed of 198 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:38:40] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:38:40] [INFO ] Deduced a trap composed of 198 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:38:41] [INFO ] Deduced a trap composed of 198 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:38:41] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1873 variables, and 192 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1099 constraints, Known Traps: 60/60 constraints]
After SMT, in 43247ms problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 43259ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 43395 ms. Remains : 772/909 places, 1105/1237 transitions.
[2024-05-28 06:38:43] [INFO ] Flatten gal took : 39 ms
[2024-05-28 06:38:43] [INFO ] Flatten gal took : 40 ms
[2024-05-28 06:38:43] [INFO ] Input system was already deterministic with 1105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1236
Applied a total of 7 rules in 25 ms. Remains 903 /909 variables (removed 6) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 06:38:43] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 06:38:43] [INFO ] Computed 137 invariants in 38 ms
[2024-05-28 06:38:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43480ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43497ms
Finished structural reductions in LTL mode , in 1 iterations and 43526 ms. Remains : 903/909 places, 1236/1237 transitions.
[2024-05-28 06:39:27] [INFO ] Flatten gal took : 38 ms
[2024-05-28 06:39:27] [INFO ] Flatten gal took : 41 ms
[2024-05-28 06:39:27] [INFO ] Input system was already deterministic with 1236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1236
Applied a total of 7 rules in 27 ms. Remains 903 /909 variables (removed 6) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 06:39:27] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 06:39:27] [INFO ] Invariant cache hit.
[2024-05-28 06:39:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 42526ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42537ms
Finished structural reductions in LTL mode , in 1 iterations and 42568 ms. Remains : 903/909 places, 1236/1237 transitions.
[2024-05-28 06:40:10] [INFO ] Flatten gal took : 43 ms
[2024-05-28 06:40:10] [INFO ] Flatten gal took : 46 ms
[2024-05-28 06:40:10] [INFO ] Input system was already deterministic with 1236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1172
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1172
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 130 place count 839 transition count 1109
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 256 place count 776 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 257 place count 775 transition count 1108
Iterating global reduction 2 with 1 rules applied. Total rules applied 258 place count 775 transition count 1108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 260 place count 774 transition count 1107
Applied a total of 260 rules in 131 ms. Remains 774 /909 variables (removed 135) and now considering 1107/1237 (removed 130) transitions.
Running 1101 sub problems to find dead transitions.
[2024-05-28 06:40:10] [INFO ] Flow matrix only has 1103 transitions (discarded 4 similar events)
// Phase 1: matrix 1103 rows 774 cols
[2024-05-28 06:40:10] [INFO ] Computed 137 invariants in 16 ms
[2024-05-28 06:40:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-28 06:40:23] [INFO ] Deduced a trap composed of 200 places in 236 ms of which 5 ms to minimize.
[2024-05-28 06:40:24] [INFO ] Deduced a trap composed of 200 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:40:24] [INFO ] Deduced a trap composed of 245 places in 285 ms of which 5 ms to minimize.
[2024-05-28 06:40:24] [INFO ] Deduced a trap composed of 200 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:40:24] [INFO ] Deduced a trap composed of 254 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:40:25] [INFO ] Deduced a trap composed of 200 places in 262 ms of which 3 ms to minimize.
[2024-05-28 06:40:25] [INFO ] Deduced a trap composed of 242 places in 276 ms of which 4 ms to minimize.
[2024-05-28 06:40:25] [INFO ] Deduced a trap composed of 200 places in 268 ms of which 5 ms to minimize.
[2024-05-28 06:40:26] [INFO ] Deduced a trap composed of 200 places in 309 ms of which 5 ms to minimize.
[2024-05-28 06:40:26] [INFO ] Deduced a trap composed of 200 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:40:26] [INFO ] Deduced a trap composed of 200 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:40:27] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:40:27] [INFO ] Deduced a trap composed of 200 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:40:27] [INFO ] Deduced a trap composed of 200 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:40:27] [INFO ] Deduced a trap composed of 200 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:40:28] [INFO ] Deduced a trap composed of 200 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:40:28] [INFO ] Deduced a trap composed of 200 places in 264 ms of which 5 ms to minimize.
[2024-05-28 06:40:28] [INFO ] Deduced a trap composed of 200 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:40:28] [INFO ] Deduced a trap composed of 200 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:40:29] [INFO ] Deduced a trap composed of 200 places in 326 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/769 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-28 06:40:30] [INFO ] Deduced a trap composed of 200 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:40:30] [INFO ] Deduced a trap composed of 200 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:40:30] [INFO ] Deduced a trap composed of 200 places in 314 ms of which 5 ms to minimize.
[2024-05-28 06:40:30] [INFO ] Deduced a trap composed of 200 places in 285 ms of which 5 ms to minimize.
[2024-05-28 06:40:31] [INFO ] Deduced a trap composed of 200 places in 277 ms of which 4 ms to minimize.
[2024-05-28 06:40:31] [INFO ] Deduced a trap composed of 200 places in 304 ms of which 6 ms to minimize.
[2024-05-28 06:40:32] [INFO ] Deduced a trap composed of 200 places in 296 ms of which 5 ms to minimize.
[2024-05-28 06:40:32] [INFO ] Deduced a trap composed of 200 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:40:32] [INFO ] Deduced a trap composed of 200 places in 318 ms of which 5 ms to minimize.
[2024-05-28 06:40:33] [INFO ] Deduced a trap composed of 200 places in 358 ms of which 4 ms to minimize.
[2024-05-28 06:40:33] [INFO ] Deduced a trap composed of 200 places in 269 ms of which 4 ms to minimize.
[2024-05-28 06:40:33] [INFO ] Deduced a trap composed of 200 places in 310 ms of which 5 ms to minimize.
SMT process timed out in 23126ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 23152ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 23288 ms. Remains : 774/909 places, 1107/1237 transitions.
[2024-05-28 06:40:33] [INFO ] Flatten gal took : 38 ms
[2024-05-28 06:40:33] [INFO ] Flatten gal took : 41 ms
[2024-05-28 06:40:33] [INFO ] Input system was already deterministic with 1107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 2 place count 903 transition count 1175
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 124 place count 842 transition count 1175
Applied a total of 124 rules in 40 ms. Remains 842 /909 variables (removed 67) and now considering 1175/1237 (removed 62) transitions.
Running 1169 sub problems to find dead transitions.
[2024-05-28 06:40:33] [INFO ] Flow matrix only has 1171 transitions (discarded 4 similar events)
// Phase 1: matrix 1171 rows 842 cols
[2024-05-28 06:40:33] [INFO ] Computed 137 invariants in 38 ms
[2024-05-28 06:40:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/836 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/836 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 836/2013 variables, and 131 constraints, problems are : Problem set: 0 solved, 1169 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/842 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1169/1169 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/836 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/836 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
[2024-05-28 06:41:04] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/836 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/2013 variables, and 132 constraints, problems are : Problem set: 0 solved, 1169 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/842 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1169 constraints, Known Traps: 1/1 constraints]
After SMT, in 42687ms problems are : Problem set: 0 solved, 1169 unsolved
Search for dead transitions found 0 dead transitions in 42702ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42746 ms. Remains : 842/909 places, 1175/1237 transitions.
[2024-05-28 06:41:16] [INFO ] Flatten gal took : 36 ms
[2024-05-28 06:41:16] [INFO ] Flatten gal took : 42 ms
[2024-05-28 06:41:16] [INFO ] Input system was already deterministic with 1175 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 909 transition count 1234
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 906 transition count 1233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 905 transition count 1233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 905 transition count 1232
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 904 transition count 1232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 903 transition count 1231
Applied a total of 12 rules in 91 ms. Remains 903 /909 variables (removed 6) and now considering 1231/1237 (removed 6) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-28 06:41:16] [INFO ] Flow matrix only has 1227 transitions (discarded 4 similar events)
// Phase 1: matrix 1227 rows 903 cols
[2024-05-28 06:41:16] [INFO ] Computed 142 invariants in 30 ms
[2024-05-28 06:41:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/892 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/892 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 892/2130 variables, and 131 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/892 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/892 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-28 06:41:48] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 892/2130 variables, and 132 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 126/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 43153ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 43173ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 43270 ms. Remains : 903/909 places, 1231/1237 transitions.
[2024-05-28 06:42:00] [INFO ] Flatten gal took : 73 ms
[2024-05-28 06:42:00] [INFO ] Flatten gal took : 81 ms
[2024-05-28 06:42:00] [INFO ] Input system was already deterministic with 1231 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1172
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1172
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 839 transition count 1107
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 774 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1106
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 772 transition count 1105
Applied a total of 264 rules in 122 ms. Remains 772 /909 variables (removed 137) and now considering 1105/1237 (removed 132) transitions.
Running 1099 sub problems to find dead transitions.
[2024-05-28 06:42:00] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
// Phase 1: matrix 1101 rows 772 cols
[2024-05-28 06:42:00] [INFO ] Computed 137 invariants in 38 ms
[2024-05-28 06:42:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:42:14] [INFO ] Deduced a trap composed of 238 places in 328 ms of which 5 ms to minimize.
[2024-05-28 06:42:15] [INFO ] Deduced a trap composed of 198 places in 301 ms of which 5 ms to minimize.
[2024-05-28 06:42:15] [INFO ] Deduced a trap composed of 232 places in 335 ms of which 6 ms to minimize.
[2024-05-28 06:42:15] [INFO ] Deduced a trap composed of 235 places in 300 ms of which 5 ms to minimize.
[2024-05-28 06:42:16] [INFO ] Deduced a trap composed of 238 places in 306 ms of which 5 ms to minimize.
[2024-05-28 06:42:16] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:42:16] [INFO ] Deduced a trap composed of 198 places in 325 ms of which 5 ms to minimize.
[2024-05-28 06:42:17] [INFO ] Deduced a trap composed of 244 places in 327 ms of which 6 ms to minimize.
[2024-05-28 06:42:17] [INFO ] Deduced a trap composed of 198 places in 315 ms of which 6 ms to minimize.
[2024-05-28 06:42:17] [INFO ] Deduced a trap composed of 198 places in 304 ms of which 5 ms to minimize.
[2024-05-28 06:42:18] [INFO ] Deduced a trap composed of 198 places in 325 ms of which 6 ms to minimize.
[2024-05-28 06:42:18] [INFO ] Deduced a trap composed of 198 places in 306 ms of which 6 ms to minimize.
[2024-05-28 06:42:18] [INFO ] Deduced a trap composed of 198 places in 269 ms of which 4 ms to minimize.
[2024-05-28 06:42:19] [INFO ] Deduced a trap composed of 198 places in 262 ms of which 4 ms to minimize.
[2024-05-28 06:42:19] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 5 ms to minimize.
[2024-05-28 06:42:19] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:42:20] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:42:20] [INFO ] Deduced a trap composed of 198 places in 280 ms of which 5 ms to minimize.
[2024-05-28 06:42:20] [INFO ] Deduced a trap composed of 232 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:42:20] [INFO ] Deduced a trap composed of 198 places in 248 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:42:21] [INFO ] Deduced a trap composed of 198 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:42:21] [INFO ] Deduced a trap composed of 198 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:42:22] [INFO ] Deduced a trap composed of 198 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:42:22] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:42:22] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:42:22] [INFO ] Deduced a trap composed of 198 places in 275 ms of which 5 ms to minimize.
[2024-05-28 06:42:23] [INFO ] Deduced a trap composed of 198 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:42:23] [INFO ] Deduced a trap composed of 198 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:42:23] [INFO ] Deduced a trap composed of 198 places in 266 ms of which 4 ms to minimize.
SMT process timed out in 23321ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 23337ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 23464 ms. Remains : 772/909 places, 1105/1237 transitions.
[2024-05-28 06:42:23] [INFO ] Flatten gal took : 33 ms
[2024-05-28 06:42:23] [INFO ] Flatten gal took : 50 ms
[2024-05-28 06:42:23] [INFO ] Input system was already deterministic with 1105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1236
Applied a total of 7 rules in 21 ms. Remains 903 /909 variables (removed 6) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 06:42:24] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 06:42:24] [INFO ] Computed 137 invariants in 44 ms
[2024-05-28 06:42:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 42356ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42367ms
Finished structural reductions in LTL mode , in 1 iterations and 42391 ms. Remains : 903/909 places, 1236/1237 transitions.
[2024-05-28 06:43:06] [INFO ] Flatten gal took : 47 ms
[2024-05-28 06:43:06] [INFO ] Flatten gal took : 52 ms
[2024-05-28 06:43:06] [INFO ] Input system was already deterministic with 1236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 909 transition count 1176
Reduce places removed 61 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 63 rules applied. Total rules applied 124 place count 848 transition count 1174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 846 transition count 1174
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 126 place count 846 transition count 1110
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 254 place count 782 transition count 1110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 781 transition count 1109
Applied a total of 256 rules in 105 ms. Remains 781 /909 variables (removed 128) and now considering 1109/1237 (removed 128) transitions.
Running 1103 sub problems to find dead transitions.
[2024-05-28 06:43:06] [INFO ] Flow matrix only has 1105 transitions (discarded 4 similar events)
// Phase 1: matrix 1105 rows 781 cols
[2024-05-28 06:43:06] [INFO ] Computed 142 invariants in 22 ms
[2024-05-28 06:43:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/771 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/771 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 06:43:20] [INFO ] Deduced a trap composed of 201 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:43:20] [INFO ] Deduced a trap composed of 202 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:43:21] [INFO ] Deduced a trap composed of 201 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:43:21] [INFO ] Deduced a trap composed of 250 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:43:21] [INFO ] Deduced a trap composed of 242 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:43:22] [INFO ] Deduced a trap composed of 250 places in 530 ms of which 4 ms to minimize.
[2024-05-28 06:43:22] [INFO ] Deduced a trap composed of 244 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:43:22] [INFO ] Deduced a trap composed of 254 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:43:23] [INFO ] Deduced a trap composed of 202 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:43:23] [INFO ] Deduced a trap composed of 201 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:43:23] [INFO ] Deduced a trap composed of 235 places in 274 ms of which 4 ms to minimize.
[2024-05-28 06:43:24] [INFO ] Deduced a trap composed of 201 places in 278 ms of which 5 ms to minimize.
[2024-05-28 06:43:24] [INFO ] Deduced a trap composed of 201 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:43:24] [INFO ] Deduced a trap composed of 201 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:43:25] [INFO ] Deduced a trap composed of 201 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:43:25] [INFO ] Deduced a trap composed of 201 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:43:25] [INFO ] Deduced a trap composed of 201 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:43:25] [INFO ] Deduced a trap composed of 201 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:43:26] [INFO ] Deduced a trap composed of 201 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:43:26] [INFO ] Deduced a trap composed of 238 places in 250 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 06:43:27] [INFO ] Deduced a trap composed of 225 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:43:27] [INFO ] Deduced a trap composed of 221 places in 287 ms of which 4 ms to minimize.
[2024-05-28 06:43:27] [INFO ] Deduced a trap composed of 221 places in 281 ms of which 4 ms to minimize.
[2024-05-28 06:43:28] [INFO ] Deduced a trap composed of 227 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:43:28] [INFO ] Deduced a trap composed of 228 places in 280 ms of which 4 ms to minimize.
[2024-05-28 06:43:28] [INFO ] Deduced a trap composed of 227 places in 283 ms of which 4 ms to minimize.
[2024-05-28 06:43:28] [INFO ] Deduced a trap composed of 226 places in 287 ms of which 4 ms to minimize.
[2024-05-28 06:43:29] [INFO ] Deduced a trap composed of 226 places in 277 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 771/1886 variables, and 160 constraints, problems are : Problem set: 0 solved, 1103 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/134 constraints, Generalized P Invariants (flows): 6/8 constraints, State Equation: 0/781 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1103/1103 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/771 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/771 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 28/160 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 06:43:30] [INFO ] Deduced a trap composed of 201 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:43:31] [INFO ] Deduced a trap composed of 201 places in 271 ms of which 4 ms to minimize.
[2024-05-28 06:43:31] [INFO ] Deduced a trap composed of 201 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:43:31] [INFO ] Deduced a trap composed of 201 places in 283 ms of which 5 ms to minimize.
[2024-05-28 06:43:32] [INFO ] Deduced a trap composed of 202 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:43:32] [INFO ] Deduced a trap composed of 201 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:43:32] [INFO ] Deduced a trap composed of 202 places in 268 ms of which 3 ms to minimize.
[2024-05-28 06:43:32] [INFO ] Deduced a trap composed of 202 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:43:33] [INFO ] Deduced a trap composed of 201 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:43:33] [INFO ] Deduced a trap composed of 201 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:43:33] [INFO ] Deduced a trap composed of 247 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:43:34] [INFO ] Deduced a trap composed of 201 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:43:34] [INFO ] Deduced a trap composed of 201 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:43:34] [INFO ] Deduced a trap composed of 201 places in 305 ms of which 4 ms to minimize.
[2024-05-28 06:43:34] [INFO ] Deduced a trap composed of 229 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:43:35] [INFO ] Deduced a trap composed of 201 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:43:35] [INFO ] Deduced a trap composed of 201 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:43:35] [INFO ] Deduced a trap composed of 202 places in 236 ms of which 5 ms to minimize.
[2024-05-28 06:43:35] [INFO ] Deduced a trap composed of 217 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:43:36] [INFO ] Deduced a trap composed of 201 places in 254 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/771 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 06:43:37] [INFO ] Deduced a trap composed of 202 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:43:37] [INFO ] Deduced a trap composed of 201 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:43:37] [INFO ] Deduced a trap composed of 201 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:43:38] [INFO ] Deduced a trap composed of 201 places in 260 ms of which 5 ms to minimize.
[2024-05-28 06:43:38] [INFO ] Deduced a trap composed of 201 places in 276 ms of which 4 ms to minimize.
[2024-05-28 06:43:38] [INFO ] Deduced a trap composed of 201 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:43:38] [INFO ] Deduced a trap composed of 202 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:43:39] [INFO ] Deduced a trap composed of 202 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:43:39] [INFO ] Deduced a trap composed of 202 places in 260 ms of which 5 ms to minimize.
[2024-05-28 06:43:39] [INFO ] Deduced a trap composed of 201 places in 275 ms of which 16 ms to minimize.
[2024-05-28 06:43:40] [INFO ] Deduced a trap composed of 201 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:43:40] [INFO ] Deduced a trap composed of 202 places in 262 ms of which 4 ms to minimize.
[2024-05-28 06:43:40] [INFO ] Deduced a trap composed of 202 places in 262 ms of which 4 ms to minimize.
[2024-05-28 06:43:40] [INFO ] Deduced a trap composed of 201 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:43:41] [INFO ] Deduced a trap composed of 205 places in 315 ms of which 4 ms to minimize.
[2024-05-28 06:43:41] [INFO ] Deduced a trap composed of 201 places in 272 ms of which 5 ms to minimize.
[2024-05-28 06:43:41] [INFO ] Deduced a trap composed of 205 places in 286 ms of which 5 ms to minimize.
[2024-05-28 06:43:42] [INFO ] Deduced a trap composed of 201 places in 275 ms of which 4 ms to minimize.
[2024-05-28 06:43:42] [INFO ] Deduced a trap composed of 201 places in 279 ms of which 5 ms to minimize.
[2024-05-28 06:43:42] [INFO ] Deduced a trap composed of 205 places in 279 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 06:43:43] [INFO ] Deduced a trap composed of 206 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:43:44] [INFO ] Deduced a trap composed of 202 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:43:44] [INFO ] Deduced a trap composed of 202 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:43:44] [INFO ] Deduced a trap composed of 206 places in 266 ms of which 5 ms to minimize.
[2024-05-28 06:43:44] [INFO ] Deduced a trap composed of 202 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:43:45] [INFO ] Deduced a trap composed of 204 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:43:45] [INFO ] Deduced a trap composed of 205 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:43:45] [INFO ] Deduced a trap composed of 202 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:43:45] [INFO ] Deduced a trap composed of 202 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:43:46] [INFO ] Deduced a trap composed of 202 places in 271 ms of which 4 ms to minimize.
[2024-05-28 06:43:46] [INFO ] Deduced a trap composed of 202 places in 278 ms of which 5 ms to minimize.
[2024-05-28 06:43:46] [INFO ] Deduced a trap composed of 202 places in 277 ms of which 4 ms to minimize.
[2024-05-28 06:43:47] [INFO ] Deduced a trap composed of 202 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:43:47] [INFO ] Deduced a trap composed of 202 places in 295 ms of which 5 ms to minimize.
[2024-05-28 06:43:47] [INFO ] Deduced a trap composed of 202 places in 297 ms of which 5 ms to minimize.
[2024-05-28 06:43:48] [INFO ] Deduced a trap composed of 202 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:43:48] [INFO ] Deduced a trap composed of 202 places in 262 ms of which 4 ms to minimize.
[2024-05-28 06:43:48] [INFO ] Deduced a trap composed of 202 places in 257 ms of which 5 ms to minimize.
[2024-05-28 06:43:49] [INFO ] Deduced a trap composed of 202 places in 320 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/1886 variables, and 219 constraints, problems are : Problem set: 0 solved, 1103 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/134 constraints, Generalized P Invariants (flows): 6/8 constraints, State Equation: 0/781 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1103 constraints, Known Traps: 87/87 constraints]
After SMT, in 42706ms problems are : Problem set: 0 solved, 1103 unsolved
Search for dead transitions found 0 dead transitions in 42720ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42829 ms. Remains : 781/909 places, 1109/1237 transitions.
[2024-05-28 06:43:49] [INFO ] Flatten gal took : 33 ms
[2024-05-28 06:43:49] [INFO ] Flatten gal took : 35 ms
[2024-05-28 06:43:49] [INFO ] Input system was already deterministic with 1109 transitions.
[2024-05-28 06:43:49] [INFO ] Flatten gal took : 70 ms
[2024-05-28 06:43:49] [INFO ] Flatten gal took : 72 ms
[2024-05-28 06:43:50] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 33 ms.
[2024-05-28 06:43:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 909 places, 1237 transitions and 6209 arcs took 10 ms.
Total runtime 813980 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S05J60

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 909
TRANSITIONS: 1237
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.045s, Sys 0.004s]


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


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

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

Process ID: 2013
MODEL NAME: /home/mcc/execution/417/model
909 places, 1237 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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