Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 09:51 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.2K 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 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 10:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 10:01 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 93K 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-S05J40-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717257636651

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:00:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:00:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:00:38] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 16:00:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:00:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 726 ms
[2024-06-01 16:00:39] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
[2024-06-01 16:00:39] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-06-01 16:00:39] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40004 steps (3207 resets) in 2189 ms. (18 steps per ms) remains 67/85 properties
BEST_FIRST walk for 4003 steps (169 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (92 resets) in 16 ms. (235 steps per ms) remains 60/67 properties
BEST_FIRST walk for 4003 steps (106 resets) in 44 ms. (88 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (94 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (115 resets) in 116 ms. (34 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (136 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (101 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (92 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (98 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (110 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (94 resets) in 58 ms. (67 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (136 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (92 resets) in 42 ms. (93 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (92 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (95 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (98 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (104 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (97 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (97 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (168 resets) in 27 ms. (142 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (108 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (103 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (102 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (95 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (134 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (106 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (113 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (95 resets) in 33 ms. (117 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (87 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (127 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (155 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (145 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (99 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (108 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (96 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (90 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (170 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (88 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (94 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (100 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (95 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (77 resets) in 37 ms. (105 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (103 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (155 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (110 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (102 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (121 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (98 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (97 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4005 steps (165 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (140 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
// Phase 1: matrix 38 rows 48 cols
[2024-06-01 16:00:40] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 16:00:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp60 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 58 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/46 variables, 5/7 constraints. Problems are: Problem set: 26 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 26 solved, 34 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/48 variables, 6/13 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 58 solved, 2 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 7 (OVERLAPS) 38/86 variables, 48/61 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 1/62 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/62 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/62 constraints. Problems are: Problem set: 59 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 62 constraints, problems are : Problem set: 59 solved, 1 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 59 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/39 variables, 7/7 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/46 variables, 5/12 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/47 variables, 1/13 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/85 variables, 47/60 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 1/61 constraints. Problems are: Problem set: 59 solved, 1 unsolved
Problem AtomicPropp46 is UNSAT
After SMT solving in domain Int declared 85/86 variables, and 62 constraints, problems are : Problem set: 60 solved, 0 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 47/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 771ms problems are : Problem set: 60 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 60 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:00:41] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 16:00:41] [INFO ] Flatten gal took : 43 ms
[2024-06-01 16:00:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:00:41] [INFO ] Flatten gal took : 5 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-06-01 16:00:41] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 97 ms.
[2024-06-01 16:00:41] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Deduced a syphon composed of 40 places in 10 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 374 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Applied a total of 0 rules in 62 ms. Remains 629 /629 variables (removed 0) and now considering 935/935 (removed 0) transitions.
Running 929 sub problems to find dead transitions.
[2024-06-01 16:00:41] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2024-06-01 16:00:41] [INFO ] Computed 102 invariants in 48 ms
[2024-06-01 16:00:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD416 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/627 variables, 9/100 constraints. Problems are: Problem set: 78 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1560 variables, and 100 constraints, problems are : Problem set: 78 solved, 851 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 851 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 3 (OVERLAPS) 9/627 variables, 9/100 constraints. Problems are: Problem set: 78 solved, 851 unsolved
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 13 places in 324 ms of which 42 ms to minimize.
[2024-06-01 16:01:23] [INFO ] Deduced a trap composed of 212 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:01:23] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:01:23] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 2 ms to minimize.
[2024-06-01 16:01:23] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 5 ms to minimize.
SMT process timed out in 42122ms, After SMT, problems are : Problem set: 78 solved, 851 unsolved
Search for dead transitions found 78 dead transitions in 42147ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 78 transitions.
[2024-06-01 16:01:23] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
// Phase 1: matrix 853 rows 629 cols
[2024-06-01 16:01:23] [INFO ] Computed 102 invariants in 23 ms
[2024-06-01 16:01:24] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-06-01 16:01:24] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-06-01 16:01:24] [INFO ] Invariant cache hit.
[2024-06-01 16:01:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:01:26] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 2627 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 629/629 places, 857/935 transitions.
Applied a total of 0 rules in 15 ms. Remains 629 /629 variables (removed 0) and now considering 857/857 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44889 ms. Remains : 629/629 places, 857/935 transitions.
Support contains 374 out of 629 places after structural reductions.
[2024-06-01 16:01:26] [INFO ] Flatten gal took : 131 ms
[2024-06-01 16:01:26] [INFO ] Flatten gal took : 61 ms
[2024-06-01 16:01:26] [INFO ] Input system was already deterministic with 857 transitions.
RANDOM walk for 40000 steps (2735 resets) in 2411 ms. (16 steps per ms) remains 34/54 properties
BEST_FIRST walk for 4004 steps (53 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (66 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (61 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (95 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (81 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (89 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (45 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (76 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (64 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (68 resets) in 28 ms. (137 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (48 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (120 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (75 resets) in 27 ms. (143 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (65 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (64 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (70 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (99 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (71 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (70 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (53 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (99 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (100 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (57 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (60 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (65 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (70 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (97 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (76 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (58 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (60 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (53 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (31 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (42 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (120 resets) in 36 ms. (108 steps per ms) remains 34/34 properties
[2024-06-01 16:01:27] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-06-01 16:01:27] [INFO ] Invariant cache hit.
[2024-06-01 16:01:27] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 1 (OVERLAPS) 419/606 variables, 87/87 constraints. Problems are: Problem set: 22 solved, 12 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 2/89 constraints. Problems are: Problem set: 26 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/606 variables, 0/89 constraints. Problems are: Problem set: 26 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 16/622 variables, 8/97 constraints. Problems are: Problem set: 26 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 0/97 constraints. Problems are: Problem set: 26 solved, 8 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 6 (OVERLAPS) 6/628 variables, 5/102 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/102 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 853/1481 variables, 628/730 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1481 variables, 1/731 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1481 variables, 0/731 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1482 variables, 1/732 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1482 variables, 0/732 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1482 variables, 0/732 constraints. Problems are: Problem set: 33 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1482/1482 variables, and 732 constraints, problems are : Problem set: 33 solved, 1 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 33 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 308/311 variables, 2/2 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/2 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/395 variables, 43/45 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/45 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 205/600 variables, 41/86 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 0/86 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/616 variables, 8/94 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 0/94 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/627 variables, 7/101 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 0/101 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/628 variables, 1/102 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 0/102 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 853/1481 variables, 628/730 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1481 variables, 1/731 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1481 variables, 1/732 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1481 variables, 0/732 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1482 variables, 1/733 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1482 variables, 0/733 constraints. Problems are: Problem set: 33 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1482 variables, 0/733 constraints. Problems are: Problem set: 33 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1482/1482 variables, and 733 constraints, problems are : Problem set: 33 solved, 1 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 1532ms problems are : Problem set: 33 solved, 1 unsolved
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 33 atomic propositions for a total of 9 simplifications.
[2024-06-01 16:01:29] [INFO ] Flatten gal took : 83 ms
[2024-06-01 16:01:29] [INFO ] Flatten gal took : 38 ms
[2024-06-01 16:01:29] [INFO ] Input system was already deterministic with 857 transitions.
Support contains 234 out of 629 places (down from 281) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 49 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-06-01 16:01:29] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-06-01 16:01:29] [INFO ] Computed 97 invariants in 16 ms
[2024-06-01 16:01:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
(s569 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.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 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 (/ 1.0 3.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 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.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 (/ 1.0 3.0))
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 (/ 1.0 3.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 1.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 4.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 9.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 1.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 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 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 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.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 1.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 0.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s526 0.0)
(s527 1.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 204 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 5 ms to minimize.
[2024-06-01 16:02:05] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41324ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41332ms
Finished structural reductions in LTL mode , in 1 iterations and 41383 ms. Remains : 623/629 places, 856/857 transitions.
[2024-06-01 16:02:11] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:02:11] [INFO ] Flatten gal took : 45 ms
[2024-06-01 16:02:11] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 812
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 579 transition count 811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 578 transition count 811
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 767
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 534 transition count 767
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 184 place count 532 transition count 765
Applied a total of 184 rules in 260 ms. Remains 532 /629 variables (removed 97) and now considering 765/857 (removed 92) transitions.
Running 759 sub problems to find dead transitions.
[2024-06-01 16:02:11] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
// Phase 1: matrix 761 rows 532 cols
[2024-06-01 16:02:11] [INFO ] Computed 97 invariants in 16 ms
[2024-06-01 16:02:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 16:02:17] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:02:18] [INFO ] Deduced a trap composed of 163 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:02:18] [INFO ] Deduced a trap composed of 139 places in 228 ms of which 6 ms to minimize.
[2024-06-01 16:02:18] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 4 ms to minimize.
[2024-06-01 16:02:18] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 139 places in 173 ms of which 2 ms to minimize.
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 2 ms to minimize.
[2024-06-01 16:02:20] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:02:20] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:02:20] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 4 ms to minimize.
[2024-06-01 16:02:20] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:02:20] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:02:21] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 3 ms to minimize.
[2024-06-01 16:02:21] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:02:21] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:02:21] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 16:02:25] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 16:02:31] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:02:32] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:02:32] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:02:32] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:02:32] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 5 ms to minimize.
[2024-06-01 16:02:32] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:02:33] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
SMT process timed out in 21332ms, After SMT, problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 21350ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 21617 ms. Remains : 532/629 places, 765/857 transitions.
[2024-06-01 16:02:33] [INFO ] Flatten gal took : 46 ms
[2024-06-01 16:02:33] [INFO ] Flatten gal took : 59 ms
[2024-06-01 16:02:33] [INFO ] Input system was already deterministic with 765 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 812
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 579 transition count 811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 578 transition count 811
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 767
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 534 transition count 767
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 533 transition count 766
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 533 transition count 766
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 184 place count 532 transition count 765
Applied a total of 184 rules in 146 ms. Remains 532 /629 variables (removed 97) and now considering 765/857 (removed 92) transitions.
Running 759 sub problems to find dead transitions.
[2024-06-01 16:02:33] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
// Phase 1: matrix 761 rows 532 cols
[2024-06-01 16:02:33] [INFO ] Computed 97 invariants in 9 ms
[2024-06-01 16:02:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 16:02:39] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:02:39] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 2 ms to minimize.
[2024-06-01 16:02:39] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:02:39] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 138 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 4 ms to minimize.
[2024-06-01 16:02:41] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 4 ms to minimize.
[2024-06-01 16:02:41] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:02:41] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:02:41] [INFO ] Deduced a trap composed of 138 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:02:41] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:02:41] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 2 ms to minimize.
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 138 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 98 places in 202 ms of which 25 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 98 places in 199 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 16:02:45] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:02:45] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:02:45] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:02:46] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:02:46] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:02:46] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 6 ms to minimize.
[2024-06-01 16:02:46] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:02:47] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:02:47] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:02:47] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:02:47] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:02:47] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:02:47] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:02:47] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:02:48] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:02:48] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:02:48] [INFO ] Deduced a trap composed of 138 places in 188 ms of which 4 ms to minimize.
[2024-06-01 16:02:48] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 3 ms to minimize.
[2024-06-01 16:02:48] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:02:48] [INFO ] Deduced a trap composed of 138 places in 133 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 16:02:53] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:02:54] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:02:54] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:02:54] [INFO ] Deduced a trap composed of 138 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:02:54] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 3 ms to minimize.
SMT process timed out in 21337ms, After SMT, problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 21344ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 21504 ms. Remains : 532/629 places, 765/857 transitions.
[2024-06-01 16:02:54] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:02:54] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:02:54] [INFO ] Input system was already deterministic with 765 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 812
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 812
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 579 transition count 767
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 534 transition count 767
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 533 transition count 766
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 533 transition count 766
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 186 place count 531 transition count 764
Applied a total of 186 rules in 63 ms. Remains 531 /629 variables (removed 98) and now considering 764/857 (removed 93) transitions.
Running 758 sub problems to find dead transitions.
[2024-06-01 16:02:54] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
// Phase 1: matrix 760 rows 531 cols
[2024-06-01 16:02:54] [INFO ] Computed 97 invariants in 9 ms
[2024-06-01 16:02:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-06-01 16:03:01] [INFO ] Deduced a trap composed of 138 places in 135 ms of which 3 ms to minimize.
[2024-06-01 16:03:01] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-06-01 16:03:06] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:03:06] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:03:06] [INFO ] Deduced a trap composed of 180 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:03:06] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:03:06] [INFO ] Deduced a trap composed of 156 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:03:07] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:03:07] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:03:07] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:03:07] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:03:07] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:03:08] [INFO ] Deduced a trap composed of 162 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:03:08] [INFO ] Deduced a trap composed of 168 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:03:08] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:03:08] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:03:08] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:03:09] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:03:09] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 4 ms to minimize.
[2024-06-01 16:03:09] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 4 ms to minimize.
[2024-06-01 16:03:09] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:03:09] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-06-01 16:03:15] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:03:15] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:03:15] [INFO ] Deduced a trap composed of 165 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:03:16] [INFO ] Deduced a trap composed of 159 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 21154ms, After SMT, problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 21161ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 21226 ms. Remains : 531/629 places, 764/857 transitions.
[2024-06-01 16:03:16] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:03:16] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:03:16] [INFO ] Input system was already deterministic with 764 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 19 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-06-01 16:03:16] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-06-01 16:03:16] [INFO ] Computed 97 invariants in 10 ms
[2024-06-01 16:03:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:03:48] [INFO ] Deduced a trap composed of 204 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:03:48] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:03:49] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:03:53] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41276ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41283ms
Finished structural reductions in LTL mode , in 1 iterations and 41304 ms. Remains : 623/629 places, 856/857 transitions.
[2024-06-01 16:03:57] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:03:57] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:03:57] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
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 624 transition count 854
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 621 transition count 854
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 621 transition count 851
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 618 transition count 851
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 617 transition count 850
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 617 transition count 850
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 18 place count 615 transition count 848
Applied a total of 18 rules in 129 ms. Remains 615 /629 variables (removed 14) and now considering 848/857 (removed 9) transitions.
Running 842 sub problems to find dead transitions.
[2024-06-01 16:03:57] [INFO ] Flow matrix only has 844 transitions (discarded 4 similar events)
// Phase 1: matrix 844 rows 615 cols
[2024-06-01 16:03:57] [INFO ] Computed 97 invariants in 8 ms
[2024-06-01 16:03:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-06-01 16:04:05] [INFO ] Deduced a trap composed of 255 places in 180 ms of which 4 ms to minimize.
[2024-06-01 16:04:05] [INFO ] Deduced a trap composed of 221 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:04:05] [INFO ] Deduced a trap composed of 221 places in 373 ms of which 3 ms to minimize.
[2024-06-01 16:04:06] [INFO ] Deduced a trap composed of 221 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:04:06] [INFO ] Deduced a trap composed of 258 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:04:06] [INFO ] Deduced a trap composed of 246 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:04:06] [INFO ] Deduced a trap composed of 249 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:04:06] [INFO ] Deduced a trap composed of 221 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:04:07] [INFO ] Deduced a trap composed of 221 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:04:07] [INFO ] Deduced a trap composed of 221 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:04:07] [INFO ] Deduced a trap composed of 249 places in 201 ms of which 12 ms to minimize.
[2024-06-01 16:04:07] [INFO ] Deduced a trap composed of 255 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:04:07] [INFO ] Deduced a trap composed of 246 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:04:08] [INFO ] Deduced a trap composed of 221 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:04:08] [INFO ] Deduced a trap composed of 221 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:04:08] [INFO ] Deduced a trap composed of 258 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:04:08] [INFO ] Deduced a trap composed of 221 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:04:09] [INFO ] Deduced a trap composed of 221 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:04:09] [INFO ] Deduced a trap composed of 221 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:04:09] [INFO ] Deduced a trap composed of 221 places in 186 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-06-01 16:04:14] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:04:15] [INFO ] Deduced a trap composed of 301 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/610 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1459 variables, and 114 constraints, problems are : Problem set: 0 solved, 842 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/615 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 842/842 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 842 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 22/114 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 249 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 258 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 249 places in 173 ms of which 2 ms to minimize.
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 261 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:04:21] [INFO ] Deduced a trap composed of 264 places in 162 ms of which 2 ms to minimize.
[2024-06-01 16:04:21] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-06-01 16:04:22] [INFO ] Deduced a trap composed of 225 places in 189 ms of which 2 ms to minimize.
[2024-06-01 16:04:22] [INFO ] Deduced a trap composed of 221 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:04:22] [INFO ] Deduced a trap composed of 225 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 221 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 221 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 221 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 221 places in 184 ms of which 2 ms to minimize.
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 221 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:04:24] [INFO ] Deduced a trap composed of 221 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:04:24] [INFO ] Deduced a trap composed of 225 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:04:24] [INFO ] Deduced a trap composed of 221 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:04:24] [INFO ] Deduced a trap composed of 225 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:04:24] [INFO ] Deduced a trap composed of 221 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:04:25] [INFO ] Deduced a trap composed of 225 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/610 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-06-01 16:04:26] [INFO ] Deduced a trap composed of 237 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:04:26] [INFO ] Deduced a trap composed of 247 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:04:26] [INFO ] Deduced a trap composed of 237 places in 187 ms of which 2 ms to minimize.
[2024-06-01 16:04:27] [INFO ] Deduced a trap composed of 244 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:04:27] [INFO ] Deduced a trap composed of 243 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:04:27] [INFO ] Deduced a trap composed of 249 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:04:27] [INFO ] Deduced a trap composed of 234 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:04:28] [INFO ] Deduced a trap composed of 243 places in 193 ms of which 2 ms to minimize.
[2024-06-01 16:04:28] [INFO ] Deduced a trap composed of 252 places in 177 ms of which 2 ms to minimize.
[2024-06-01 16:04:28] [INFO ] Deduced a trap composed of 247 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:04:28] [INFO ] Deduced a trap composed of 249 places in 197 ms of which 2 ms to minimize.
[2024-06-01 16:04:28] [INFO ] Deduced a trap composed of 249 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:04:29] [INFO ] Deduced a trap composed of 267 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:04:29] [INFO ] Deduced a trap composed of 252 places in 179 ms of which 2 ms to minimize.
[2024-06-01 16:04:29] [INFO ] Deduced a trap composed of 243 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:04:30] [INFO ] Deduced a trap composed of 225 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:04:31] [INFO ] Deduced a trap composed of 225 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:04:31] [INFO ] Deduced a trap composed of 225 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:04:31] [INFO ] Deduced a trap composed of 225 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:04:31] [INFO ] Deduced a trap composed of 225 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-06-01 16:04:33] [INFO ] Deduced a trap composed of 240 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:04:35] [INFO ] Deduced a trap composed of 221 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:04:35] [INFO ] Deduced a trap composed of 221 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:04:36] [INFO ] Deduced a trap composed of 221 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:04:36] [INFO ] Deduced a trap composed of 221 places in 249 ms of which 5 ms to minimize.
[2024-06-01 16:04:36] [INFO ] Deduced a trap composed of 221 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:04:36] [INFO ] Deduced a trap composed of 221 places in 251 ms of which 5 ms to minimize.
[2024-06-01 16:04:37] [INFO ] Deduced a trap composed of 221 places in 226 ms of which 5 ms to minimize.
[2024-06-01 16:04:37] [INFO ] Deduced a trap composed of 221 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:04:37] [INFO ] Deduced a trap composed of 221 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:04:37] [INFO ] Deduced a trap composed of 221 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:04:37] [INFO ] Deduced a trap composed of 221 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:04:38] [INFO ] Deduced a trap composed of 221 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:04:38] [INFO ] Deduced a trap composed of 221 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:04:38] [INFO ] Deduced a trap composed of 221 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:04:38] [INFO ] Deduced a trap composed of 221 places in 183 ms of which 3 ms to minimize.
SMT process timed out in 41049ms, After SMT, problems are : Problem set: 0 solved, 842 unsolved
Search for dead transitions found 0 dead transitions in 41056ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41200 ms. Remains : 615/629 places, 848/857 transitions.
[2024-06-01 16:04:38] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:04:38] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:04:38] [INFO ] Input system was already deterministic with 848 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 624 transition count 811
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 578 transition count 811
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 767
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 180 place count 534 transition count 767
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 533 transition count 766
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 533 transition count 766
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 186 place count 531 transition count 764
Applied a total of 186 rules in 49 ms. Remains 531 /629 variables (removed 98) and now considering 764/857 (removed 93) transitions.
Running 758 sub problems to find dead transitions.
[2024-06-01 16:04:39] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
// Phase 1: matrix 760 rows 531 cols
[2024-06-01 16:04:39] [INFO ] Computed 97 invariants in 9 ms
[2024-06-01 16:04:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 3 (OVERLAPS) 4/530 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/531 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 741 unsolved
[2024-06-01 16:04:54] [INFO ] Deduced a trap composed of 171 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:04:58] [INFO ] Deduced a trap composed of 107 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:04:58] [INFO ] Deduced a trap composed of 110 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:04:59] [INFO ] Deduced a trap composed of 109 places in 211 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 Real declared 531/1291 variables, and 101 constraints, problems are : Problem set: 17 solved, 741 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 17 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 17 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 4/96 constraints. Problems are: Problem set: 17 solved, 741 unsolved
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 2 ms to minimize.
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:05:02] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:05:02] [INFO ] Deduced a trap composed of 159 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:05:02] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:05:02] [INFO ] Deduced a trap composed of 159 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 137 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 137 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 4 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 5 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/116 constraints. Problems are: Problem set: 17 solved, 741 unsolved
[2024-06-01 16:05:05] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-06-01 16:05:06] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 140 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 140 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 140 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 140 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 137 places in 139 ms of which 3 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 140 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 137 places in 139 ms of which 2 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 140 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 177 places in 150 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/136 constraints. Problems are: Problem set: 17 solved, 741 unsolved
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 140 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 2 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 2 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 140 places in 174 ms of which 2 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:05:12] [INFO ] Deduced a trap composed of 140 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:05:12] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:05:12] [INFO ] Deduced a trap composed of 140 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:05:12] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:05:12] [INFO ] Deduced a trap composed of 140 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 3 ms to minimize.
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 137 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 2 ms to minimize.
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:05:14] [INFO ] Deduced a trap composed of 140 places in 194 ms of which 4 ms to minimize.
[2024-06-01 16:05:14] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 20/156 constraints. Problems are: Problem set: 17 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1291 variables, and 156 constraints, problems are : Problem set: 17 solved, 741 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/758 constraints, Known Traps: 64/64 constraints]
After SMT, in 41115ms problems are : Problem set: 17 solved, 741 unsolved
Search for dead transitions found 17 dead transitions in 41122ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 531/629 places, 747/857 transitions.
Applied a total of 0 rules in 19 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41194 ms. Remains : 531/629 places, 747/857 transitions.
[2024-06-01 16:05:20] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:05:20] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:05:20] [INFO ] Input system was already deterministic with 747 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 20 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-06-01 16:05:20] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-06-01 16:05:20] [INFO ] Computed 97 invariants in 34 ms
[2024-06-01 16:05:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:05:52] [INFO ] Deduced a trap composed of 204 places in 182 ms of which 4 ms to minimize.
[2024-06-01 16:05:52] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 17 ms to minimize.
[2024-06-01 16:05:52] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 2 ms to minimize.
[2024-06-01 16:05:56] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41604ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41615ms
Finished structural reductions in LTL mode , in 1 iterations and 41637 ms. Remains : 623/629 places, 856/857 transitions.
[2024-06-01 16:06:01] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:06:01] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:06:02] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Applied a total of 5 rules in 9 ms. Remains 624 /629 variables (removed 5) and now considering 857/857 (removed 0) transitions.
Running 851 sub problems to find dead transitions.
[2024-06-01 16:06:02] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
// Phase 1: matrix 853 rows 624 cols
[2024-06-01 16:06:02] [INFO ] Computed 97 invariants in 9 ms
[2024-06-01 16:06:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1477 variables, and 96 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 851/851 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 851 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-06-01 16:06:26] [INFO ] Deduced a trap composed of 99 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:06:26] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 4 (OVERLAPS) 5/623 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-06-01 16:06:41] [INFO ] Deduced a trap composed of 266 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:06:41] [INFO ] Deduced a trap composed of 303 places in 182 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1477 variables, and 100 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/851 constraints, Known Traps: 4/4 constraints]
After SMT, in 41057ms problems are : Problem set: 0 solved, 851 unsolved
Search for dead transitions found 0 dead transitions in 41065ms
Finished structural reductions in LTL mode , in 1 iterations and 41077 ms. Remains : 624/629 places, 857/857 transitions.
[2024-06-01 16:06:43] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:06:43] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:06:43] [INFO ] Input system was already deterministic with 857 transitions.
[2024-06-01 16:06:43] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:06:43] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:06:43] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 16:06:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 629 places, 857 transitions and 4329 arcs took 10 ms.
Total runtime 365043 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLCardinality-2024-03
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLCardinality-2024-04
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLCardinality-2024-07
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLCardinality-2024-13
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLCardinality-2024-15

BK_STOP 1717258003537

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBNT-COL-S05J40-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1411/ctl_0_
ctl formula name PolyORBNT-COL-S05J40-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1411/ctl_1_
ctl formula name PolyORBNT-COL-S05J40-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1411/ctl_2_
ctl formula name PolyORBNT-COL-S05J40-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1411/ctl_3_
ctl formula name PolyORBNT-COL-S05J40-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1411/ctl_4_
ctl formula name PolyORBNT-COL-S05J40-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1411/ctl_5_
ctl formula name PolyORBNT-COL-S05J40-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1411/ctl_6_
ctl formula name PolyORBNT-COL-S05J40-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/1411/ctl_7_
ctl formula name PolyORBNT-COL-S05J40-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/1411/ctl_8_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;