About the Execution of LTSMin+red for DatabaseWithMutex-COL-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3492.920 | 364985.00 | 472468.00 | 723.40 | T??????????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r488-tall-171631131800025.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DatabaseWithMutex-COL-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631131800025
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.1K Apr 11 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 11 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 20:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 19:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 38K May 18 16:42 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 DatabaseWithMutex-COL-20-CTLCardinality-2024-00
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-01
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-02
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-03
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-04
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-05
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-06
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-07
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-08
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-09
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-10
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-11
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-12
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-13
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-14
FORMULA_NAME DatabaseWithMutex-COL-20-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717179603094
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:20:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:20:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:20:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 18:20:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 18:20:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 534 ms
[2024-05-31 18:20:04] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 3260 PT places and 3200.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2024-05-31 18:20:04] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 3 ms.
[2024-05-31 18:20:04] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40091 steps (8 resets) in 623 ms. (64 steps per ms) remains 20/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 86 ms. (46 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 90 ms. (43 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
// Phase 1: matrix 8 rows 11 cols
[2024-05-31 18:20:05] [INFO ] Computed 4 invariants in 6 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 18 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 10/19 variables, and 3 constraints, problems are : Problem set: 19 solved, 0 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/11 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 19 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 19 atomic propositions for a total of 16 simplifications.
FORMULA DatabaseWithMutex-COL-20-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 18:20:06] [INFO ] Flatten gal took : 13 ms
[2024-05-31 18:20:06] [INFO ] Flatten gal took : 2 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2024-05-31 18:20:06] [INFO ] Unfolded HLPN to a Petri net with 3260 places and 3200 transitions 23200 arcs in 84 ms.
[2024-05-31 18:20:06] [INFO ] Unfolded 15 HLPN properties in 3 ms.
Support contains 3260 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 30 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-31 18:20:06] [INFO ] Computed 460 invariants in 257 ms
[2024-05-31 18:20:07] [INFO ] Implicit Places using invariants in 1293 ms returned []
[2024-05-31 18:20:07] [INFO ] Invariant cache hit.
[2024-05-31 18:20:09] [INFO ] Implicit Places using invariants and state equation in 2239 ms returned []
Implicit Place search using SMT with State Equation took 3555 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:20:10] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32330ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32392ms
Finished structural reductions in LTL mode , in 1 iterations and 36010 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Support contains 3260 out of 3260 places after structural reductions.
[2024-05-31 18:20:43] [INFO ] Flatten gal took : 648 ms
[2024-05-31 18:20:43] [INFO ] Flatten gal took : 256 ms
[2024-05-31 18:20:44] [INFO ] Input system was already deterministic with 3200 transitions.
RANDOM walk for 40000 steps (8 resets) in 20300 ms. (1 steps per ms) remains 21/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 422 ms. (9 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 201 ms. (19 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 21/21 properties
[2024-05-31 18:20:50] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3260 variables, 59/59 constraints. Problems are: Problem set: 13 solved, 8 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/3260 variables, 401/460 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3260 variables, 0/460 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3200/6460 variables, 3260/3720 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6460 variables, 0/3720 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/6460 variables, 0/3720 constraints. Problems are: Problem set: 16 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6460/6460 variables, and 3720 constraints, problems are : Problem set: 16 solved, 5 unsolved in 4780 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 401/401 constraints, State Equation: 3260/3260 constraints, PredecessorRefiner: 14/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 20/20 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1640 variables, 0/20 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 859/2499 variables, 39/59 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2499 variables, 0/59 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 761/3260 variables, 401/460 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3260 variables, 0/460 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 3200/6460 variables, 3260/3720 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6460 variables, 3/3723 constraints. Problems are: Problem set: 16 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6460/6460 variables, and 3723 constraints, problems are : Problem set: 16 solved, 5 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 401/401 constraints, State Equation: 3260/3260 constraints, PredecessorRefiner: 5/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 12158ms problems are : Problem set: 16 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1640 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 372 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 3260/3260 places, 3200/3200 transitions.
RANDOM walk for 40000 steps (8 resets) in 2755 ms. (14 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 539 ms. (74 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 600 ms. (66 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 60255 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 5
Probabilistic random walk after 60255 steps, saw 55996 distinct states, run finished after 3015 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-31 18:21:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1640 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 859/2499 variables, 39/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2499 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 761/3260 variables, 401/460 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3260 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 3200/6460 variables, 3260/3720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6460 variables, 0/3720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/6460 variables, 0/3720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6460/6460 variables, and 3720 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6968 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 401/401 constraints, State Equation: 3260/3260 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1640 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 859/2499 variables, 39/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2499 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 761/3260 variables, 401/460 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3260 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 3200/6460 variables, 3260/3720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6460 variables, 3/3723 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6460/6460 variables, and 3723 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45036 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 401/401 constraints, State Equation: 3260/3260 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 52485ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1640 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 136 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 128 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:22:00] [INFO ] Invariant cache hit.
[2024-05-31 18:22:05] [INFO ] Implicit Places using invariants in 5631 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5660 ms to find 400 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 97 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5888 ms. Remains : 2860/3260 places, 3200/3200 transitions.
RANDOM walk for 40000 steps (8 resets) in 2899 ms. (13 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 543 ms. (73 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 597 ms. (66 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 55073 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 5
Probabilistic random walk after 55073 steps, saw 51398 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
// Phase 1: matrix 3200 rows 2860 cols
[2024-05-31 18:22:10] [INFO ] Computed 60 invariants in 369 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1640 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1207/2847 variables, 33/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2847 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 13/2860 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2860 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 3200/6060 variables, 2860/2920 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6060 variables, 0/2920 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/6060 variables, 0/2920 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6060/6060 variables, and 2920 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4710 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 2860/2860 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1640 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1207/2847 variables, 33/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:22:18] [INFO ] Deduced a trap composed of 31 places in 2192 ms of which 130 ms to minimize.
[2024-05-31 18:22:20] [INFO ] Deduced a trap composed of 31 places in 2364 ms of which 18 ms to minimize.
[2024-05-31 18:22:22] [INFO ] Deduced a trap composed of 31 places in 1877 ms of which 16 ms to minimize.
[2024-05-31 18:22:24] [INFO ] Deduced a trap composed of 31 places in 1571 ms of which 14 ms to minimize.
[2024-05-31 18:22:26] [INFO ] Deduced a trap composed of 31 places in 1518 ms of which 37 ms to minimize.
[2024-05-31 18:22:27] [INFO ] Deduced a trap composed of 31 places in 1366 ms of which 13 ms to minimize.
[2024-05-31 18:22:28] [INFO ] Deduced a trap composed of 31 places in 1237 ms of which 12 ms to minimize.
[2024-05-31 18:22:29] [INFO ] Deduced a trap composed of 31 places in 1062 ms of which 12 ms to minimize.
[2024-05-31 18:22:30] [INFO ] Deduced a trap composed of 31 places in 951 ms of which 10 ms to minimize.
[2024-05-31 18:22:31] [INFO ] Deduced a trap composed of 31 places in 834 ms of which 9 ms to minimize.
[2024-05-31 18:22:32] [INFO ] Deduced a trap composed of 31 places in 731 ms of which 8 ms to minimize.
[2024-05-31 18:22:33] [INFO ] Deduced a trap composed of 31 places in 711 ms of which 9 ms to minimize.
[2024-05-31 18:22:34] [INFO ] Deduced a trap composed of 31 places in 704 ms of which 8 ms to minimize.
[2024-05-31 18:22:34] [INFO ] Deduced a trap composed of 31 places in 718 ms of which 8 ms to minimize.
[2024-05-31 18:22:35] [INFO ] Deduced a trap composed of 31 places in 733 ms of which 9 ms to minimize.
[2024-05-31 18:22:36] [INFO ] Deduced a trap composed of 31 places in 699 ms of which 8 ms to minimize.
[2024-05-31 18:22:37] [INFO ] Deduced a trap composed of 31 places in 703 ms of which 8 ms to minimize.
[2024-05-31 18:22:37] [INFO ] Deduced a trap composed of 31 places in 700 ms of which 8 ms to minimize.
[2024-05-31 18:22:38] [INFO ] Deduced a trap composed of 31 places in 695 ms of which 9 ms to minimize.
[2024-05-31 18:22:39] [INFO ] Deduced a trap composed of 31 places in 699 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2847 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:22:40] [INFO ] Deduced a trap composed of 31 places in 772 ms of which 8 ms to minimize.
[2024-05-31 18:22:40] [INFO ] Deduced a trap composed of 31 places in 641 ms of which 7 ms to minimize.
[2024-05-31 18:22:41] [INFO ] Deduced a trap composed of 31 places in 653 ms of which 7 ms to minimize.
[2024-05-31 18:22:42] [INFO ] Deduced a trap composed of 31 places in 647 ms of which 8 ms to minimize.
[2024-05-31 18:22:42] [INFO ] Deduced a trap composed of 31 places in 649 ms of which 7 ms to minimize.
[2024-05-31 18:22:43] [INFO ] Deduced a trap composed of 31 places in 540 ms of which 6 ms to minimize.
[2024-05-31 18:22:44] [INFO ] Deduced a trap composed of 31 places in 543 ms of which 6 ms to minimize.
[2024-05-31 18:22:44] [INFO ] Deduced a trap composed of 31 places in 521 ms of which 6 ms to minimize.
[2024-05-31 18:22:45] [INFO ] Deduced a trap composed of 31 places in 509 ms of which 7 ms to minimize.
[2024-05-31 18:22:45] [INFO ] Deduced a trap composed of 31 places in 442 ms of which 6 ms to minimize.
[2024-05-31 18:22:46] [INFO ] Deduced a trap composed of 31 places in 462 ms of which 6 ms to minimize.
[2024-05-31 18:22:46] [INFO ] Deduced a trap composed of 31 places in 440 ms of which 6 ms to minimize.
[2024-05-31 18:22:47] [INFO ] Deduced a trap composed of 31 places in 366 ms of which 5 ms to minimize.
[2024-05-31 18:22:47] [INFO ] Deduced a trap composed of 31 places in 366 ms of which 5 ms to minimize.
[2024-05-31 18:22:47] [INFO ] Deduced a trap composed of 31 places in 400 ms of which 5 ms to minimize.
[2024-05-31 18:22:48] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 4 ms to minimize.
[2024-05-31 18:22:48] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 4 ms to minimize.
[2024-05-31 18:22:48] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 4 ms to minimize.
[2024-05-31 18:22:49] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 4 ms to minimize.
[2024-05-31 18:22:49] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2847 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:22:50] [INFO ] Deduced a trap composed of 31 places in 313 ms of which 4 ms to minimize.
[2024-05-31 18:22:50] [INFO ] Deduced a trap composed of 31 places in 320 ms of which 4 ms to minimize.
[2024-05-31 18:22:50] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 4 ms to minimize.
[2024-05-31 18:22:51] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 4 ms to minimize.
[2024-05-31 18:22:51] [INFO ] Deduced a trap composed of 31 places in 290 ms of which 4 ms to minimize.
[2024-05-31 18:22:51] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 3 ms to minimize.
[2024-05-31 18:22:52] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 4 ms to minimize.
[2024-05-31 18:22:52] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 4 ms to minimize.
[2024-05-31 18:22:52] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 3 ms to minimize.
[2024-05-31 18:22:52] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 4 ms to minimize.
[2024-05-31 18:22:53] [INFO ] Deduced a trap composed of 31 places in 307 ms of which 4 ms to minimize.
[2024-05-31 18:22:53] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 3 ms to minimize.
[2024-05-31 18:22:54] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 3 ms to minimize.
[2024-05-31 18:22:54] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 3 ms to minimize.
[2024-05-31 18:22:54] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 3 ms to minimize.
[2024-05-31 18:22:55] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 3 ms to minimize.
[2024-05-31 18:22:55] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 4 ms to minimize.
[2024-05-31 18:22:55] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 3 ms to minimize.
[2024-05-31 18:22:56] [INFO ] Deduced a trap composed of 31 places in 290 ms of which 4 ms to minimize.
[2024-05-31 18:22:56] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2847 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:22:56] [INFO ] Deduced a trap composed of 31 places in 290 ms of which 4 ms to minimize.
[2024-05-31 18:22:57] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 4 ms to minimize.
[2024-05-31 18:22:57] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 3 ms to minimize.
[2024-05-31 18:22:57] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 3 ms to minimize.
[2024-05-31 18:22:58] [INFO ] Deduced a trap composed of 31 places in 312 ms of which 4 ms to minimize.
[2024-05-31 18:22:58] [INFO ] Deduced a trap composed of 31 places in 282 ms of which 3 ms to minimize.
[2024-05-31 18:22:58] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 4 ms to minimize.
[2024-05-31 18:22:59] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 4 ms to minimize.
[2024-05-31 18:22:59] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 4 ms to minimize.
[2024-05-31 18:22:59] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 3 ms to minimize.
[2024-05-31 18:22:59] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 3 ms to minimize.
[2024-05-31 18:23:00] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 3 ms to minimize.
[2024-05-31 18:23:00] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 4 ms to minimize.
[2024-05-31 18:23:00] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 3 ms to minimize.
[2024-05-31 18:23:01] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 4 ms to minimize.
[2024-05-31 18:23:01] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 3 ms to minimize.
[2024-05-31 18:23:01] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 3 ms to minimize.
[2024-05-31 18:23:02] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 4 ms to minimize.
[2024-05-31 18:23:02] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 4 ms to minimize.
[2024-05-31 18:23:02] [INFO ] Deduced a trap composed of 31 places in 264 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2847 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:23:03] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 3 ms to minimize.
[2024-05-31 18:23:03] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 3 ms to minimize.
[2024-05-31 18:23:03] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 4 ms to minimize.
[2024-05-31 18:23:03] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 3 ms to minimize.
[2024-05-31 18:23:04] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 4 ms to minimize.
[2024-05-31 18:23:04] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 3 ms to minimize.
[2024-05-31 18:23:04] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 3 ms to minimize.
[2024-05-31 18:23:05] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 3 ms to minimize.
[2024-05-31 18:23:05] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 4 ms to minimize.
[2024-05-31 18:23:05] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 4 ms to minimize.
[2024-05-31 18:23:06] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 3 ms to minimize.
[2024-05-31 18:23:06] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 4 ms to minimize.
[2024-05-31 18:23:06] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 3 ms to minimize.
[2024-05-31 18:23:07] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 4 ms to minimize.
[2024-05-31 18:23:07] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 3 ms to minimize.
[2024-05-31 18:23:07] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 3 ms to minimize.
[2024-05-31 18:23:07] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 4 ms to minimize.
[2024-05-31 18:23:08] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 4 ms to minimize.
[2024-05-31 18:23:08] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 3 ms to minimize.
[2024-05-31 18:23:08] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2847 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:23:09] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 3 ms to minimize.
[2024-05-31 18:23:09] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 3 ms to minimize.
[2024-05-31 18:23:09] [INFO ] Deduced a trap composed of 31 places in 284 ms of which 3 ms to minimize.
[2024-05-31 18:23:10] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 3 ms to minimize.
[2024-05-31 18:23:10] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 3 ms to minimize.
[2024-05-31 18:23:10] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 3 ms to minimize.
[2024-05-31 18:23:10] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 4 ms to minimize.
[2024-05-31 18:23:11] [INFO ] Deduced a trap composed of 31 places in 290 ms of which 4 ms to minimize.
[2024-05-31 18:23:11] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 3 ms to minimize.
[2024-05-31 18:23:11] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 3 ms to minimize.
[2024-05-31 18:23:12] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 3 ms to minimize.
[2024-05-31 18:23:12] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 3 ms to minimize.
[2024-05-31 18:23:12] [INFO ] Deduced a trap composed of 31 places in 284 ms of which 3 ms to minimize.
[2024-05-31 18:23:13] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 3 ms to minimize.
[2024-05-31 18:23:13] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 3 ms to minimize.
[2024-05-31 18:23:13] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 4 ms to minimize.
[2024-05-31 18:23:14] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 3 ms to minimize.
[2024-05-31 18:23:14] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 3 ms to minimize.
[2024-05-31 18:23:14] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 3 ms to minimize.
[2024-05-31 18:23:15] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2847 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:23:15] [INFO ] Deduced a trap composed of 31 places in 281 ms of which 3 ms to minimize.
[2024-05-31 18:23:15] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 3 ms to minimize.
[2024-05-31 18:23:16] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 4 ms to minimize.
[2024-05-31 18:23:16] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 3 ms to minimize.
[2024-05-31 18:23:16] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 3 ms to minimize.
[2024-05-31 18:23:16] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 3 ms to minimize.
[2024-05-31 18:23:17] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 2 ms to minimize.
[2024-05-31 18:23:17] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 2 ms to minimize.
[2024-05-31 18:23:17] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 3 ms to minimize.
[2024-05-31 18:23:18] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 2 ms to minimize.
[2024-05-31 18:23:18] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 2 ms to minimize.
[2024-05-31 18:23:18] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 2 ms to minimize.
[2024-05-31 18:23:18] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 2 ms to minimize.
[2024-05-31 18:23:19] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 2 ms to minimize.
[2024-05-31 18:23:19] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2024-05-31 18:23:19] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
[2024-05-31 18:23:19] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 2 ms to minimize.
[2024-05-31 18:23:19] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 2 ms to minimize.
[2024-05-31 18:23:20] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 3 ms to minimize.
[2024-05-31 18:23:20] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2847 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:23:20] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 2 ms to minimize.
[2024-05-31 18:23:21] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 2 ms to minimize.
[2024-05-31 18:23:21] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2024-05-31 18:23:21] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 3 ms to minimize.
[2024-05-31 18:23:21] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
[2024-05-31 18:23:21] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 3 ms to minimize.
[2024-05-31 18:23:22] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2024-05-31 18:23:22] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2024-05-31 18:23:22] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 3 ms to minimize.
[2024-05-31 18:23:22] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 2 ms to minimize.
[2024-05-31 18:23:23] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 2 ms to minimize.
[2024-05-31 18:23:23] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 3 ms to minimize.
[2024-05-31 18:23:23] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 3 ms to minimize.
[2024-05-31 18:23:23] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
[2024-05-31 18:23:23] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 3 ms to minimize.
[2024-05-31 18:23:24] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 2 ms to minimize.
[2024-05-31 18:23:24] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 3 ms to minimize.
[2024-05-31 18:23:24] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 3 ms to minimize.
[2024-05-31 18:23:24] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 2 ms to minimize.
[2024-05-31 18:23:25] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2847 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:23:25] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 2 ms to minimize.
[2024-05-31 18:23:25] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 2 ms to minimize.
[2024-05-31 18:23:25] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2024-05-31 18:23:26] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 2 ms to minimize.
[2024-05-31 18:23:26] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 2 ms to minimize.
[2024-05-31 18:23:26] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 2 ms to minimize.
[2024-05-31 18:23:26] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 3 ms to minimize.
[2024-05-31 18:23:27] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 2 ms to minimize.
[2024-05-31 18:23:27] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 3 ms to minimize.
[2024-05-31 18:23:27] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 2 ms to minimize.
[2024-05-31 18:23:27] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 2 ms to minimize.
[2024-05-31 18:23:27] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 2 ms to minimize.
[2024-05-31 18:23:28] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 5 ms to minimize.
[2024-05-31 18:23:28] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 2 ms to minimize.
[2024-05-31 18:23:28] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 2 ms to minimize.
[2024-05-31 18:23:28] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 2 ms to minimize.
[2024-05-31 18:23:29] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 3 ms to minimize.
[2024-05-31 18:23:29] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 2 ms to minimize.
[2024-05-31 18:23:29] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-05-31 18:23:29] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2847 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:23:29] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-05-31 18:23:30] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 2 ms to minimize.
[2024-05-31 18:23:30] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 2 ms to minimize.
[2024-05-31 18:23:30] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-05-31 18:23:30] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 2 ms to minimize.
SMT process timed out in 80553ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1640 out of 2860 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Applied a total of 0 rules in 94 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 2860/2860 places, 3200/3200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Applied a total of 0 rules in 87 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:23:30] [INFO ] Invariant cache hit.
[2024-05-31 18:23:33] [INFO ] Implicit Places using invariants in 2486 ms returned []
[2024-05-31 18:23:33] [INFO ] Invariant cache hit.
[2024-05-31 18:24:09] [INFO ] Performed 1722/2860 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-31 18:24:39] [INFO ] Performed 1964/2860 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-05-31 18:24:50] [INFO ] Implicit Places using invariants and state equation in 77348 ms returned []
Implicit Place search using SMT with State Equation took 79850 ms to find 0 implicit places.
[2024-05-31 18:24:50] [INFO ] Redundant transitions in 194 ms returned []
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:24:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2840/6060 variables, and 39 constraints, problems are : Problem set: 0 solved, 2800 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 39/53 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/2860 constraints, PredecessorRefiner: 2800/2800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-31 18:25:25] [INFO ] Deduced a trap composed of 31 places in 699 ms of which 8 ms to minimize.
[2024-05-31 18:25:26] [INFO ] Deduced a trap composed of 31 places in 755 ms of which 8 ms to minimize.
[2024-05-31 18:25:27] [INFO ] Deduced a trap composed of 31 places in 658 ms of which 7 ms to minimize.
[2024-05-31 18:25:27] [INFO ] Deduced a trap composed of 31 places in 650 ms of which 7 ms to minimize.
[2024-05-31 18:25:28] [INFO ] Deduced a trap composed of 31 places in 562 ms of which 6 ms to minimize.
[2024-05-31 18:25:29] [INFO ] Deduced a trap composed of 31 places in 500 ms of which 6 ms to minimize.
[2024-05-31 18:25:29] [INFO ] Deduced a trap composed of 31 places in 480 ms of which 6 ms to minimize.
[2024-05-31 18:25:30] [INFO ] Deduced a trap composed of 31 places in 387 ms of which 5 ms to minimize.
[2024-05-31 18:25:30] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 5 ms to minimize.
[2024-05-31 18:25:30] [INFO ] Deduced a trap composed of 31 places in 391 ms of which 4 ms to minimize.
[2024-05-31 18:25:31] [INFO ] Deduced a trap composed of 31 places in 404 ms of which 5 ms to minimize.
[2024-05-31 18:25:31] [INFO ] Deduced a trap composed of 31 places in 402 ms of which 5 ms to minimize.
[2024-05-31 18:25:32] [INFO ] Deduced a trap composed of 31 places in 412 ms of which 5 ms to minimize.
[2024-05-31 18:25:32] [INFO ] Deduced a trap composed of 31 places in 379 ms of which 5 ms to minimize.
[2024-05-31 18:25:33] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 5 ms to minimize.
[2024-05-31 18:25:33] [INFO ] Deduced a trap composed of 31 places in 358 ms of which 4 ms to minimize.
[2024-05-31 18:25:33] [INFO ] Deduced a trap composed of 31 places in 348 ms of which 4 ms to minimize.
[2024-05-31 18:25:34] [INFO ] Deduced a trap composed of 31 places in 313 ms of which 4 ms to minimize.
[2024-05-31 18:25:34] [INFO ] Deduced a trap composed of 31 places in 317 ms of which 4 ms to minimize.
[2024-05-31 18:25:34] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2840 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-31 18:25:36] [INFO ] Deduced a trap composed of 31 places in 735 ms of which 8 ms to minimize.
[2024-05-31 18:25:37] [INFO ] Deduced a trap composed of 31 places in 753 ms of which 8 ms to minimize.
[2024-05-31 18:25:38] [INFO ] Deduced a trap composed of 31 places in 751 ms of which 7 ms to minimize.
[2024-05-31 18:25:38] [INFO ] Deduced a trap composed of 31 places in 672 ms of which 7 ms to minimize.
[2024-05-31 18:25:39] [INFO ] Deduced a trap composed of 31 places in 777 ms of which 9 ms to minimize.
[2024-05-31 18:25:40] [INFO ] Deduced a trap composed of 31 places in 773 ms of which 8 ms to minimize.
[2024-05-31 18:25:41] [INFO ] Deduced a trap composed of 31 places in 725 ms of which 7 ms to minimize.
[2024-05-31 18:25:42] [INFO ] Deduced a trap composed of 31 places in 710 ms of which 7 ms to minimize.
[2024-05-31 18:25:42] [INFO ] Deduced a trap composed of 31 places in 687 ms of which 7 ms to minimize.
[2024-05-31 18:25:43] [INFO ] Deduced a trap composed of 31 places in 650 ms of which 7 ms to minimize.
[2024-05-31 18:25:44] [INFO ] Deduced a trap composed of 31 places in 624 ms of which 6 ms to minimize.
[2024-05-31 18:25:44] [INFO ] Deduced a trap composed of 31 places in 597 ms of which 6 ms to minimize.
[2024-05-31 18:25:45] [INFO ] Deduced a trap composed of 31 places in 651 ms of which 7 ms to minimize.
[2024-05-31 18:25:46] [INFO ] Deduced a trap composed of 62 places in 719 ms of which 7 ms to minimize.
[2024-05-31 18:25:46] [INFO ] Deduced a trap composed of 31 places in 689 ms of which 7 ms to minimize.
[2024-05-31 18:25:47] [INFO ] Deduced a trap composed of 31 places in 661 ms of which 7 ms to minimize.
[2024-05-31 18:25:48] [INFO ] Deduced a trap composed of 31 places in 666 ms of which 6 ms to minimize.
[2024-05-31 18:25:49] [INFO ] Deduced a trap composed of 31 places in 649 ms of which 7 ms to minimize.
[2024-05-31 18:25:49] [INFO ] Deduced a trap composed of 31 places in 675 ms of which 7 ms to minimize.
[2024-05-31 18:25:50] [INFO ] Deduced a trap composed of 31 places in 655 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2840 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-31 18:25:52] [INFO ] Deduced a trap composed of 31 places in 763 ms of which 9 ms to minimize.
[2024-05-31 18:25:52] [INFO ] Deduced a trap composed of 31 places in 767 ms of which 8 ms to minimize.
[2024-05-31 18:25:53] [INFO ] Deduced a trap composed of 31 places in 760 ms of which 8 ms to minimize.
SMT process timed out in 62758ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 62790ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142949 ms. Remains : 2860/2860 places, 3200/3200 transitions.
Successfully simplified 16 atomic propositions for a total of 15 simplifications.
[2024-05-31 18:25:54] [INFO ] Flatten gal took : 185 ms
[2024-05-31 18:25:54] [INFO ] Flatten gal took : 195 ms
[2024-05-31 18:25:54] [INFO ] Input system was already deterministic with 3200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 115 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 3260/3260 places, 3200/3200 transitions.
[2024-05-31 18:25:55] [INFO ] Flatten gal took : 182 ms
[2024-05-31 18:25:55] [INFO ] Flatten gal took : 189 ms
[2024-05-31 18:25:55] [INFO ] Input system was already deterministic with 3200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 129 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 3260/3260 places, 3200/3200 transitions.
[2024-05-31 18:25:55] [INFO ] Flatten gal took : 165 ms
[2024-05-31 18:25:56] [INFO ] Flatten gal took : 191 ms
[2024-05-31 18:25:56] [INFO ] Input system was already deterministic with 3200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 68 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 3260/3260 places, 3200/3200 transitions.
[2024-05-31 18:25:56] [INFO ] Flatten gal took : 181 ms
[2024-05-31 18:25:56] [INFO ] Flatten gal took : 169 ms
[2024-05-31 18:25:57] [INFO ] Input system was already deterministic with 3200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 2800
Reduce places removed 420 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 1 with 820 rules applied. Total rules applied 1220 place count 2840 transition count 2400
Reduce places removed 400 places and 0 transitions.
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Iterating post reduction 2 with 800 rules applied. Total rules applied 2020 place count 2440 transition count 2000
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 3 with 400 rules applied. Total rules applied 2420 place count 2040 transition count 2000
Applied a total of 2420 rules in 312 ms. Remains 2040 /3260 variables (removed 1220) and now considering 2000/3200 (removed 1200) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 312 ms. Remains : 2040/3260 places, 2000/3200 transitions.
[2024-05-31 18:25:57] [INFO ] Flatten gal took : 148 ms
[2024-05-31 18:25:57] [INFO ] Flatten gal took : 156 ms
[2024-05-31 18:25:58] [INFO ] Input system was already deterministic with 2000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 82 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 3260/3260 places, 3200/3200 transitions.
[2024-05-31 18:25:58] [INFO ] Flatten gal took : 182 ms
[2024-05-31 18:25:58] [INFO ] Flatten gal took : 168 ms
[2024-05-31 18:25:58] [INFO ] Input system was already deterministic with 3200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 87 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 3260/3260 places, 3200/3200 transitions.
[2024-05-31 18:25:59] [INFO ] Flatten gal took : 179 ms
[2024-05-31 18:25:59] [INFO ] Flatten gal took : 192 ms
[2024-05-31 18:25:59] [INFO ] Input system was already deterministic with 3200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 800 Pre rules applied. Total rules applied 0 place count 3260 transition count 2400
Deduced a syphon composed of 800 places in 1 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 0 with 1600 rules applied. Total rules applied 1600 place count 2460 transition count 2400
Applied a total of 1600 rules in 376 ms. Remains 2460 /3260 variables (removed 800) and now considering 2400/3200 (removed 800) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 377 ms. Remains : 2460/3260 places, 2400/3200 transitions.
[2024-05-31 18:26:00] [INFO ] Flatten gal took : 134 ms
[2024-05-31 18:26:00] [INFO ] Flatten gal took : 148 ms
[2024-05-31 18:26:00] [INFO ] Input system was already deterministic with 2400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 112 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 3260/3260 places, 3200/3200 transitions.
[2024-05-31 18:26:01] [INFO ] Flatten gal took : 178 ms
[2024-05-31 18:26:01] [INFO ] Flatten gal took : 183 ms
[2024-05-31 18:26:01] [INFO ] Input system was already deterministic with 3200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 2800
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2860 transition count 2800
Applied a total of 800 rules in 224 ms. Remains 2860 /3260 variables (removed 400) and now considering 2800/3200 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 224 ms. Remains : 2860/3260 places, 2800/3200 transitions.
[2024-05-31 18:26:01] [INFO ] Flatten gal took : 157 ms
[2024-05-31 18:26:02] [INFO ] Flatten gal took : 166 ms
[2024-05-31 18:26:02] [INFO ] Input system was already deterministic with 2800 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 113 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 3260/3260 places, 3200/3200 transitions.
[2024-05-31 18:26:02] [INFO ] Flatten gal took : 161 ms
[2024-05-31 18:26:02] [INFO ] Flatten gal took : 168 ms
[2024-05-31 18:26:03] [INFO ] Input system was already deterministic with 3200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 64 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 3260/3260 places, 3200/3200 transitions.
[2024-05-31 18:26:03] [INFO ] Flatten gal took : 173 ms
[2024-05-31 18:26:03] [INFO ] Flatten gal took : 182 ms
[2024-05-31 18:26:03] [INFO ] Input system was already deterministic with 3200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 17 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 3260/3260 places, 3200/3200 transitions.
[2024-05-31 18:26:04] [INFO ] Flatten gal took : 163 ms
[2024-05-31 18:26:04] [INFO ] Flatten gal took : 173 ms
[2024-05-31 18:26:04] [INFO ] Input system was already deterministic with 3200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 2800
Reduce places removed 420 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 1 with 820 rules applied. Total rules applied 1220 place count 2840 transition count 2400
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 2 with 400 rules applied. Total rules applied 1620 place count 2440 transition count 2400
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1620 place count 2440 transition count 2000
Deduced a syphon composed of 400 places in 0 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 2420 place count 2040 transition count 2000
Applied a total of 2420 rules in 157 ms. Remains 2040 /3260 variables (removed 1220) and now considering 2000/3200 (removed 1200) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 157 ms. Remains : 2040/3260 places, 2000/3200 transitions.
[2024-05-31 18:26:04] [INFO ] Flatten gal took : 147 ms
[2024-05-31 18:26:05] [INFO ] Flatten gal took : 155 ms
[2024-05-31 18:26:05] [INFO ] Input system was already deterministic with 2000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 107 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 3260/3260 places, 3200/3200 transitions.
[2024-05-31 18:26:05] [INFO ] Flatten gal took : 166 ms
[2024-05-31 18:26:05] [INFO ] Flatten gal took : 173 ms
[2024-05-31 18:26:06] [INFO ] Input system was already deterministic with 3200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 143 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 3260/3260 places, 3200/3200 transitions.
[2024-05-31 18:26:06] [INFO ] Flatten gal took : 179 ms
[2024-05-31 18:26:06] [INFO ] Flatten gal took : 187 ms
[2024-05-31 18:26:07] [INFO ] Input system was already deterministic with 3200 transitions.
[2024-05-31 18:26:07] [INFO ] Flatten gal took : 175 ms
[2024-05-31 18:26:07] [INFO ] Flatten gal took : 179 ms
[2024-05-31 18:26:07] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 7 ms.
[2024-05-31 18:26:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3260 places, 3200 transitions and 23200 arcs took 22 ms.
Total runtime 363443 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-01
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-02
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-03
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-04
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-05
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-06
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-07
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-08
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-09
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-10
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-11
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-12
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-13
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-14
Could not compute solution for formula : DatabaseWithMutex-COL-20-CTLCardinality-2024-15
BK_STOP 1717179968079
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1271/ctl_0_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1271/ctl_1_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1271/ctl_2_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1271/ctl_3_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1271/ctl_4_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1271/ctl_5_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1271/ctl_6_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1271/ctl_7_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1271/ctl_8_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1271/ctl_9_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1271/ctl_10_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/1271/ctl_11_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/1271/ctl_12_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1271/ctl_13_
ctl formula name DatabaseWithMutex-COL-20-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/1271/ctl_14_
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="DatabaseWithMutex-COL-20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DatabaseWithMutex-COL-20, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631131800025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-20.tgz
mv DatabaseWithMutex-COL-20 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;