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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.8K Apr 12 09:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 09:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 09:47 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 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 10:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Apr 12 10:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 10:00 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 92K 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-S05J30-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-COL-S05J30-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717257233766

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:53:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:53:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:53:55] [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 15:53:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 15:53:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 796 ms
[2024-06-01 15:53:56] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
[2024-06-01 15:53:56] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2024-06-01 15:53:56] [INFO ] Skeletonized 16 HLPN properties in 11 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 42 to 38
RANDOM walk for 40001 steps (3188 resets) in 1316 ms. (30 steps per ms) remains 18/38 properties
BEST_FIRST walk for 4003 steps (90 resets) in 30 ms. (129 steps per ms) remains 6/18 properties
BEST_FIRST walk for 4003 steps (153 resets) in 34 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000 steps (91 resets) in 21 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4004 steps (78 resets) in 45 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4003 steps (94 resets) in 15 ms. (250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4003 steps (96 resets) in 70 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4002 steps (165 resets) in 19 ms. (200 steps per ms) remains 6/6 properties
// Phase 1: matrix 38 rows 48 cols
[2024-06-01 15:53:57] [INFO ] Computed 13 invariants in 5 ms
[2024-06-01 15:53:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 15/32 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp34 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 16/48 variables, 7/13 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/86 variables, 48/61 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/62 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/62 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/62 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 62 constraints, problems are : Problem set: 5 solved, 1 unsolved in 181 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: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/34 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/41 variables, 4/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/47 variables, 5/13 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 15:53:57] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 8 ms to minimize.
[2024-06-01 15:53:57] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 2/15 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 38/85 variables, 47/62 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 1/63 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 0/63 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/86 variables, 1/64 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/86 variables, 1/65 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 15:53:57] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/86 variables, 1/66 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/86 variables, 0/66 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/86 variables, 0/66 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 66 constraints, problems are : Problem set: 5 solved, 1 unsolved in 238 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: 1/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 454ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
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 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
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 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 25 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
Running 25 sub problems to find dead transitions.
// Phase 1: matrix 28 rows 34 cols
[2024-06-01 15:53:57] [INFO ] Computed 12 invariants in 5 ms
[2024-06-01 15:53:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 1/34 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 28/62 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 47 constraints, problems are : Problem set: 0 solved, 25 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 15:53:57] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 28/62 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 15:53:58] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 74 constraints, problems are : Problem set: 0 solved, 25 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 2/2 constraints]
After SMT, in 807ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 808ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 845 ms. Remains : 34/48 places, 28/38 transitions.
RANDOM walk for 40006 steps (4677 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1378 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Probably explored full state space saw : 335 states, properties seen :0
Probabilistic random walk after 889 steps, saw 335 distinct states, run finished after 13 ms. (steps per millisecond=68 ) properties seen :0
Explored full state space saw : 335 states, properties seen :0
Exhaustive walk after 889 steps, saw 335 distinct states, run finished after 3 ms. (steps per millisecond=296 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
[2024-06-01 15:53:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 15:53:58] [INFO ] Flatten gal took : 22 ms
FORMULA PolyORBNT-COL-S05J30-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:53:58] [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 15:53:58] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 42 ms.
[2024-06-01 15:53:58] [INFO ] Unfolded 15 HLPN properties in 1 ms.
[2024-06-01 15:53:58] [INFO ] Reduced 555 identical enabling conditions.
[2024-06-01 15:53:58] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 15:53:58] [INFO ] Reduced 555 identical enabling conditions.
[2024-06-01 15:53:58] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 15:53:58] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 15:53:58] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 15:53:58] [INFO ] Reduced 555 identical enabling conditions.
[2024-06-01 15:53:58] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 15:53:58] [INFO ] Reduced 90 identical enabling conditions.
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 486 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 745/745 transitions.
Applied a total of 0 rules in 7 ms. Remains 489 /489 variables (removed 0) and now considering 745/745 (removed 0) transitions.
Running 739 sub problems to find dead transitions.
[2024-06-01 15:53:58] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2024-06-01 15:53:58] [INFO ] Computed 82 invariants in 45 ms
[2024-06-01 15:53:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
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 TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 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 TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/487 variables, 9/80 constraints. Problems are: Problem set: 78 solved, 661 unsolved
[2024-06-01 15:54:17] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 1/81 constraints. Problems are: Problem set: 78 solved, 661 unsolved
(s123 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 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 (/ 2.0 3.0))
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 (/ 1.0 3.0))
(s121 0.0)
(s122 0.0)
(s123 0.0timeout
)
(s124 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/1230 variables, and 81 constraints, problems are : Problem set: 78 solved, 661 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/489 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 78 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 3 (OVERLAPS) 9/487 variables, 9/80 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 1/81 constraints. Problems are: Problem set: 78 solved, 661 unsolved
[2024-06-01 15:54:28] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 4 ms to minimize.
[2024-06-01 15:54:28] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 2/83 constraints. Problems are: Problem set: 78 solved, 661 unsolved
[2024-06-01 15:54:34] [INFO ] Deduced a trap composed of 77 places in 202 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 1/84 constraints. Problems are: Problem set: 78 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/1230 variables, and 84 constraints, problems are : Problem set: 78 solved, 661 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/489 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/739 constraints, Known Traps: 4/4 constraints]
After SMT, in 41523ms problems are : Problem set: 78 solved, 661 unsolved
Search for dead transitions found 78 dead transitions in 41536ms
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 15:54:40] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
// Phase 1: matrix 663 rows 489 cols
[2024-06-01 15:54:40] [INFO ] Computed 82 invariants in 18 ms
[2024-06-01 15:54:40] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 15:54:40] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
[2024-06-01 15:54:40] [INFO ] Invariant cache hit.
[2024-06-01 15:54:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 15:54:40] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 489/489 places, 667/745 transitions.
Applied a total of 0 rules in 6 ms. Remains 489 /489 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42034 ms. Remains : 489/489 places, 667/745 transitions.
Support contains 486 out of 489 places after structural reductions.
[2024-06-01 15:54:40] [INFO ] Flatten gal took : 103 ms
[2024-06-01 15:54:41] [INFO ] Flatten gal took : 114 ms
[2024-06-01 15:54:41] [INFO ] Input system was already deterministic with 667 transitions.
Reduction of identical properties reduced properties to check from 42 to 41
RANDOM walk for 40001 steps (2772 resets) in 1383 ms. (28 steps per ms) remains 5/41 properties
BEST_FIRST walk for 40004 steps (174 resets) in 598 ms. (66 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (224 resets) in 248 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (503 resets) in 243 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (599 resets) in 281 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (567 resets) in 451 ms. (88 steps per ms) remains 5/5 properties
[2024-06-01 15:54:42] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
[2024-06-01 15:54:42] [INFO ] Invariant cache hit.
[2024-06-01 15:54:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (OVERLAPS) 186/483 variables, 75/75 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/483 variables, 2/77 constraints. Problems are: Problem set: 2 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 0/77 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp34 is UNSAT
After SMT solving in domain Real declared 489/1152 variables, and 82 constraints, problems are : Problem set: 5 solved, 0 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/489 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 728ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBNT-COL-S05J30-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:54:43] [INFO ] Flatten gal took : 91 ms
[2024-06-01 15:54:43] [INFO ] Flatten gal took : 50 ms
[2024-06-01 15:54:43] [INFO ] Input system was already deterministic with 667 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 632
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 449 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 448 transition count 631
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 597
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 414 transition count 597
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 413 transition count 596
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 413 transition count 596
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 411 transition count 594
Applied a total of 146 rules in 105 ms. Remains 411 /489 variables (removed 78) and now considering 594/667 (removed 73) transitions.
Running 588 sub problems to find dead transitions.
[2024-06-01 15:54:44] [INFO ] Flow matrix only has 590 transitions (discarded 4 similar events)
// Phase 1: matrix 590 rows 411 cols
[2024-06-01 15:54:44] [INFO ] Computed 77 invariants in 29 ms
[2024-06-01 15:54:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:54:48] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 3 ms to minimize.
[2024-06-01 15:54:48] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:54:48] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 3 ms to minimize.
[2024-06-01 15:54:49] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:54:49] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:54:49] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:54:52] [INFO ] Deduced a trap composed of 107 places in 174 ms of which 4 ms to minimize.
[2024-06-01 15:54:52] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:54:52] [INFO ] Deduced a trap composed of 107 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:54:53] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:54:53] [INFO ] Deduced a trap composed of 128 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:54:53] [INFO ] Deduced a trap composed of 107 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:54:53] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:54:53] [INFO ] Deduced a trap composed of 131 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:54:54] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:54:54] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:54:54] [INFO ] Deduced a trap composed of 107 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:54:54] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:54:54] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:54:54] [INFO ] Deduced a trap composed of 119 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:54:55] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:54:55] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:54:55] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:54:55] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:54:55] [INFO ] Deduced a trap composed of 107 places in 188 ms of which 3 ms to minimize.
[2024-06-01 15:54:56] [INFO ] Deduced a trap composed of 107 places in 171 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (OVERLAPS) 4/410 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:55:04] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
SMT process timed out in 20847ms, After SMT, problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 20854ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 20961 ms. Remains : 411/489 places, 594/667 transitions.
[2024-06-01 15:55:04] [INFO ] Flatten gal took : 39 ms
[2024-06-01 15:55:04] [INFO ] Flatten gal took : 54 ms
[2024-06-01 15:55:05] [INFO ] Input system was already deterministic with 594 transitions.
RANDOM walk for 454 steps (20 resets) in 9 ms. (45 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-COL-S05J30-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 488 transition count 666
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 488 transition count 666
Applied a total of 2 rules in 28 ms. Remains 488 /489 variables (removed 1) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2024-06-01 15:55:05] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
// Phase 1: matrix 662 rows 488 cols
[2024-06-01 15:55:05] [INFO ] Computed 82 invariants in 28 ms
[2024-06-01 15:55:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 9/486 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/488 variables, 2/82 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:55:23] [INFO ] Deduced a trap composed of 157 places in 300 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 1/83 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1150 variables, and 83 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/488 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:55:28] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:55:28] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 2/73 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/73 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 9/486 variables, 9/82 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 1/83 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:55:38] [INFO ] Deduced a trap composed of 247 places in 225 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 1/84 constraints. Problems are: Problem set: 17 solved, 643 unsolved
(s465 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 9)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 0)
(s370 4)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 0)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1150 variables, and 84 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/488 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 4/4 constraints]
After SMT, in 41029ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 41039ms
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 LTL mode, iteration 1 : 488/489 places, 649/667 transitions.
Applied a total of 0 rules in 18 ms. Remains 488 /488 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41092 ms. Remains : 488/489 places, 649/667 transitions.
[2024-06-01 15:55:46] [INFO ] Flatten gal took : 34 ms
[2024-06-01 15:55:46] [INFO ] Flatten gal took : 34 ms
[2024-06-01 15:55:46] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 631
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 631
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 448 transition count 596
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 413 transition count 596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 412 transition count 595
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 412 transition count 595
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 148 place count 410 transition count 593
Applied a total of 148 rules in 68 ms. Remains 410 /489 variables (removed 79) and now considering 593/667 (removed 74) transitions.
Running 587 sub problems to find dead transitions.
[2024-06-01 15:55:46] [INFO ] Flow matrix only has 589 transitions (discarded 4 similar events)
// Phase 1: matrix 589 rows 410 cols
[2024-06-01 15:55:46] [INFO ] Computed 77 invariants in 12 ms
[2024-06-01 15:55:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-06-01 15:55:50] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:55:50] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:55:51] [INFO ] Deduced a trap composed of 106 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:55:51] [INFO ] Deduced a trap composed of 106 places in 187 ms of which 5 ms to minimize.
[2024-06-01 15:55:51] [INFO ] Deduced a trap composed of 106 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:55:51] [INFO ] Deduced a trap composed of 106 places in 192 ms of which 6 ms to minimize.
[2024-06-01 15:55:51] [INFO ] Deduced a trap composed of 106 places in 201 ms of which 4 ms to minimize.
[2024-06-01 15:55:52] [INFO ] Deduced a trap composed of 107 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:55:52] [INFO ] Deduced a trap composed of 106 places in 197 ms of which 4 ms to minimize.
[2024-06-01 15:55:52] [INFO ] Deduced a trap composed of 107 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:55:52] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:55:52] [INFO ] Deduced a trap composed of 106 places in 210 ms of which 5 ms to minimize.
[2024-06-01 15:55:53] [INFO ] Deduced a trap composed of 106 places in 206 ms of which 4 ms to minimize.
[2024-06-01 15:55:53] [INFO ] Deduced a trap composed of 106 places in 227 ms of which 4 ms to minimize.
[2024-06-01 15:55:53] [INFO ] Deduced a trap composed of 106 places in 198 ms of which 5 ms to minimize.
[2024-06-01 15:55:53] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:55:54] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 4 ms to minimize.
[2024-06-01 15:55:56] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:55:57] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:55:57] [INFO ] Deduced a trap composed of 132 places in 119 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-06-01 15:56:00] [INFO ] Deduced a trap composed of 140 places in 161 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (OVERLAPS) 4/409 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/999 variables, and 97 constraints, problems are : Problem set: 0 solved, 587 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-06-01 15:56:08] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:56:09] [INFO ] Deduced a trap composed of 110 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:56:09] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 4 ms to minimize.
[2024-06-01 15:56:09] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:56:09] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:56:09] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:56:09] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:56:10] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:56:10] [INFO ] Deduced a trap composed of 110 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:56:10] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:56:10] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:56:10] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:56:11] [INFO ] Deduced a trap composed of 106 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:56:11] [INFO ] Deduced a trap composed of 110 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:56:11] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:56:11] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:56:11] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 3 ms to minimize.
[2024-06-01 15:56:12] [INFO ] Deduced a trap composed of 106 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:56:12] [INFO ] Deduced a trap composed of 110 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:56:12] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-06-01 15:56:13] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:56:13] [INFO ] Deduced a trap composed of 128 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:56:13] [INFO ] Deduced a trap composed of 116 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:56:13] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:56:13] [INFO ] Deduced a trap composed of 131 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:56:14] [INFO ] Deduced a trap composed of 119 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:56:14] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:56:14] [INFO ] Deduced a trap composed of 125 places in 147 ms of which 4 ms to minimize.
[2024-06-01 15:56:14] [INFO ] Deduced a trap composed of 116 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:56:14] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:56:14] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:56:14] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:56:15] [INFO ] Deduced a trap composed of 146 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:56:15] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:56:15] [INFO ] Deduced a trap composed of 123 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:56:15] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:56:16] [INFO ] Deduced a trap composed of 122 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:56:16] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:56:16] [INFO ] Deduced a trap composed of 125 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:56:16] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-06-01 15:56:18] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:56:18] [INFO ] Deduced a trap composed of 129 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:56:18] [INFO ] Deduced a trap composed of 110 places in 156 ms of which 4 ms to minimize.
[2024-06-01 15:56:18] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:56:18] [INFO ] Deduced a trap composed of 142 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:56:18] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:56:19] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:56:19] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:56:19] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:56:19] [INFO ] Deduced a trap composed of 129 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:56:19] [INFO ] Deduced a trap composed of 123 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:56:20] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:56:20] [INFO ] Deduced a trap composed of 110 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:56:20] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:56:20] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 4 ms to minimize.
[2024-06-01 15:56:20] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:56:21] [INFO ] Deduced a trap composed of 106 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:56:21] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:56:21] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:56:21] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-06-01 15:56:23] [INFO ] Deduced a trap composed of 128 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:56:23] [INFO ] Deduced a trap composed of 175 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:56:23] [INFO ] Deduced a trap composed of 125 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:56:25] [INFO ] Deduced a trap composed of 178 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:56:25] [INFO ] Deduced a trap composed of 106 places in 201 ms of which 3 ms to minimize.
[2024-06-01 15:56:25] [INFO ] Deduced a trap composed of 110 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:56:26] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:56:26] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:56:26] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 3 ms to minimize.
[2024-06-01 15:56:27] [INFO ] Deduced a trap composed of 132 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:56:27] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 2 ms to minimize.
SMT process timed out in 40855ms, After SMT, problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 40861ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40931 ms. Remains : 410/489 places, 593/667 transitions.
[2024-06-01 15:56:27] [INFO ] Flatten gal took : 28 ms
[2024-06-01 15:56:27] [INFO ] Flatten gal took : 36 ms
[2024-06-01 15:56:27] [INFO ] Input system was already deterministic with 593 transitions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Applied a total of 5 rules in 13 ms. Remains 484 /489 variables (removed 5) and now considering 667/667 (removed 0) transitions.
Running 661 sub problems to find dead transitions.
[2024-06-01 15:56:27] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
// Phase 1: matrix 663 rows 484 cols
[2024-06-01 15:56:27] [INFO ] Computed 77 invariants in 12 ms
[2024-06-01 15:56:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 3 (OVERLAPS) 5/483 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-01 15:56:42] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-01 15:56:47] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 4 ms to minimize.
[2024-06-01 15:56:47] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 661 unsolved
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 1.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 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1147 variables, and 79 constraints, problems are : Problem set: 0 solved, 661 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-01 15:56:52] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-01 15:56:55] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 5 (OVERLAPS) 5/483 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1147 variables, and 81 constraints, problems are : Problem set: 0 solved, 661 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/661 constraints, Known Traps: 5/5 constraints]
After SMT, in 40975ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 40991ms
Finished structural reductions in LTL mode , in 1 iterations and 41008 ms. Remains : 484/489 places, 667/667 transitions.
[2024-06-01 15:57:08] [INFO ] Flatten gal took : 27 ms
[2024-06-01 15:57:08] [INFO ] Flatten gal took : 27 ms
[2024-06-01 15:57:08] [INFO ] Input system was already deterministic with 667 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 489/489 places, 667/667 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 484 transition count 664
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 481 transition count 662
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 479 transition count 662
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 479 transition count 660
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 14 place count 477 transition count 660
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 18 place count 475 transition count 658
Applied a total of 18 rules in 35 ms. Remains 475 /489 variables (removed 14) and now considering 658/667 (removed 9) transitions.
Running 652 sub problems to find dead transitions.
[2024-06-01 15:57:08] [INFO ] Flow matrix only has 654 transitions (discarded 4 similar events)
// Phase 1: matrix 654 rows 475 cols
[2024-06-01 15:57:08] [INFO ] Computed 77 invariants in 19 ms
[2024-06-01 15:57:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 652 unsolved
[2024-06-01 15:57:13] [INFO ] Deduced a trap composed of 186 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:57:13] [INFO ] Deduced a trap composed of 186 places in 161 ms of which 4 ms to minimize.
[2024-06-01 15:57:14] [INFO ] Deduced a trap composed of 207 places in 198 ms of which 4 ms to minimize.
[2024-06-01 15:57:14] [INFO ] Deduced a trap composed of 171 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:57:14] [INFO ] Deduced a trap composed of 192 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:57:14] [INFO ] Deduced a trap composed of 171 places in 185 ms of which 5 ms to minimize.
[2024-06-01 15:57:14] [INFO ] Deduced a trap composed of 171 places in 215 ms of which 4 ms to minimize.
[2024-06-01 15:57:15] [INFO ] Deduced a trap composed of 171 places in 194 ms of which 4 ms to minimize.
[2024-06-01 15:57:15] [INFO ] Deduced a trap composed of 192 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:57:15] [INFO ] Deduced a trap composed of 189 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:57:15] [INFO ] Deduced a trap composed of 192 places in 185 ms of which 4 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 183 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 171 places in 191 ms of which 4 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 171 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 189 places in 201 ms of which 4 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 180 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:57:17] [INFO ] Deduced a trap composed of 171 places in 167 ms of which 3 ms to minimize.
[2024-06-01 15:57:17] [INFO ] Deduced a trap composed of 210 places in 173 ms of which 4 ms to minimize.
[2024-06-01 15:57:17] [INFO ] Deduced a trap composed of 189 places in 173 ms of which 4 ms to minimize.
[2024-06-01 15:57:17] [INFO ] Deduced a trap composed of 183 places in 191 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 652 unsolved
[2024-06-01 15:57:20] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:57:22] [INFO ] Deduced a trap composed of 222 places in 187 ms of which 4 ms to minimize.
[2024-06-01 15:57:22] [INFO ] Deduced a trap composed of 220 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:57:22] [INFO ] Deduced a trap composed of 241 places in 157 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 652 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 652 unsolved
SMT process timed out in 20811ms, After SMT, problems are : Problem set: 0 solved, 652 unsolved
Search for dead transitions found 0 dead transitions in 20818ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 20855 ms. Remains : 475/489 places, 658/667 transitions.
[2024-06-01 15:57:29] [INFO ] Flatten gal took : 23 ms
[2024-06-01 15:57:29] [INFO ] Flatten gal took : 24 ms
[2024-06-01 15:57:29] [INFO ] Input system was already deterministic with 658 transitions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 23 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2024-06-01 15:57:29] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
// Phase 1: matrix 662 rows 483 cols
[2024-06-01 15:57:29] [INFO ] Computed 77 invariants in 13 ms
[2024-06-01 15:57:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:57:46] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:57:46] [INFO ] Deduced a trap composed of 203 places in 203 ms of which 4 ms to minimize.
[2024-06-01 15:57:47] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:57:47] [INFO ] Deduced a trap composed of 209 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:57:47] [INFO ] Deduced a trap composed of 209 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:57:47] [INFO ] Deduced a trap composed of 203 places in 198 ms of which 3 ms to minimize.
[2024-06-01 15:57:47] [INFO ] Deduced a trap composed of 203 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:57:47] [INFO ] Deduced a trap composed of 200 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:57:48] [INFO ] Deduced a trap composed of 212 places in 205 ms of which 4 ms to minimize.
[2024-06-01 15:57:48] [INFO ] Deduced a trap composed of 212 places in 207 ms of which 3 ms to minimize.
[2024-06-01 15:57:48] [INFO ] Deduced a trap composed of 206 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:57:50] [INFO ] Deduced a trap composed of 161 places in 206 ms of which 4 ms to minimize.
SMT process timed out in 20880ms, After SMT, problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 20889ms
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 LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 14 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20930 ms. Remains : 483/489 places, 649/667 transitions.
[2024-06-01 15:57:50] [INFO ] Flatten gal took : 26 ms
[2024-06-01 15:57:50] [INFO ] Flatten gal took : 29 ms
[2024-06-01 15:57:50] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 10 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2024-06-01 15:57:50] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2024-06-01 15:57:50] [INFO ] Invariant cache hit.
[2024-06-01 15:57:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:58:07] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 78 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:58:13] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 1/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 5/482 variables, 5/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (OVERLAPS) 1/483 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:58:25] [INFO ] Deduced a trap composed of 206 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:58:29] [INFO ] Deduced a trap composed of 251 places in 204 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1145 variables, and 81 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 4/4 constraints]
After SMT, in 40872ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 40883ms
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 LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 4 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40899 ms. Remains : 483/489 places, 649/667 transitions.
[2024-06-01 15:58:31] [INFO ] Flatten gal took : 21 ms
[2024-06-01 15:58:31] [INFO ] Flatten gal took : 23 ms
[2024-06-01 15:58:31] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 13 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2024-06-01 15:58:31] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2024-06-01 15:58:31] [INFO ] Invariant cache hit.
[2024-06-01 15:58:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:58:49] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 78 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 1/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 5/482 variables, 5/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (OVERLAPS) 1/483 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:59:08] [INFO ] Deduced a trap composed of 206 places in 216 ms of which 3 ms to minimize.
[2024-06-01 15:59:11] [INFO ] Deduced a trap composed of 251 places in 210 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1145 variables, and 81 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 4/4 constraints]
After SMT, in 40892ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 40900ms
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 LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 7 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40923 ms. Remains : 483/489 places, 649/667 transitions.
[2024-06-01 15:59:12] [INFO ] Flatten gal took : 26 ms
[2024-06-01 15:59:12] [INFO ] Flatten gal took : 30 ms
[2024-06-01 15:59:12] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 12 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2024-06-01 15:59:12] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2024-06-01 15:59:12] [INFO ] Invariant cache hit.
[2024-06-01 15:59:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:59:30] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 78 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:59:35] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 1/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 5/482 variables, 5/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (OVERLAPS) 1/483 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 15:59:49] [INFO ] Deduced a trap composed of 206 places in 210 ms of which 4 ms to minimize.
[2024-06-01 15:59:52] [INFO ] Deduced a trap composed of 251 places in 144 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1145 variables, and 81 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 4/4 constraints]
After SMT, in 40863ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 40872ms
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 LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 6 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40892 ms. Remains : 483/489 places, 649/667 transitions.
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 28 ms
[2024-06-01 15:59:53] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 8 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2024-06-01 15:59:53] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2024-06-01 15:59:53] [INFO ] Invariant cache hit.
[2024-06-01 15:59:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 16:00:12] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 78 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 16:00:17] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 1/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 5/482 variables, 5/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (OVERLAPS) 1/483 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 16:00:31] [INFO ] Deduced a trap composed of 206 places in 200 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1145 variables, and 80 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 3/3 constraints]
After SMT, in 40801ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 40813ms
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 LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 3 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40828 ms. Remains : 483/489 places, 649/667 transitions.
[2024-06-01 16:00:34] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:00:34] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:00:34] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 484 transition count 634
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 451 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 450 transition count 633
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 68 place count 450 transition count 600
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 134 place count 417 transition count 600
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 416 transition count 599
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 416 transition count 599
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 414 transition count 597
Applied a total of 140 rules in 40 ms. Remains 414 /489 variables (removed 75) and now considering 597/667 (removed 70) transitions.
Running 591 sub problems to find dead transitions.
[2024-06-01 16:00:34] [INFO ] Flow matrix only has 593 transitions (discarded 4 similar events)
// Phase 1: matrix 593 rows 414 cols
[2024-06-01 16:00:34] [INFO ] Computed 77 invariants in 7 ms
[2024-06-01 16:00:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:00:38] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 3 ms to minimize.
[2024-06-01 16:00:38] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 110 places in 114 ms of which 2 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 110 places in 133 ms of which 3 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 3 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:00:40] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:00:40] [INFO ] Deduced a trap composed of 110 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:00:40] [INFO ] Deduced a trap composed of 110 places in 114 ms of which 2 ms to minimize.
[2024-06-01 16:00:40] [INFO ] Deduced a trap composed of 110 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:00:40] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:00:41] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:00:41] [INFO ] Deduced a trap composed of 110 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:00:41] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:00:42] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:00:42] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:00:42] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:00:42] [INFO ] Deduced a trap composed of 110 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:00:42] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:00:43] [INFO ] Deduced a trap composed of 110 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:00:43] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:00:43] [INFO ] Deduced a trap composed of 110 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:00:43] [INFO ] Deduced a trap composed of 110 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:00:43] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:00:43] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:00:44] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:00:44] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-06-01 16:00:44] [INFO ] Deduced a trap composed of 111 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:00:44] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:00:47] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 13/105 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:00:51] [INFO ] Deduced a trap composed of 110 places in 115 ms of which 2 ms to minimize.
[2024-06-01 16:00:51] [INFO ] Deduced a trap composed of 110 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:00:51] [INFO ] Deduced a trap composed of 110 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:00:51] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:00:51] [INFO ] Deduced a trap composed of 110 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:00:51] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:00:52] [INFO ] Deduced a trap composed of 110 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:00:52] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:00:52] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:00:52] [INFO ] Deduced a trap composed of 110 places in 119 ms of which 2 ms to minimize.
[2024-06-01 16:00:52] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 3 ms to minimize.
[2024-06-01 16:00:52] [INFO ] Deduced a trap composed of 110 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:00:53] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:00:53] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:00:53] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/1007 variables, and 120 constraints, problems are : Problem set: 0 solved, 591 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 66/70 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 129 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 129 places in 143 ms of which 2 ms to minimize.
[2024-06-01 16:00:57] [INFO ] Deduced a trap composed of 138 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:00:57] [INFO ] Deduced a trap composed of 110 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:00:57] [INFO ] Deduced a trap composed of 110 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:00:57] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:00:57] [INFO ] Deduced a trap composed of 110 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:00:57] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 110 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 110 places in 139 ms of which 3 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 113 places in 137 ms of which 3 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 110 places in 133 ms of which 3 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:00:59] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 3 ms to minimize.
[2024-06-01 16:00:59] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:00:59] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:00:59] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 2 ms to minimize.
[2024-06-01 16:01:00] [INFO ] Deduced a trap composed of 110 places in 170 ms of which 2 ms to minimize.
[2024-06-01 16:01:00] [INFO ] Deduced a trap composed of 110 places in 191 ms of which 2 ms to minimize.
[2024-06-01 16:01:00] [INFO ] Deduced a trap composed of 110 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:01:00] [INFO ] Deduced a trap composed of 110 places in 164 ms of which 2 ms to minimize.
[2024-06-01 16:01:00] [INFO ] Deduced a trap composed of 110 places in 200 ms of which 5 ms to minimize.
[2024-06-01 16:01:01] [INFO ] Deduced a trap composed of 110 places in 205 ms of which 5 ms to minimize.
[2024-06-01 16:01:01] [INFO ] Deduced a trap composed of 113 places in 216 ms of which 5 ms to minimize.
[2024-06-01 16:01:01] [INFO ] Deduced a trap composed of 110 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:01:01] [INFO ] Deduced a trap composed of 113 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:01:01] [INFO ] Deduced a trap composed of 110 places in 168 ms of which 2 ms to minimize.
[2024-06-01 16:01:02] [INFO ] Deduced a trap composed of 110 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:01:02] [INFO ] Deduced a trap composed of 110 places in 177 ms of which 2 ms to minimize.
[2024-06-01 16:01:02] [INFO ] Deduced a trap composed of 110 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:01:02] [INFO ] Deduced a trap composed of 110 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:01:02] [INFO ] Deduced a trap composed of 110 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:01:03] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:01:03] [INFO ] Deduced a trap composed of 113 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:01:03] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:01:03] [INFO ] Deduced a trap composed of 113 places in 165 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:01:04] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:01:04] [INFO ] Deduced a trap composed of 110 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:01:04] [INFO ] Deduced a trap composed of 113 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:01:05] [INFO ] Deduced a trap composed of 110 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:01:05] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:01:05] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:01:05] [INFO ] Deduced a trap composed of 110 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:01:05] [INFO ] Deduced a trap composed of 110 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:01:05] [INFO ] Deduced a trap composed of 110 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:01:06] [INFO ] Deduced a trap composed of 113 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:01:06] [INFO ] Deduced a trap composed of 110 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:01:06] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:01:06] [INFO ] Deduced a trap composed of 110 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:01:06] [INFO ] Deduced a trap composed of 110 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:01:06] [INFO ] Deduced a trap composed of 113 places in 168 ms of which 4 ms to minimize.
[2024-06-01 16:01:07] [INFO ] Deduced a trap composed of 110 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:01:07] [INFO ] Deduced a trap composed of 113 places in 126 ms of which 3 ms to minimize.
[2024-06-01 16:01:07] [INFO ] Deduced a trap composed of 113 places in 125 ms of which 3 ms to minimize.
[2024-06-01 16:01:07] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:01:07] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:01:08] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-06-01 16:01:10] [INFO ] Deduced a trap composed of 114 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:01:10] [INFO ] Deduced a trap composed of 110 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:01:10] [INFO ] Deduced a trap composed of 110 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:01:11] [INFO ] Deduced a trap composed of 110 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:01:11] [INFO ] Deduced a trap composed of 110 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:01:11] [INFO ] Deduced a trap composed of 113 places in 137 ms of which 3 ms to minimize.
[2024-06-01 16:01:11] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:01:11] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 2 ms to minimize.
[2024-06-01 16:01:11] [INFO ] Deduced a trap composed of 110 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:01:12] [INFO ] Deduced a trap composed of 110 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:01:12] [INFO ] Deduced a trap composed of 113 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:01:12] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:01:12] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:01:12] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/1007 variables, and 195 constraints, problems are : Problem set: 0 solved, 591 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 66/70 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 123/123 constraints]
After SMT, in 40819ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 40824ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40866 ms. Remains : 414/489 places, 597/667 transitions.
[2024-06-01 16:01:15] [INFO ] Flatten gal took : 31 ms
[2024-06-01 16:01:15] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:01:15] [INFO ] Input system was already deterministic with 597 transitions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 12 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2024-06-01 16:01:15] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
// Phase 1: matrix 662 rows 483 cols
[2024-06-01 16:01:15] [INFO ] Computed 77 invariants in 8 ms
[2024-06-01 16:01:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 203 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 209 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 209 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 203 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 203 places in 144 ms of which 3 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 200 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 212 places in 142 ms of which 3 ms to minimize.
[2024-06-01 16:01:34] [INFO ] Deduced a trap composed of 212 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:01:34] [INFO ] Deduced a trap composed of 206 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:01:35] [INFO ] Deduced a trap composed of 161 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:01:35] [INFO ] Deduced a trap composed of 203 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:01:36] [INFO ] Deduced a trap composed of 264 places in 164 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 91 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 1/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 5/482 variables, 5/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 12/89 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 16:01:47] [INFO ] Deduced a trap composed of 209 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:01:49] [INFO ] Deduced a trap composed of 222 places in 198 ms of which 4 ms to minimize.
[2024-06-01 16:01:49] [INFO ] Deduced a trap composed of 230 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:01:49] [INFO ] Deduced a trap composed of 224 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:01:49] [INFO ] Deduced a trap composed of 226 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:01:51] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 6/95 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 16:01:54] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 2 ms to minimize.
[2024-06-01 16:01:56] [INFO ] Deduced a trap composed of 194 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:01:56] [INFO ] Deduced a trap composed of 194 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:01:56] [INFO ] Deduced a trap composed of 229 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:01:56] [INFO ] Deduced a trap composed of 224 places in 142 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/1145 variables, and 100 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 24/26 constraints]
After SMT, in 41022ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 41034ms
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 LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 4 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41053 ms. Remains : 483/489 places, 649/667 transitions.
[2024-06-01 16:01:56] [INFO ] Flatten gal took : 19 ms
[2024-06-01 16:01:56] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:01:56] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 632
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 449 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 448 transition count 631
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 597
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 414 transition count 597
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 413 transition count 596
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 413 transition count 596
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 411 transition count 594
Applied a total of 146 rules in 77 ms. Remains 411 /489 variables (removed 78) and now considering 594/667 (removed 73) transitions.
Running 588 sub problems to find dead transitions.
[2024-06-01 16:01:56] [INFO ] Flow matrix only has 590 transitions (discarded 4 similar events)
// Phase 1: matrix 590 rows 411 cols
[2024-06-01 16:01:56] [INFO ] Computed 77 invariants in 16 ms
[2024-06-01 16:01:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 16:02:01] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:02:01] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:02:01] [INFO ] Deduced a trap composed of 107 places in 145 ms of which 4 ms to minimize.
[2024-06-01 16:02:01] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 3 ms to minimize.
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 16:02:05] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:02:05] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:02:05] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:02:05] [INFO ] Deduced a trap composed of 119 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:02:06] [INFO ] Deduced a trap composed of 128 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:02:06] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:02:06] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:02:06] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:02:06] [INFO ] Deduced a trap composed of 107 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:02:07] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:02:07] [INFO ] Deduced a trap composed of 107 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:02:07] [INFO ] Deduced a trap composed of 119 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:02:07] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:02:07] [INFO ] Deduced a trap composed of 119 places in 145 ms of which 3 ms to minimize.
[2024-06-01 16:02:07] [INFO ] Deduced a trap composed of 107 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:02:08] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 3 ms to minimize.
[2024-06-01 16:02:08] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:02:08] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:02:08] [INFO ] Deduced a trap composed of 107 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:02:08] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (OVERLAPS) 4/410 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 16:02:17] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 3 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 410/1001 variables, and 103 constraints, problems are : Problem set: 0 solved, 588 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 27/99 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:02:20] [INFO ] Deduced a trap composed of 129 places in 183 ms of which 2 ms to minimize.
[2024-06-01 16:02:20] [INFO ] Deduced a trap composed of 129 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:02:20] [INFO ] Deduced a trap composed of 93 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:02:21] [INFO ] Deduced a trap composed of 127 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:02:21] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:02:24] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 16:02:25] [INFO ] Deduced a trap composed of 129 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:02:25] [INFO ] Deduced a trap composed of 127 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:02:25] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:02:25] [INFO ] Deduced a trap composed of 127 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:02:25] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:02:25] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:02:26] [INFO ] Deduced a trap composed of 129 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:02:26] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-06-01 16:02:27] [INFO ] Deduced a trap composed of 129 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:02:27] [INFO ] Deduced a trap composed of 135 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:02:28] [INFO ] Deduced a trap composed of 135 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:02:28] [INFO ] Deduced a trap composed of 129 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:02:28] [INFO ] Deduced a trap composed of 127 places in 196 ms of which 2 ms to minimize.
[2024-06-01 16:02:31] [INFO ] Deduced a trap composed of 162 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:02:31] [INFO ] Deduced a trap composed of 156 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:02:32] [INFO ] Deduced a trap composed of 158 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 16/122 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 16:02:34] [INFO ] Deduced a trap composed of 133 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:02:34] [INFO ] Deduced a trap composed of 133 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:02:34] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 2 ms to minimize.
[2024-06-01 16:02:34] [INFO ] Deduced a trap composed of 182 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:02:34] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:02:35] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:02:35] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:02:35] [INFO ] Deduced a trap composed of 119 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:02:35] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:02:35] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:02:35] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:02:35] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:02:36] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:02:36] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:02:36] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:02:36] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:02:37] [INFO ] Deduced a trap composed of 82 places in 176 ms of which 2 ms to minimize.
SMT process timed out in 41084ms, After SMT, problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 41096ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41177 ms. Remains : 411/489 places, 594/667 transitions.
[2024-06-01 16:02:37] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:02:37] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:02:38] [INFO ] Input system was already deterministic with 594 transitions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 11 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2024-06-01 16:02:38] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
// Phase 1: matrix 662 rows 483 cols
[2024-06-01 16:02:38] [INFO ] Computed 77 invariants in 8 ms
[2024-06-01 16:02:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 16:02:53] [INFO ] Deduced a trap composed of 76 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:02:53] [INFO ] Deduced a trap composed of 203 places in 167 ms of which 4 ms to minimize.
[2024-06-01 16:02:53] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 2 ms to minimize.
[2024-06-01 16:02:54] [INFO ] Deduced a trap composed of 209 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:02:54] [INFO ] Deduced a trap composed of 209 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:02:54] [INFO ] Deduced a trap composed of 203 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:02:54] [INFO ] Deduced a trap composed of 203 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:02:54] [INFO ] Deduced a trap composed of 200 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:02:55] [INFO ] Deduced a trap composed of 212 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:02:55] [INFO ] Deduced a trap composed of 212 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:02:55] [INFO ] Deduced a trap composed of 206 places in 163 ms of which 4 ms to minimize.
[2024-06-01 16:02:56] [INFO ] Deduced a trap composed of 161 places in 181 ms of which 2 ms to minimize.
[2024-06-01 16:02:57] [INFO ] Deduced a trap composed of 203 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:02:57] [INFO ] Deduced a trap composed of 264 places in 185 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 91 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 16:03:01] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 1/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 5/482 variables, 5/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 12/89 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 16:03:08] [INFO ] Deduced a trap composed of 209 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:03:10] [INFO ] Deduced a trap composed of 222 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:03:10] [INFO ] Deduced a trap composed of 230 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:03:10] [INFO ] Deduced a trap composed of 224 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:03:10] [INFO ] Deduced a trap composed of 226 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:03:12] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 6/95 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-06-01 16:03:15] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:03:16] [INFO ] Deduced a trap composed of 194 places in 139 ms of which 2 ms to minimize.
[2024-06-01 16:03:17] [INFO ] Deduced a trap composed of 194 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:03:17] [INFO ] Deduced a trap composed of 229 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:03:17] [INFO ] Deduced a trap composed of 224 places in 146 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/1145 variables, and 100 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 24/26 constraints]
After SMT, in 40740ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 40749ms
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 LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 5 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40768 ms. Remains : 483/489 places, 649/667 transitions.
[2024-06-01 16:03:18] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:03:18] [INFO ] Flatten gal took : 19 ms
[2024-06-01 16:03:18] [INFO ] Input system was already deterministic with 649 transitions.
[2024-06-01 16:03:18] [INFO ] Flatten gal took : 38 ms
[2024-06-01 16:03:19] [INFO ] Flatten gal took : 39 ms
[2024-06-01 16:03:19] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 37 ms.
[2024-06-01 16:03:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 489 places, 667 transitions and 3389 arcs took 10 ms.
Total runtime 563954 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-S05J30-CTLFireability-2024-02
Could not compute solution for formula : PolyORBNT-COL-S05J30-CTLFireability-2024-03
Could not compute solution for formula : PolyORBNT-COL-S05J30-CTLFireability-2024-04
Could not compute solution for formula : PolyORBNT-COL-S05J30-CTLFireability-2024-05
Could not compute solution for formula : PolyORBNT-COL-S05J30-CTLFireability-2024-07
Could not compute solution for formula : PolyORBNT-COL-S05J30-CTLFireability-2024-08
Could not compute solution for formula : PolyORBNT-COL-S05J30-CTLFireability-2024-09
Could not compute solution for formula : PolyORBNT-COL-S05J30-CTLFireability-2024-10
Could not compute solution for formula : PolyORBNT-COL-S05J30-CTLFireability-2024-11
Could not compute solution for formula : PolyORBNT-COL-S05J30-CTLFireability-2024-12
Could not compute solution for formula : PolyORBNT-COL-S05J30-CTLFireability-2024-13
Could not compute solution for formula : PolyORBNT-COL-S05J30-CTLFireability-2024-14
Could not compute solution for formula : PolyORBNT-COL-S05J30-CTLFireability-2024-15

BK_STOP 1717257799607

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1955/ctl_0_
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1955/ctl_1_
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1955/ctl_2_
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1955/ctl_3_
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1955/ctl_4_
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1955/ctl_5_
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1955/ctl_6_
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1955/ctl_7_
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1955/ctl_8_
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1955/ctl_9_
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1955/ctl_10_
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1955/ctl_11_
ctl formula name PolyORBNT-COL-S05J30-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/1955/ctl_12_
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-S05J30"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J30.tgz
mv PolyORBNT-COL-S05J30 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;