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.r476-tall-171620505000025.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 CANConstruction-PT-030, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505000025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 18:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 18:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 CANConstruction-PT-030-CTLCardinality-2024-00
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-01
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-02
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-03
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-04
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-05
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-06
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-07
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-08
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-09
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-10
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-11
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2023-12
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2023-13
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2023-14
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717178263238

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 17:57:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 17:57:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 17:57:44] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2024-05-31 17:57:44] [INFO ] Transformed 2162 places.
[2024-05-31 17:57:44] [INFO ] Transformed 3840 transitions.
[2024-05-31 17:57:44] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 124 out of 2162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 786 places :
Symmetric choice reduction at 0 with 786 rule applications. Total rules 786 place count 1376 transition count 2268
Iterating global reduction 0 with 786 rules applied. Total rules applied 1572 place count 1376 transition count 2268
Applied a total of 1572 rules in 288 ms. Remains 1376 /2162 variables (removed 786) and now considering 2268/3840 (removed 1572) transitions.
// Phase 1: matrix 2268 rows 1376 cols
[2024-05-31 17:57:45] [INFO ] Computed 61 invariants in 42 ms
[2024-05-31 17:57:46] [INFO ] Implicit Places using invariants in 1018 ms returned [12, 26, 40, 54, 68, 82, 96, 124, 138, 152, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1051 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1348/2162 places, 2268/3840 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1326 transition count 2246
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1326 transition count 2246
Applied a total of 44 rules in 163 ms. Remains 1326 /1348 variables (removed 22) and now considering 2246/2268 (removed 22) transitions.
// Phase 1: matrix 2246 rows 1326 cols
[2024-05-31 17:57:46] [INFO ] Computed 33 invariants in 14 ms
[2024-05-31 17:57:47] [INFO ] Implicit Places using invariants in 837 ms returned []
[2024-05-31 17:57:47] [INFO ] Invariant cache hit.
[2024-05-31 17:57:47] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 17:57:55] [INFO ] Implicit Places using invariants and state equation in 7848 ms returned []
Implicit Place search using SMT with State Equation took 8696 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1326/2162 places, 2246/3840 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10219 ms. Remains : 1326/2162 places, 2246/3840 transitions.
Support contains 124 out of 1326 places after structural reductions.
[2024-05-31 17:57:55] [INFO ] Flatten gal took : 153 ms
[2024-05-31 17:57:55] [INFO ] Flatten gal took : 102 ms
[2024-05-31 17:57:55] [INFO ] Input system was already deterministic with 2246 transitions.
RANDOM walk for 40000 steps (74 resets) in 2588 ms. (15 steps per ms) remains 17/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
[2024-05-31 17:57:56] [INFO ] Invariant cache hit.
[2024-05-31 17:57:56] [INFO ] State equation strengthened by 1770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 1284/1311 variables, 18/18 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1311 variables, 1/19 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1311 variables, 0/19 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 13/1324 variables, 13/32 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1324 variables, 0/32 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/1325 variables, 1/33 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1325 variables, 0/33 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2246/3571 variables, 1325/1358 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3571 variables, 1770/3128 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3571 variables, 0/3128 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/3572 variables, 1/3129 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3572 variables, 0/3129 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/3572 variables, 0/3129 constraints. Problems are: Problem set: 13 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3572/3572 variables, and 3129 constraints, problems are : Problem set: 13 solved, 4 unsolved in 2022 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1326/1326 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1292/1306 variables, 13/13 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1306 variables, 1/14 constraints. Problems are: Problem set: 13 solved, 4 unsolved
[2024-05-31 17:57:59] [INFO ] Deduced a trap composed of 5 places in 621 ms of which 63 ms to minimize.
[2024-05-31 17:58:00] [INFO ] Deduced a trap composed of 5 places in 533 ms of which 13 ms to minimize.
[2024-05-31 17:58:00] [INFO ] Deduced a trap composed of 5 places in 517 ms of which 7 ms to minimize.
[2024-05-31 17:58:01] [INFO ] Deduced a trap composed of 5 places in 560 ms of which 7 ms to minimize.
[2024-05-31 17:58:01] [INFO ] Deduced a trap composed of 5 places in 565 ms of which 8 ms to minimize.
[2024-05-31 17:58:02] [INFO ] Deduced a trap composed of 5 places in 545 ms of which 7 ms to minimize.
[2024-05-31 17:58:03] [INFO ] Deduced a trap composed of 5 places in 525 ms of which 7 ms to minimize.
[2024-05-31 17:58:03] [INFO ] Deduced a trap composed of 5 places in 536 ms of which 7 ms to minimize.
[2024-05-31 17:58:04] [INFO ] Deduced a trap composed of 5 places in 501 ms of which 7 ms to minimize.
SMT process timed out in 7441ms, After SMT, problems are : Problem set: 13 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 1326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 1326 transition count 2058
Reduce places removed 188 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 190 rules applied. Total rules applied 378 place count 1138 transition count 2056
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 380 place count 1136 transition count 2056
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 380 place count 1136 transition count 2027
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 438 place count 1107 transition count 2027
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 489 place count 1056 transition count 1925
Iterating global reduction 3 with 51 rules applied. Total rules applied 540 place count 1056 transition count 1925
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 24 rules applied. Total rules applied 564 place count 1056 transition count 1901
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 588 place count 1032 transition count 1901
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 642 place count 1005 transition count 1874
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 647 place count 1005 transition count 1869
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 652 place count 1000 transition count 1869
Applied a total of 652 rules in 490 ms. Remains 1000 /1326 variables (removed 326) and now considering 1869/2246 (removed 377) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 490 ms. Remains : 1000/1326 places, 1869/2246 transitions.
RANDOM walk for 40000 steps (187 resets) in 724 ms. (55 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
// Phase 1: matrix 1869 rows 1000 cols
[2024-05-31 17:58:05] [INFO ] Computed 33 invariants in 14 ms
[2024-05-31 17:58:05] [INFO ] State equation strengthened by 1771 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 966/978 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/978 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/978 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 20/998 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/998 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/999 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1869/2868 variables, 999/1032 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2868 variables, 1771/2803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2868 variables, 0/2803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/2869 variables, 1/2804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2869 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2869 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2869/2869 variables, and 2804 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1321 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1000/1000 constraints, ReadFeed: 1771/1771 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 966/978 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/978 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:58:06] [INFO ] Deduced a trap composed of 2 places in 349 ms of which 5 ms to minimize.
[2024-05-31 17:58:07] [INFO ] Deduced a trap composed of 2 places in 364 ms of which 5 ms to minimize.
[2024-05-31 17:58:07] [INFO ] Deduced a trap composed of 2 places in 367 ms of which 6 ms to minimize.
[2024-05-31 17:58:08] [INFO ] Deduced a trap composed of 2 places in 365 ms of which 5 ms to minimize.
[2024-05-31 17:58:08] [INFO ] Deduced a trap composed of 2 places in 368 ms of which 5 ms to minimize.
[2024-05-31 17:58:08] [INFO ] Deduced a trap composed of 2 places in 368 ms of which 5 ms to minimize.
[2024-05-31 17:58:09] [INFO ] Deduced a trap composed of 2 places in 375 ms of which 5 ms to minimize.
[2024-05-31 17:58:09] [INFO ] Deduced a trap composed of 2 places in 391 ms of which 5 ms to minimize.
[2024-05-31 17:58:10] [INFO ] Deduced a trap composed of 2 places in 398 ms of which 5 ms to minimize.
[2024-05-31 17:58:10] [INFO ] Deduced a trap composed of 2 places in 397 ms of which 5 ms to minimize.
[2024-05-31 17:58:10] [INFO ] Deduced a trap composed of 2 places in 358 ms of which 5 ms to minimize.
[2024-05-31 17:58:11] [INFO ] Deduced a trap composed of 2 places in 386 ms of which 5 ms to minimize.
[2024-05-31 17:58:11] [INFO ] Deduced a trap composed of 2 places in 397 ms of which 6 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 2 places in 369 ms of which 5 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/978 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/978 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/998 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 37 places in 483 ms of which 7 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 33 places in 475 ms of which 7 ms to minimize.
[2024-05-31 17:58:14] [INFO ] Deduced a trap composed of 33 places in 490 ms of which 6 ms to minimize.
[2024-05-31 17:58:14] [INFO ] Deduced a trap composed of 33 places in 492 ms of which 7 ms to minimize.
[2024-05-31 17:58:15] [INFO ] Deduced a trap composed of 33 places in 493 ms of which 7 ms to minimize.
[2024-05-31 17:58:15] [INFO ] Deduced a trap composed of 33 places in 489 ms of which 7 ms to minimize.
[2024-05-31 17:58:16] [INFO ] Deduced a trap composed of 37 places in 480 ms of which 8 ms to minimize.
[2024-05-31 17:58:16] [INFO ] Deduced a trap composed of 35 places in 471 ms of which 7 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 34 places in 467 ms of which 7 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 37 places in 419 ms of which 7 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 33 places in 447 ms of which 6 ms to minimize.
[2024-05-31 17:58:18] [INFO ] Deduced a trap composed of 33 places in 475 ms of which 7 ms to minimize.
[2024-05-31 17:58:18] [INFO ] Deduced a trap composed of 33 places in 479 ms of which 6 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 35 places in 506 ms of which 7 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 33 places in 490 ms of which 7 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 33 places in 444 ms of which 6 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 33 places in 476 ms of which 6 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 33 places in 465 ms of which 6 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 33 places in 436 ms of which 7 ms to minimize.
[2024-05-31 17:58:22] [INFO ] Deduced a trap composed of 34 places in 439 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/998 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:58:22] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 6 ms to minimize.
[2024-05-31 17:58:23] [INFO ] Deduced a trap composed of 35 places in 428 ms of which 6 ms to minimize.
[2024-05-31 17:58:23] [INFO ] Deduced a trap composed of 33 places in 378 ms of which 7 ms to minimize.
[2024-05-31 17:58:24] [INFO ] Deduced a trap composed of 37 places in 461 ms of which 7 ms to minimize.
[2024-05-31 17:58:24] [INFO ] Deduced a trap composed of 37 places in 476 ms of which 6 ms to minimize.
[2024-05-31 17:58:25] [INFO ] Deduced a trap composed of 33 places in 438 ms of which 6 ms to minimize.
[2024-05-31 17:58:25] [INFO ] Deduced a trap composed of 33 places in 444 ms of which 6 ms to minimize.
[2024-05-31 17:58:25] [INFO ] Deduced a trap composed of 33 places in 445 ms of which 6 ms to minimize.
[2024-05-31 17:58:26] [INFO ] Deduced a trap composed of 33 places in 421 ms of which 7 ms to minimize.
[2024-05-31 17:58:26] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 6 ms to minimize.
[2024-05-31 17:58:27] [INFO ] Deduced a trap composed of 39 places in 428 ms of which 7 ms to minimize.
[2024-05-31 17:58:27] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 6 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 6 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 33 places in 468 ms of which 7 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 37 places in 464 ms of which 6 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 33 places in 459 ms of which 6 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 33 places in 454 ms of which 6 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 33 places in 456 ms of which 6 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 33 places in 451 ms of which 7 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 33 places in 455 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/998 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 36 places in 371 ms of which 5 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 35 places in 383 ms of which 6 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 33 places in 385 ms of which 6 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 34 places in 385 ms of which 6 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 34 places in 379 ms of which 6 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 34 places in 378 ms of which 6 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 33 places in 382 ms of which 6 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 33 places in 383 ms of which 6 ms to minimize.
[2024-05-31 17:58:35] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 5 ms to minimize.
[2024-05-31 17:58:35] [INFO ] Deduced a trap composed of 38 places in 378 ms of which 6 ms to minimize.
[2024-05-31 17:58:35] [INFO ] Deduced a trap composed of 37 places in 372 ms of which 6 ms to minimize.
[2024-05-31 17:58:36] [INFO ] Deduced a trap composed of 38 places in 356 ms of which 6 ms to minimize.
[2024-05-31 17:58:36] [INFO ] Deduced a trap composed of 36 places in 360 ms of which 6 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 33 places in 352 ms of which 6 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 33 places in 360 ms of which 6 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 33 places in 362 ms of which 6 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 33 places in 350 ms of which 6 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 33 places in 347 ms of which 6 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 38 places in 369 ms of which 6 ms to minimize.
[2024-05-31 17:58:39] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/998 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:58:39] [INFO ] Deduced a trap composed of 33 places in 337 ms of which 6 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 33 places in 332 ms of which 6 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 6 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 5 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 6 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 33 places in 326 ms of which 6 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 33 places in 332 ms of which 5 ms to minimize.
[2024-05-31 17:58:42] [INFO ] Deduced a trap composed of 33 places in 390 ms of which 6 ms to minimize.
[2024-05-31 17:58:42] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 6 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 33 places in 400 ms of which 6 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 38 places in 367 ms of which 5 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 39 places in 392 ms of which 6 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 33 places in 374 ms of which 6 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 34 places in 376 ms of which 6 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 34 places in 380 ms of which 6 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 38 places in 369 ms of which 6 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 35 places in 385 ms of which 6 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 33 places in 373 ms of which 5 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 33 places in 360 ms of which 5 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 35 places in 366 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/998 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:58:47] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 6 ms to minimize.
[2024-05-31 17:58:47] [INFO ] Deduced a trap composed of 33 places in 439 ms of which 7 ms to minimize.
[2024-05-31 17:58:48] [INFO ] Deduced a trap composed of 33 places in 402 ms of which 5 ms to minimize.
[2024-05-31 17:58:48] [INFO ] Deduced a trap composed of 33 places in 399 ms of which 7 ms to minimize.
[2024-05-31 17:58:49] [INFO ] Deduced a trap composed of 33 places in 375 ms of which 6 ms to minimize.
[2024-05-31 17:58:49] [INFO ] Deduced a trap composed of 35 places in 385 ms of which 6 ms to minimize.
[2024-05-31 17:58:49] [INFO ] Deduced a trap composed of 33 places in 378 ms of which 6 ms to minimize.
[2024-05-31 17:58:50] [INFO ] Deduced a trap composed of 34 places in 368 ms of which 6 ms to minimize.
[2024-05-31 17:58:50] [INFO ] Deduced a trap composed of 33 places in 358 ms of which 6 ms to minimize.
[2024-05-31 17:58:51] [INFO ] Deduced a trap composed of 36 places in 365 ms of which 6 ms to minimize.
[2024-05-31 17:58:51] [INFO ] Deduced a trap composed of 33 places in 358 ms of which 5 ms to minimize.
SMT process timed out in 46494ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1869/1869 transitions.
Applied a total of 0 rules in 81 ms. Remains 1000 /1000 variables (removed 0) and now considering 1869/1869 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1000/1000 places, 1869/1869 transitions.
RANDOM walk for 40000 steps (192 resets) in 493 ms. (80 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
[2024-05-31 17:58:51] [INFO ] Invariant cache hit.
[2024-05-31 17:58:51] [INFO ] State equation strengthened by 1771 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 966/976 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/976 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/976 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 22/998 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/998 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/999 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1869/2868 variables, 999/1032 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2868 variables, 1771/2803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2868 variables, 0/2803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/2869 variables, 1/2804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2869 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2869 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2869/2869 variables, and 2804 constraints, problems are : Problem set: 0 solved, 2 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1000/1000 constraints, ReadFeed: 1771/1771 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 966/976 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/976 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 17:58:53] [INFO ] Deduced a trap composed of 2 places in 373 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/976 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/998 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 17:58:53] [INFO ] Deduced a trap composed of 38 places in 520 ms of which 7 ms to minimize.
[2024-05-31 17:58:54] [INFO ] Deduced a trap composed of 36 places in 509 ms of which 6 ms to minimize.
[2024-05-31 17:58:54] [INFO ] Deduced a trap composed of 35 places in 524 ms of which 6 ms to minimize.
[2024-05-31 17:58:55] [INFO ] Deduced a trap composed of 38 places in 506 ms of which 6 ms to minimize.
[2024-05-31 17:58:56] [INFO ] Deduced a trap composed of 36 places in 503 ms of which 7 ms to minimize.
[2024-05-31 17:58:56] [INFO ] Deduced a trap composed of 34 places in 518 ms of which 6 ms to minimize.
[2024-05-31 17:58:57] [INFO ] Deduced a trap composed of 36 places in 514 ms of which 6 ms to minimize.
[2024-05-31 17:58:57] [INFO ] Deduced a trap composed of 39 places in 509 ms of which 6 ms to minimize.
[2024-05-31 17:58:58] [INFO ] Deduced a trap composed of 33 places in 480 ms of which 6 ms to minimize.
[2024-05-31 17:58:58] [INFO ] Deduced a trap composed of 33 places in 491 ms of which 6 ms to minimize.
[2024-05-31 17:58:59] [INFO ] Deduced a trap composed of 38 places in 491 ms of which 6 ms to minimize.
[2024-05-31 17:58:59] [INFO ] Deduced a trap composed of 33 places in 498 ms of which 6 ms to minimize.
[2024-05-31 17:59:00] [INFO ] Deduced a trap composed of 33 places in 492 ms of which 6 ms to minimize.
[2024-05-31 17:59:00] [INFO ] Deduced a trap composed of 38 places in 494 ms of which 7 ms to minimize.
[2024-05-31 17:59:01] [INFO ] Deduced a trap composed of 33 places in 499 ms of which 6 ms to minimize.
[2024-05-31 17:59:01] [INFO ] Deduced a trap composed of 33 places in 508 ms of which 7 ms to minimize.
[2024-05-31 17:59:02] [INFO ] Deduced a trap composed of 33 places in 502 ms of which 7 ms to minimize.
[2024-05-31 17:59:02] [INFO ] Deduced a trap composed of 33 places in 472 ms of which 6 ms to minimize.
[2024-05-31 17:59:03] [INFO ] Deduced a trap composed of 33 places in 481 ms of which 6 ms to minimize.
[2024-05-31 17:59:03] [INFO ] Deduced a trap composed of 35 places in 464 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/998 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 17:59:04] [INFO ] Deduced a trap composed of 33 places in 482 ms of which 6 ms to minimize.
[2024-05-31 17:59:04] [INFO ] Deduced a trap composed of 33 places in 444 ms of which 6 ms to minimize.
[2024-05-31 17:59:05] [INFO ] Deduced a trap composed of 33 places in 422 ms of which 8 ms to minimize.
[2024-05-31 17:59:05] [INFO ] Deduced a trap composed of 33 places in 399 ms of which 6 ms to minimize.
[2024-05-31 17:59:05] [INFO ] Deduced a trap composed of 33 places in 400 ms of which 6 ms to minimize.
[2024-05-31 17:59:06] [INFO ] Deduced a trap composed of 33 places in 398 ms of which 6 ms to minimize.
[2024-05-31 17:59:06] [INFO ] Deduced a trap composed of 33 places in 402 ms of which 6 ms to minimize.
[2024-05-31 17:59:07] [INFO ] Deduced a trap composed of 33 places in 394 ms of which 7 ms to minimize.
[2024-05-31 17:59:07] [INFO ] Deduced a trap composed of 38 places in 394 ms of which 6 ms to minimize.
[2024-05-31 17:59:08] [INFO ] Deduced a trap composed of 37 places in 387 ms of which 6 ms to minimize.
[2024-05-31 17:59:08] [INFO ] Deduced a trap composed of 36 places in 392 ms of which 6 ms to minimize.
[2024-05-31 17:59:08] [INFO ] Deduced a trap composed of 33 places in 379 ms of which 7 ms to minimize.
[2024-05-31 17:59:09] [INFO ] Deduced a trap composed of 33 places in 384 ms of which 6 ms to minimize.
[2024-05-31 17:59:09] [INFO ] Deduced a trap composed of 33 places in 386 ms of which 6 ms to minimize.
[2024-05-31 17:59:10] [INFO ] Deduced a trap composed of 33 places in 407 ms of which 7 ms to minimize.
[2024-05-31 17:59:10] [INFO ] Deduced a trap composed of 38 places in 368 ms of which 6 ms to minimize.
[2024-05-31 17:59:10] [INFO ] Deduced a trap composed of 38 places in 359 ms of which 5 ms to minimize.
[2024-05-31 17:59:11] [INFO ] Deduced a trap composed of 38 places in 396 ms of which 6 ms to minimize.
[2024-05-31 17:59:11] [INFO ] Deduced a trap composed of 33 places in 365 ms of which 6 ms to minimize.
[2024-05-31 17:59:11] [INFO ] Deduced a trap composed of 34 places in 351 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/998 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 17:59:12] [INFO ] Deduced a trap composed of 33 places in 349 ms of which 6 ms to minimize.
[2024-05-31 17:59:12] [INFO ] Deduced a trap composed of 33 places in 344 ms of which 6 ms to minimize.
[2024-05-31 17:59:13] [INFO ] Deduced a trap composed of 33 places in 348 ms of which 6 ms to minimize.
[2024-05-31 17:59:13] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 6 ms to minimize.
[2024-05-31 17:59:13] [INFO ] Deduced a trap composed of 39 places in 368 ms of which 5 ms to minimize.
[2024-05-31 17:59:14] [INFO ] Deduced a trap composed of 33 places in 348 ms of which 5 ms to minimize.
[2024-05-31 17:59:14] [INFO ] Deduced a trap composed of 37 places in 344 ms of which 6 ms to minimize.
[2024-05-31 17:59:14] [INFO ] Deduced a trap composed of 33 places in 352 ms of which 6 ms to minimize.
[2024-05-31 17:59:15] [INFO ] Deduced a trap composed of 36 places in 356 ms of which 5 ms to minimize.
[2024-05-31 17:59:15] [INFO ] Deduced a trap composed of 33 places in 370 ms of which 6 ms to minimize.
[2024-05-31 17:59:16] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 5 ms to minimize.
[2024-05-31 17:59:16] [INFO ] Deduced a trap composed of 33 places in 340 ms of which 5 ms to minimize.
[2024-05-31 17:59:16] [INFO ] Deduced a trap composed of 33 places in 340 ms of which 5 ms to minimize.
[2024-05-31 17:59:17] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 5 ms to minimize.
[2024-05-31 17:59:17] [INFO ] Deduced a trap composed of 33 places in 381 ms of which 6 ms to minimize.
[2024-05-31 17:59:17] [INFO ] Deduced a trap composed of 33 places in 344 ms of which 5 ms to minimize.
[2024-05-31 17:59:18] [INFO ] Deduced a trap composed of 33 places in 365 ms of which 6 ms to minimize.
[2024-05-31 17:59:18] [INFO ] Deduced a trap composed of 33 places in 360 ms of which 6 ms to minimize.
[2024-05-31 17:59:19] [INFO ] Deduced a trap composed of 41 places in 376 ms of which 7 ms to minimize.
[2024-05-31 17:59:19] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/998 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 17:59:19] [INFO ] Deduced a trap composed of 33 places in 357 ms of which 6 ms to minimize.
[2024-05-31 17:59:20] [INFO ] Deduced a trap composed of 33 places in 357 ms of which 9 ms to minimize.
[2024-05-31 17:59:20] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 6 ms to minimize.
[2024-05-31 17:59:20] [INFO ] Deduced a trap composed of 33 places in 335 ms of which 5 ms to minimize.
[2024-05-31 17:59:21] [INFO ] Deduced a trap composed of 33 places in 354 ms of which 6 ms to minimize.
[2024-05-31 17:59:21] [INFO ] Deduced a trap composed of 33 places in 339 ms of which 5 ms to minimize.
[2024-05-31 17:59:22] [INFO ] Deduced a trap composed of 34 places in 357 ms of which 6 ms to minimize.
[2024-05-31 17:59:22] [INFO ] Deduced a trap composed of 35 places in 362 ms of which 6 ms to minimize.
[2024-05-31 17:59:22] [INFO ] Deduced a trap composed of 35 places in 353 ms of which 6 ms to minimize.
[2024-05-31 17:59:23] [INFO ] Deduced a trap composed of 34 places in 331 ms of which 5 ms to minimize.
[2024-05-31 17:59:23] [INFO ] Deduced a trap composed of 34 places in 338 ms of which 6 ms to minimize.
[2024-05-31 17:59:23] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 6 ms to minimize.
[2024-05-31 17:59:24] [INFO ] Deduced a trap composed of 33 places in 334 ms of which 6 ms to minimize.
[2024-05-31 17:59:24] [INFO ] Deduced a trap composed of 33 places in 322 ms of which 5 ms to minimize.
[2024-05-31 17:59:24] [INFO ] Deduced a trap composed of 34 places in 339 ms of which 6 ms to minimize.
[2024-05-31 17:59:25] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 6 ms to minimize.
[2024-05-31 17:59:25] [INFO ] Deduced a trap composed of 33 places in 300 ms of which 6 ms to minimize.
[2024-05-31 17:59:25] [INFO ] Deduced a trap composed of 33 places in 295 ms of which 5 ms to minimize.
[2024-05-31 17:59:26] [INFO ] Deduced a trap composed of 37 places in 295 ms of which 6 ms to minimize.
[2024-05-31 17:59:26] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/998 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 17:59:26] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 6 ms to minimize.
[2024-05-31 17:59:27] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 6 ms to minimize.
[2024-05-31 17:59:27] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 5 ms to minimize.
[2024-05-31 17:59:27] [INFO ] Deduced a trap composed of 33 places in 287 ms of which 6 ms to minimize.
[2024-05-31 17:59:28] [INFO ] Deduced a trap composed of 35 places in 278 ms of which 5 ms to minimize.
[2024-05-31 17:59:28] [INFO ] Deduced a trap composed of 34 places in 308 ms of which 6 ms to minimize.
[2024-05-31 17:59:28] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 6 ms to minimize.
[2024-05-31 17:59:28] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 5 ms to minimize.
[2024-05-31 17:59:29] [INFO ] Deduced a trap composed of 33 places in 288 ms of which 5 ms to minimize.
[2024-05-31 17:59:29] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 6 ms to minimize.
[2024-05-31 17:59:29] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/998 variables, 11/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/998 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/999 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/999 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1869/2868 variables, 999/1124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2868 variables, 1771/2895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2868 variables, 2/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2868 variables, 0/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/2869 variables, 1/2898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2869 variables, 0/2898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2869 variables, 0/2898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2869/2869 variables, and 2898 constraints, problems are : Problem set: 0 solved, 2 unsolved in 38370 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1000/1000 constraints, ReadFeed: 1771/1771 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 92/92 constraints]
After SMT, in 39345ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 3238 steps, including 190 resets, run visited all 2 properties in 48 ms. (steps per millisecond=67 )
Parikh walk visited 2 properties in 54 ms.
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-030-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 17:59:31] [INFO ] Flatten gal took : 62 ms
[2024-05-31 17:59:31] [INFO ] Flatten gal took : 67 ms
[2024-05-31 17:59:31] [INFO ] Input system was already deterministic with 2246 transitions.
Support contains 79 out of 1326 places (down from 85) after GAL structural reductions.
Computed a total of 99 stabilizing places and 128 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 1326 transition count 2059
Reduce places removed 187 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 188 rules applied. Total rules applied 375 place count 1139 transition count 2058
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 376 place count 1138 transition count 2058
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 376 place count 1138 transition count 2031
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 430 place count 1111 transition count 2031
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 482 place count 1059 transition count 1927
Iterating global reduction 3 with 52 rules applied. Total rules applied 534 place count 1059 transition count 1927
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 3 with 26 rules applied. Total rules applied 560 place count 1059 transition count 1901
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 586 place count 1033 transition count 1901
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 640 place count 1006 transition count 1874
Applied a total of 640 rules in 297 ms. Remains 1006 /1326 variables (removed 320) and now considering 1874/2246 (removed 372) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 298 ms. Remains : 1006/1326 places, 1874/2246 transitions.
[2024-05-31 17:59:31] [INFO ] Flatten gal took : 46 ms
[2024-05-31 17:59:31] [INFO ] Flatten gal took : 49 ms
[2024-05-31 17:59:31] [INFO ] Input system was already deterministic with 1874 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 1268 transition count 2136
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 1268 transition count 2136
Applied a total of 116 rules in 141 ms. Remains 1268 /1326 variables (removed 58) and now considering 2136/2246 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 1268/1326 places, 2136/2246 transitions.
[2024-05-31 17:59:32] [INFO ] Flatten gal took : 46 ms
[2024-05-31 17:59:32] [INFO ] Flatten gal took : 49 ms
[2024-05-31 17:59:32] [INFO ] Input system was already deterministic with 2136 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 1326 transition count 2053
Reduce places removed 193 places and 0 transitions.
Iterating post reduction 1 with 193 rules applied. Total rules applied 386 place count 1133 transition count 2053
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 386 place count 1133 transition count 2025
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 442 place count 1105 transition count 2025
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 494 place count 1053 transition count 1921
Iterating global reduction 2 with 52 rules applied. Total rules applied 546 place count 1053 transition count 1921
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 2 with 28 rules applied. Total rules applied 574 place count 1053 transition count 1893
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 602 place count 1025 transition count 1893
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 652 place count 1000 transition count 1868
Applied a total of 652 rules in 201 ms. Remains 1000 /1326 variables (removed 326) and now considering 1868/2246 (removed 378) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 202 ms. Remains : 1000/1326 places, 1868/2246 transitions.
[2024-05-31 17:59:32] [INFO ] Flatten gal took : 42 ms
[2024-05-31 17:59:32] [INFO ] Flatten gal took : 44 ms
[2024-05-31 17:59:32] [INFO ] Input system was already deterministic with 1868 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 1267 transition count 2134
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 1267 transition count 2134
Applied a total of 118 rules in 77 ms. Remains 1267 /1326 variables (removed 59) and now considering 2134/2246 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 1267/1326 places, 2134/2246 transitions.
[2024-05-31 17:59:32] [INFO ] Flatten gal took : 49 ms
[2024-05-31 17:59:32] [INFO ] Flatten gal took : 73 ms
[2024-05-31 17:59:33] [INFO ] Input system was already deterministic with 2134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 1266 transition count 2132
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 1266 transition count 2132
Applied a total of 120 rules in 95 ms. Remains 1266 /1326 variables (removed 60) and now considering 2132/2246 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 1266/1326 places, 2132/2246 transitions.
[2024-05-31 17:59:33] [INFO ] Flatten gal took : 62 ms
[2024-05-31 17:59:33] [INFO ] Flatten gal took : 44 ms
[2024-05-31 17:59:33] [INFO ] Input system was already deterministic with 2132 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 1326 transition count 2054
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 1134 transition count 2054
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 384 place count 1134 transition count 2026
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 440 place count 1106 transition count 2026
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 491 place count 1055 transition count 1924
Iterating global reduction 2 with 51 rules applied. Total rules applied 542 place count 1055 transition count 1924
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 2 with 26 rules applied. Total rules applied 568 place count 1055 transition count 1898
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 594 place count 1029 transition count 1898
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 646 place count 1003 transition count 1872
Applied a total of 646 rules in 211 ms. Remains 1003 /1326 variables (removed 323) and now considering 1872/2246 (removed 374) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 212 ms. Remains : 1003/1326 places, 1872/2246 transitions.
[2024-05-31 17:59:33] [INFO ] Flatten gal took : 35 ms
[2024-05-31 17:59:33] [INFO ] Flatten gal took : 39 ms
[2024-05-31 17:59:33] [INFO ] Input system was already deterministic with 1872 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 1273 transition count 2144
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 1273 transition count 2144
Applied a total of 106 rules in 121 ms. Remains 1273 /1326 variables (removed 53) and now considering 2144/2246 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 1273/1326 places, 2144/2246 transitions.
[2024-05-31 17:59:33] [INFO ] Flatten gal took : 39 ms
[2024-05-31 17:59:33] [INFO ] Flatten gal took : 42 ms
[2024-05-31 17:59:34] [INFO ] Input system was already deterministic with 2144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 1268 transition count 2135
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 1268 transition count 2135
Applied a total of 116 rules in 133 ms. Remains 1268 /1326 variables (removed 58) and now considering 2135/2246 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 1268/1326 places, 2135/2246 transitions.
[2024-05-31 17:59:34] [INFO ] Flatten gal took : 41 ms
[2024-05-31 17:59:34] [INFO ] Flatten gal took : 47 ms
[2024-05-31 17:59:34] [INFO ] Input system was already deterministic with 2135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 1266 transition count 2132
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 1266 transition count 2132
Applied a total of 120 rules in 112 ms. Remains 1266 /1326 variables (removed 60) and now considering 2132/2246 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 1266/1326 places, 2132/2246 transitions.
[2024-05-31 17:59:34] [INFO ] Flatten gal took : 41 ms
[2024-05-31 17:59:34] [INFO ] Flatten gal took : 42 ms
[2024-05-31 17:59:34] [INFO ] Input system was already deterministic with 2132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 1269 transition count 2138
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 1269 transition count 2138
Applied a total of 114 rules in 95 ms. Remains 1269 /1326 variables (removed 57) and now considering 2138/2246 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 1269/1326 places, 2138/2246 transitions.
[2024-05-31 17:59:34] [INFO ] Flatten gal took : 35 ms
[2024-05-31 17:59:34] [INFO ] Flatten gal took : 42 ms
[2024-05-31 17:59:34] [INFO ] Input system was already deterministic with 2138 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 1326 transition count 2053
Reduce places removed 193 places and 0 transitions.
Iterating post reduction 1 with 193 rules applied. Total rules applied 386 place count 1133 transition count 2053
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 386 place count 1133 transition count 2025
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 442 place count 1105 transition count 2025
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 495 place count 1052 transition count 1919
Iterating global reduction 2 with 53 rules applied. Total rules applied 548 place count 1052 transition count 1919
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 2 with 28 rules applied. Total rules applied 576 place count 1052 transition count 1891
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 604 place count 1024 transition count 1891
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 654 place count 999 transition count 1866
Applied a total of 654 rules in 162 ms. Remains 999 /1326 variables (removed 327) and now considering 1866/2246 (removed 380) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 162 ms. Remains : 999/1326 places, 1866/2246 transitions.
[2024-05-31 17:59:35] [INFO ] Flatten gal took : 32 ms
[2024-05-31 17:59:35] [INFO ] Flatten gal took : 54 ms
[2024-05-31 17:59:35] [INFO ] Input system was already deterministic with 1866 transitions.
RANDOM walk for 18193 steps (86 resets) in 182 ms. (99 steps per ms) remains 0/1 properties
FORMULA CANConstruction-PT-030-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 1268 transition count 2136
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 1268 transition count 2136
Applied a total of 116 rules in 94 ms. Remains 1268 /1326 variables (removed 58) and now considering 2136/2246 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 1268/1326 places, 2136/2246 transitions.
[2024-05-31 17:59:35] [INFO ] Flatten gal took : 35 ms
[2024-05-31 17:59:35] [INFO ] Flatten gal took : 39 ms
[2024-05-31 17:59:35] [INFO ] Input system was already deterministic with 2136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 1275 transition count 2150
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 1275 transition count 2150
Applied a total of 102 rules in 91 ms. Remains 1275 /1326 variables (removed 51) and now considering 2150/2246 (removed 96) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 1275/1326 places, 2150/2246 transitions.
[2024-05-31 17:59:35] [INFO ] Flatten gal took : 35 ms
[2024-05-31 17:59:35] [INFO ] Flatten gal took : 39 ms
[2024-05-31 17:59:35] [INFO ] Input system was already deterministic with 2150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 1273 transition count 2145
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 1273 transition count 2145
Applied a total of 106 rules in 90 ms. Remains 1273 /1326 variables (removed 53) and now considering 2145/2246 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 1273/1326 places, 2145/2246 transitions.
[2024-05-31 17:59:36] [INFO ] Flatten gal took : 34 ms
[2024-05-31 17:59:36] [INFO ] Flatten gal took : 37 ms
[2024-05-31 17:59:36] [INFO ] Input system was already deterministic with 2145 transitions.
[2024-05-31 17:59:36] [INFO ] Flatten gal took : 44 ms
[2024-05-31 17:59:36] [INFO ] Flatten gal took : 45 ms
[2024-05-31 17:59:36] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-31 17:59:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1326 places, 2246 transitions and 8106 arcs took 15 ms.
Total runtime 111932 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 : CANConstruction-PT-030-CTLCardinality-2024-00
Could not compute solution for formula : CANConstruction-PT-030-CTLCardinality-2024-01
Could not compute solution for formula : CANConstruction-PT-030-CTLCardinality-2024-02
Could not compute solution for formula : CANConstruction-PT-030-CTLCardinality-2024-03
Could not compute solution for formula : CANConstruction-PT-030-CTLCardinality-2024-04
Could not compute solution for formula : CANConstruction-PT-030-CTLCardinality-2024-05
Could not compute solution for formula : CANConstruction-PT-030-CTLCardinality-2024-06
Could not compute solution for formula : CANConstruction-PT-030-CTLCardinality-2024-07
Could not compute solution for formula : CANConstruction-PT-030-CTLCardinality-2024-09
Could not compute solution for formula : CANConstruction-PT-030-CTLCardinality-2024-11
Could not compute solution for formula : CANConstruction-PT-030-CTLCardinality-2023-13
Could not compute solution for formula : CANConstruction-PT-030-CTLCardinality-2023-14
Could not compute solution for formula : CANConstruction-PT-030-CTLCardinality-2023-15

BK_STOP 1717178376657

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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 CANConstruction-PT-030-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1169/ctl_0_
ctl formula name CANConstruction-PT-030-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1169/ctl_1_
ctl formula name CANConstruction-PT-030-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1169/ctl_2_
ctl formula name CANConstruction-PT-030-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1169/ctl_3_
ctl formula name CANConstruction-PT-030-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1169/ctl_4_
ctl formula name CANConstruction-PT-030-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1169/ctl_5_
ctl formula name CANConstruction-PT-030-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1169/ctl_6_
ctl formula name CANConstruction-PT-030-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1169/ctl_7_
ctl formula name CANConstruction-PT-030-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1169/ctl_8_
ctl formula name CANConstruction-PT-030-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1169/ctl_9_
ctl formula name CANConstruction-PT-030-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1169/ctl_10_
ctl formula name CANConstruction-PT-030-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1169/ctl_11_
ctl formula name CANConstruction-PT-030-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1169/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="CANConstruction-PT-030"
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 CANConstruction-PT-030, 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 r476-tall-171620505000025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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