MCC'2024- Execution of r512-smll-171654407300290

About the Execution of LTSMin+red for Peterson-PT-7

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1624.668	197514.00	260394.00	534.20	????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.r512-smll-171654407300290.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 Peterson-PT-7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300290
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.8M
-rw-r--r-- 1 mcc users 264K Apr 12 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 12 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 183K Apr 12 03:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 831K Apr 12 03:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 72K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 156K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 517K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 378K Apr 12 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 617K Apr 12 04:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 12 04:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 58K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717278898321

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:55:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:55:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:55:01] [INFO ] Load time of PNML (sax parser for PT used): 505 ms
[2024-06-01 21:55:01] [INFO ] Transformed 1992 places.
[2024-06-01 21:55:01] [INFO ] Transformed 3096 transitions.
[2024-06-01 21:55:01] [INFO ] Found NUPN structural information;
[2024-06-01 21:55:01] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 779 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 131 ms.
Support contains 1992 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 73 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 21:55:02] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-06-01 21:55:03] [INFO ] Computed 31 invariants in 62 ms
[2024-06-01 21:55:04] [INFO ] Implicit Places using invariants in 1055 ms returned []
[2024-06-01 21:55:04] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 21:55:04] [INFO ] Invariant cache hit.
[2024-06-01 21:55:06] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 21:55:06] [INFO ] Implicit Places using invariants and state equation in 2823 ms returned []
Implicit Place search using SMT with State Equation took 3929 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-06-01 21:55:07] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 21:55:07] [INFO ] Invariant cache hit.
[2024-06-01 21:55:07] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 32367ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 32473ms
Finished structural reductions in LTL mode , in 1 iterations and 36559 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1992 out of 1992 places after structural reductions.
[2024-06-01 21:55:40] [INFO ] Flatten gal took : 404 ms
[2024-06-01 21:55:41] [INFO ] Flatten gal took : 222 ms
[2024-06-01 21:55:42] [INFO ] Input system was already deterministic with 3096 transitions.
Support contains 1555 out of 1992 places (down from 1992) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 66 to 64
RANDOM walk for 40000 steps (8 resets) in 5602 ms. (7 steps per ms) remains 30/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
[2024-06-01 21:55:44] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 21:55:44] [INFO ] Invariant cache hit.
[2024-06-01 21:55:44] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp30 is UNSAT
At refinement iteration 2 (OVERLAPS) 1859/1968 variables, 18/127 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1968 variables, 1859/1986 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1968 variables, 3/1989 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-06-01 21:55:48] [INFO ] Deduced a trap composed of 130 places in 3278 ms of which 277 ms to minimize.
[2024-06-01 21:55:51] [INFO ] Deduced a trap composed of 142 places in 2037 ms of which 19 ms to minimize.
SMT process timed out in 6765ms, After SMT, problems are : Problem set: 1 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 837 transitions
Trivial Post-agglo rules discarded 837 transitions
Performed 837 trivial Post agglomeration. Transition count delta: 837
Iterating post reduction 0 with 837 rules applied. Total rules applied 837 place count 1992 transition count 2259
Reduce places removed 837 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 848 rules applied. Total rules applied 1685 place count 1155 transition count 2248
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1696 place count 1144 transition count 2248
Performed 441 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 441 Pre rules applied. Total rules applied 1696 place count 1144 transition count 1807
Deduced a syphon composed of 441 places in 4 ms
Reduce places removed 441 places and 0 transitions.
Iterating global reduction 3 with 882 rules applied. Total rules applied 2578 place count 703 transition count 1807
Applied a total of 2578 rules in 446 ms. Remains 703 /1992 variables (removed 1289) and now considering 1807/3096 (removed 1289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 447 ms. Remains : 703/1992 places, 1807/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 901 ms. (44 steps per ms) remains 22/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
[2024-06-01 21:55:52] [INFO ] Flow matrix only has 1471 transitions (discarded 336 similar events)
// Phase 1: matrix 1471 rows 703 cols
[2024-06-01 21:55:52] [INFO ] Computed 31 invariants in 9 ms
[2024-06-01 21:55:52] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 574/667 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/667 variables, 574/681 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/667 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 21:55:53] [INFO ] Deduced a trap composed of 28 places in 717 ms of which 9 ms to minimize.
[2024-06-01 21:55:54] [INFO ] Deduced a trap composed of 111 places in 530 ms of which 8 ms to minimize.
[2024-06-01 21:55:54] [INFO ] Deduced a trap composed of 98 places in 636 ms of which 8 ms to minimize.
[2024-06-01 21:55:55] [INFO ] Deduced a trap composed of 93 places in 413 ms of which 4 ms to minimize.
[2024-06-01 21:55:55] [INFO ] Deduced a trap composed of 94 places in 575 ms of which 7 ms to minimize.
[2024-06-01 21:55:56] [INFO ] Deduced a trap composed of 110 places in 516 ms of which 7 ms to minimize.
[2024-06-01 21:55:56] [INFO ] Deduced a trap composed of 144 places in 502 ms of which 7 ms to minimize.
Problem AtomicPropp61 is UNSAT
[2024-06-01 21:55:57] [INFO ] Deduced a trap composed of 71 places in 720 ms of which 8 ms to minimize.
[2024-06-01 21:55:58] [INFO ] Deduced a trap composed of 90 places in 435 ms of which 5 ms to minimize.
[2024-06-01 21:55:58] [INFO ] Deduced a trap composed of 60 places in 590 ms of which 9 ms to minimize.
[2024-06-01 21:55:59] [INFO ] Deduced a trap composed of 27 places in 409 ms of which 5 ms to minimize.
[2024-06-01 21:55:59] [INFO ] Deduced a trap composed of 39 places in 569 ms of which 5 ms to minimize.
[2024-06-01 21:56:00] [INFO ] Deduced a trap composed of 59 places in 429 ms of which 5 ms to minimize.
[2024-06-01 21:56:00] [INFO ] Deduced a trap composed of 141 places in 417 ms of which 5 ms to minimize.
[2024-06-01 21:56:01] [INFO ] Deduced a trap composed of 25 places in 416 ms of which 5 ms to minimize.
[2024-06-01 21:56:01] [INFO ] Deduced a trap composed of 60 places in 420 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/667 variables, 16/699 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-06-01 21:56:02] [INFO ] Deduced a trap composed of 109 places in 654 ms of which 9 ms to minimize.
[2024-06-01 21:56:03] [INFO ] Deduced a trap composed of 108 places in 707 ms of which 9 ms to minimize.
[2024-06-01 21:56:04] [INFO ] Deduced a trap composed of 95 places in 668 ms of which 7 ms to minimize.
[2024-06-01 21:56:04] [INFO ] Deduced a trap composed of 134 places in 618 ms of which 6 ms to minimize.
[2024-06-01 21:56:05] [INFO ] Deduced a trap composed of 90 places in 839 ms of which 9 ms to minimize.
[2024-06-01 21:56:06] [INFO ] Deduced a trap composed of 27 places in 772 ms of which 8 ms to minimize.
[2024-06-01 21:56:07] [INFO ] Deduced a trap composed of 54 places in 702 ms of which 8 ms to minimize.
[2024-06-01 21:56:07] [INFO ] Deduced a trap composed of 66 places in 711 ms of which 9 ms to minimize.
[2024-06-01 21:56:08] [INFO ] Deduced a trap composed of 68 places in 770 ms of which 9 ms to minimize.
[2024-06-01 21:56:09] [INFO ] Deduced a trap composed of 93 places in 726 ms of which 8 ms to minimize.
[2024-06-01 21:56:10] [INFO ] Deduced a trap composed of 67 places in 726 ms of which 8 ms to minimize.
[2024-06-01 21:56:11] [INFO ] Deduced a trap composed of 71 places in 717 ms of which 9 ms to minimize.
[2024-06-01 21:56:11] [INFO ] Deduced a trap composed of 89 places in 453 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 13/712 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-06-01 21:56:12] [INFO ] Deduced a trap composed of 25 places in 775 ms of which 9 ms to minimize.
[2024-06-01 21:56:13] [INFO ] Deduced a trap composed of 54 places in 767 ms of which 9 ms to minimize.
[2024-06-01 21:56:14] [INFO ] Deduced a trap composed of 54 places in 780 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 3/715 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-06-01 21:56:15] [INFO ] Deduced a trap composed of 26 places in 727 ms of which 9 ms to minimize.
[2024-06-01 21:56:16] [INFO ] Deduced a trap composed of 26 places in 771 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 2/717 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 0/717 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 6/673 variables, 6/723 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 6/729 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/673 variables, 0/729 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 6/679 variables, 6/735 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/679 variables, 6/741 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-06-01 21:56:19] [INFO ] Deduced a trap composed of 47 places in 751 ms of which 9 ms to minimize.
[2024-06-01 21:56:20] [INFO ] Deduced a trap composed of 49 places in 814 ms of which 9 ms to minimize.
[2024-06-01 21:56:21] [INFO ] Deduced a trap composed of 42 places in 810 ms of which 10 ms to minimize.
[2024-06-01 21:56:22] [INFO ] Deduced a trap composed of 35 places in 789 ms of which 9 ms to minimize.
[2024-06-01 21:56:23] [INFO ] Deduced a trap composed of 47 places in 843 ms of which 10 ms to minimize.
[2024-06-01 21:56:23] [INFO ] Deduced a trap composed of 62 places in 776 ms of which 9 ms to minimize.
[2024-06-01 21:56:24] [INFO ] Deduced a trap composed of 64 places in 602 ms of which 8 ms to minimize.
[2024-06-01 21:56:25] [INFO ] Deduced a trap composed of 24 places in 778 ms of which 9 ms to minimize.
[2024-06-01 21:56:26] [INFO ] Deduced a trap composed of 21 places in 832 ms of which 9 ms to minimize.
[2024-06-01 21:56:27] [INFO ] Deduced a trap composed of 23 places in 845 ms of which 9 ms to minimize.
[2024-06-01 21:56:28] [INFO ] Deduced a trap composed of 22 places in 849 ms of which 9 ms to minimize.
[2024-06-01 21:56:28] [INFO ] Deduced a trap composed of 24 places in 833 ms of which 9 ms to minimize.
[2024-06-01 21:56:29] [INFO ] Deduced a trap composed of 60 places in 775 ms of which 8 ms to minimize.
[2024-06-01 21:56:30] [INFO ] Deduced a trap composed of 82 places in 591 ms of which 7 ms to minimize.
[2024-06-01 21:56:30] [INFO ] Deduced a trap composed of 79 places in 574 ms of which 7 ms to minimize.
[2024-06-01 21:56:31] [INFO ] Deduced a trap composed of 95 places in 523 ms of which 7 ms to minimize.
[2024-06-01 21:56:32] [INFO ] Deduced a trap composed of 96 places in 582 ms of which 7 ms to minimize.
[2024-06-01 21:56:33] [INFO ] Deduced a trap composed of 24 places in 909 ms of which 10 ms to minimize.
[2024-06-01 21:56:33] [INFO ] Deduced a trap composed of 55 places in 857 ms of which 10 ms to minimize.
[2024-06-01 21:56:34] [INFO ] Deduced a trap composed of 46 places in 858 ms of which 9 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/679 variables, 20/761 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-06-01 21:56:35] [INFO ] Deduced a trap composed of 20 places in 857 ms of which 9 ms to minimize.
[2024-06-01 21:56:36] [INFO ] Deduced a trap composed of 73 places in 468 ms of which 6 ms to minimize.
[2024-06-01 21:56:36] [INFO ] Deduced a trap composed of 84 places in 466 ms of which 5 ms to minimize.
[2024-06-01 21:56:37] [INFO ] Deduced a trap composed of 80 places in 268 ms of which 6 ms to minimize.
SMT process timed out in 45113ms, After SMT, problems are : Problem set: 1 solved, 20 unsolved
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 90 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 1807/1807 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 703 transition count 1804
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 700 transition count 1804
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 6 place count 700 transition count 1794
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 26 place count 690 transition count 1794
Applied a total of 26 rules in 104 ms. Remains 690 /703 variables (removed 13) and now considering 1794/1807 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 690/703 places, 1794/1807 transitions.
RANDOM walk for 40000 steps (8 resets) in 820 ms. (48 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 186831 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 19
Probabilistic random walk after 186831 steps, saw 40580 distinct states, run finished after 3011 ms. (steps per millisecond=62 ) properties seen :0
[2024-06-01 21:56:40] [INFO ] Flow matrix only has 1458 transitions (discarded 336 similar events)
// Phase 1: matrix 1458 rows 690 cols
[2024-06-01 21:56:40] [INFO ] Computed 31 invariants in 13 ms
[2024-06-01 21:56:40] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 565/654 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 565/668 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 2/670 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 6/660 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 6/682 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 6/666 variables, 6/688 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 6/694 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 1458/2124 variables, 666/1360 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2124 variables, 497/1857 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2124 variables, 0/1857 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 24/2148 variables, 24/1881 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2148 variables, 24/1905 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2148 variables, 3/1908 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2148 variables, 0/1908 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 0/2148 variables, 0/1908 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2148/2148 variables, and 1908 constraints, problems are : Problem set: 0 solved, 19 unsolved in 7266 ms.
Refiners :[Domain max(s): 690/690 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 690/690 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 565/654 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 565/668 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 2/670 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 21:56:49] [INFO ] Deduced a trap composed of 26 places in 430 ms of which 7 ms to minimize.
[2024-06-01 21:56:49] [INFO ] Deduced a trap composed of 24 places in 385 ms of which 5 ms to minimize.
[2024-06-01 21:56:50] [INFO ] Deduced a trap composed of 25 places in 518 ms of which 7 ms to minimize.
[2024-06-01 21:56:50] [INFO ] Deduced a trap composed of 29 places in 581 ms of which 7 ms to minimize.
[2024-06-01 21:56:51] [INFO ] Deduced a trap composed of 29 places in 600 ms of which 6 ms to minimize.
[2024-06-01 21:56:52] [INFO ] Deduced a trap composed of 95 places in 427 ms of which 6 ms to minimize.
[2024-06-01 21:56:52] [INFO ] Deduced a trap composed of 51 places in 582 ms of which 8 ms to minimize.
[2024-06-01 21:56:53] [INFO ] Deduced a trap composed of 51 places in 637 ms of which 5 ms to minimize.
[2024-06-01 21:56:54] [INFO ] Deduced a trap composed of 51 places in 740 ms of which 8 ms to minimize.
[2024-06-01 21:56:54] [INFO ] Deduced a trap composed of 67 places in 479 ms of which 7 ms to minimize.
[2024-06-01 21:56:55] [INFO ] Deduced a trap composed of 83 places in 722 ms of which 9 ms to minimize.
[2024-06-01 21:56:55] [INFO ] Deduced a trap composed of 51 places in 606 ms of which 7 ms to minimize.
[2024-06-01 21:56:56] [INFO ] Deduced a trap composed of 63 places in 564 ms of which 7 ms to minimize.
[2024-06-01 21:56:57] [INFO ] Deduced a trap composed of 51 places in 610 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 14/684 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 21:56:58] [INFO ] Deduced a trap composed of 31 places in 536 ms of which 7 ms to minimize.
[2024-06-01 21:56:58] [INFO ] Deduced a trap composed of 108 places in 543 ms of which 6 ms to minimize.
[2024-06-01 21:56:59] [INFO ] Deduced a trap composed of 89 places in 494 ms of which 6 ms to minimize.
[2024-06-01 21:57:00] [INFO ] Deduced a trap composed of 51 places in 715 ms of which 7 ms to minimize.
[2024-06-01 21:57:01] [INFO ] Deduced a trap composed of 65 places in 568 ms of which 7 ms to minimize.
[2024-06-01 21:57:01] [INFO ] Deduced a trap composed of 63 places in 514 ms of which 7 ms to minimize.
[2024-06-01 21:57:02] [INFO ] Deduced a trap composed of 63 places in 586 ms of which 7 ms to minimize.
[2024-06-01 21:57:02] [INFO ] Deduced a trap composed of 132 places in 514 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 8/692 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 21:57:04] [INFO ] Deduced a trap composed of 65 places in 543 ms of which 6 ms to minimize.
[2024-06-01 21:57:04] [INFO ] Deduced a trap composed of 29 places in 486 ms of which 7 ms to minimize.
[2024-06-01 21:57:05] [INFO ] Deduced a trap composed of 137 places in 478 ms of which 6 ms to minimize.
[2024-06-01 21:57:05] [INFO ] Deduced a trap composed of 145 places in 518 ms of which 6 ms to minimize.
[2024-06-01 21:57:06] [INFO ] Deduced a trap composed of 118 places in 567 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 5/697 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 21:57:06] [INFO ] Deduced a trap composed of 111 places in 578 ms of which 7 ms to minimize.
[2024-06-01 21:57:07] [INFO ] Deduced a trap composed of 37 places in 687 ms of which 8 ms to minimize.
[2024-06-01 21:57:08] [INFO ] Deduced a trap composed of 25 places in 601 ms of which 5 ms to minimize.
[2024-06-01 21:57:09] [INFO ] Deduced a trap composed of 67 places in 531 ms of which 8 ms to minimize.
[2024-06-01 21:57:09] [INFO ] Deduced a trap composed of 24 places in 697 ms of which 9 ms to minimize.
[2024-06-01 21:57:10] [INFO ] Deduced a trap composed of 65 places in 653 ms of which 8 ms to minimize.
[2024-06-01 21:57:11] [INFO ] Deduced a trap composed of 31 places in 589 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 7/704 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 21:57:12] [INFO ] Deduced a trap composed of 34 places in 702 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 21:57:14] [INFO ] Deduced a trap composed of 87 places in 790 ms of which 9 ms to minimize.
[2024-06-01 21:57:15] [INFO ] Deduced a trap composed of 24 places in 754 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 6/660 variables, 6/713 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/660 variables, 6/719 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/660 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 6/666 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/666 variables, 6/731 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 21:57:18] [INFO ] Deduced a trap composed of 22 places in 796 ms of which 9 ms to minimize.
[2024-06-01 21:57:18] [INFO ] Deduced a trap composed of 19 places in 808 ms of which 9 ms to minimize.
[2024-06-01 21:57:19] [INFO ] Deduced a trap composed of 21 places in 819 ms of which 9 ms to minimize.
[2024-06-01 21:57:20] [INFO ] Deduced a trap composed of 56 places in 802 ms of which 9 ms to minimize.
[2024-06-01 21:57:21] [INFO ] Deduced a trap composed of 88 places in 623 ms of which 8 ms to minimize.
[2024-06-01 21:57:21] [INFO ] Deduced a trap composed of 50 places in 644 ms of which 8 ms to minimize.
[2024-06-01 21:57:22] [INFO ] Deduced a trap composed of 49 places in 766 ms of which 9 ms to minimize.
[2024-06-01 21:57:23] [INFO ] Deduced a trap composed of 23 places in 652 ms of which 7 ms to minimize.
[2024-06-01 21:57:23] [INFO ] Deduced a trap composed of 44 places in 445 ms of which 5 ms to minimize.
[2024-06-01 21:57:24] [INFO ] Deduced a trap composed of 68 places in 452 ms of which 7 ms to minimize.
[2024-06-01 21:57:25] [INFO ] Deduced a trap composed of 26 places in 665 ms of which 8 ms to minimize.
[2024-06-01 21:57:25] [INFO ] Deduced a trap composed of 51 places in 662 ms of which 9 ms to minimize.
[2024-06-01 21:57:26] [INFO ] Deduced a trap composed of 51 places in 654 ms of which 9 ms to minimize.
[2024-06-01 21:57:26] [INFO ] Deduced a trap composed of 54 places in 432 ms of which 6 ms to minimize.
[2024-06-01 21:57:27] [INFO ] Deduced a trap composed of 23 places in 597 ms of which 5 ms to minimize.
[2024-06-01 21:57:28] [INFO ] Deduced a trap composed of 29 places in 502 ms of which 9 ms to minimize.
[2024-06-01 21:57:28] [INFO ] Deduced a trap composed of 51 places in 803 ms of which 9 ms to minimize.
[2024-06-01 21:57:29] [INFO ] Deduced a trap composed of 118 places in 638 ms of which 8 ms to minimize.
[2024-06-01 21:57:30] [INFO ] Deduced a trap composed of 82 places in 747 ms of which 9 ms to minimize.
[2024-06-01 21:57:31] [INFO ] Deduced a trap composed of 34 places in 829 ms of which 9 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/666 variables, 20/751 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 21:57:32] [INFO ] Deduced a trap composed of 24 places in 848 ms of which 9 ms to minimize.
[2024-06-01 21:57:32] [INFO ] Deduced a trap composed of 21 places in 764 ms of which 8 ms to minimize.
[2024-06-01 21:57:33] [INFO ] Deduced a trap composed of 23 places in 850 ms of which 12 ms to minimize.
[2024-06-01 21:57:34] [INFO ] Deduced a trap composed of 19 places in 754 ms of which 10 ms to minimize.
[2024-06-01 21:57:35] [INFO ] Deduced a trap composed of 78 places in 780 ms of which 9 ms to minimize.
[2024-06-01 21:57:36] [INFO ] Deduced a trap composed of 43 places in 812 ms of which 9 ms to minimize.
[2024-06-01 21:57:37] [INFO ] Deduced a trap composed of 46 places in 865 ms of which 9 ms to minimize.
[2024-06-01 21:57:38] [INFO ] Deduced a trap composed of 43 places in 795 ms of which 8 ms to minimize.
[2024-06-01 21:57:38] [INFO ] Deduced a trap composed of 44 places in 836 ms of which 10 ms to minimize.
[2024-06-01 21:57:39] [INFO ] Deduced a trap composed of 28 places in 685 ms of which 9 ms to minimize.
[2024-06-01 21:57:40] [INFO ] Deduced a trap composed of 96 places in 726 ms of which 9 ms to minimize.
[2024-06-01 21:57:41] [INFO ] Deduced a trap composed of 69 places in 687 ms of which 8 ms to minimize.
[2024-06-01 21:57:41] [INFO ] Deduced a trap composed of 38 places in 615 ms of which 7 ms to minimize.
[2024-06-01 21:57:42] [INFO ] Deduced a trap composed of 43 places in 587 ms of which 8 ms to minimize.
[2024-06-01 21:57:43] [INFO ] Deduced a trap composed of 43 places in 627 ms of which 8 ms to minimize.
[2024-06-01 21:57:43] [INFO ] Deduced a trap composed of 66 places in 629 ms of which 7 ms to minimize.
[2024-06-01 21:57:44] [INFO ] Deduced a trap composed of 38 places in 611 ms of which 7 ms to minimize.
[2024-06-01 21:57:44] [INFO ] Deduced a trap composed of 60 places in 456 ms of which 6 ms to minimize.
[2024-06-01 21:57:45] [INFO ] Deduced a trap composed of 74 places in 822 ms of which 8 ms to minimize.
[2024-06-01 21:57:46] [INFO ] Deduced a trap composed of 51 places in 755 ms of which 9 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/666 variables, 20/771 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 21:57:47] [INFO ] Deduced a trap composed of 28 places in 783 ms of which 8 ms to minimize.
[2024-06-01 21:57:48] [INFO ] Deduced a trap composed of 37 places in 861 ms of which 9 ms to minimize.
[2024-06-01 21:57:49] [INFO ] Deduced a trap composed of 23 places in 893 ms of which 9 ms to minimize.
[2024-06-01 21:57:49] [INFO ] Deduced a trap composed of 72 places in 739 ms of which 8 ms to minimize.
[2024-06-01 21:57:50] [INFO ] Deduced a trap composed of 22 places in 886 ms of which 9 ms to minimize.
[2024-06-01 21:57:51] [INFO ] Deduced a trap composed of 41 places in 711 ms of which 8 ms to minimize.
[2024-06-01 21:57:52] [INFO ] Deduced a trap composed of 46 places in 790 ms of which 9 ms to minimize.
[2024-06-01 21:57:53] [INFO ] Deduced a trap composed of 19 places in 969 ms of which 10 ms to minimize.
[2024-06-01 21:57:54] [INFO ] Deduced a trap composed of 44 places in 916 ms of which 10 ms to minimize.
[2024-06-01 21:57:55] [INFO ] Deduced a trap composed of 63 places in 648 ms of which 7 ms to minimize.
[2024-06-01 21:57:55] [INFO ] Deduced a trap composed of 63 places in 670 ms of which 8 ms to minimize.
[2024-06-01 21:57:56] [INFO ] Deduced a trap composed of 55 places in 639 ms of which 8 ms to minimize.
[2024-06-01 21:57:57] [INFO ] Deduced a trap composed of 62 places in 616 ms of which 7 ms to minimize.
[2024-06-01 21:57:57] [INFO ] Deduced a trap composed of 46 places in 627 ms of which 7 ms to minimize.
[2024-06-01 21:57:58] [INFO ] Deduced a trap composed of 28 places in 817 ms of which 9 ms to minimize.
[2024-06-01 21:57:59] [INFO ] Deduced a trap composed of 49 places in 774 ms of which 8 ms to minimize.
[2024-06-01 21:58:00] [INFO ] Deduced a trap composed of 49 places in 762 ms of which 8 ms to minimize.
[2024-06-01 21:58:00] [INFO ] Deduced a trap composed of 58 places in 603 ms of which 8 ms to minimize.
[2024-06-01 21:58:01] [INFO ] Deduced a trap composed of 63 places in 579 ms of which 7 ms to minimize.
[2024-06-01 21:58:02] [INFO ] Deduced a trap composed of 97 places in 564 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/666 variables, 20/791 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 21:58:03] [INFO ] Deduced a trap composed of 21 places in 826 ms of which 10 ms to minimize.
SMT process timed out in 82632ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 89 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1794/1794 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 690 transition count 1793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 689 transition count 1793
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 689 transition count 1792
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 688 transition count 1792
Applied a total of 4 rules in 113 ms. Remains 688 /690 variables (removed 2) and now considering 1792/1794 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 688/690 places, 1792/1794 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-01 21:58:03] [INFO ] Flatten gal took : 175 ms
[2024-06-01 21:58:04] [INFO ] Flatten gal took : 155 ms
[2024-06-01 21:58:05] [INFO ] Input system was already deterministic with 3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 40 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:58:05] [INFO ] Flatten gal took : 142 ms
[2024-06-01 21:58:05] [INFO ] Flatten gal took : 170 ms
[2024-06-01 21:58:06] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 85 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:58:06] [INFO ] Flatten gal took : 75 ms
[2024-06-01 21:58:06] [INFO ] Flatten gal took : 103 ms
[2024-06-01 21:58:06] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 122 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:58:06] [INFO ] Flatten gal took : 94 ms
[2024-06-01 21:58:07] [INFO ] Flatten gal took : 87 ms
[2024-06-01 21:58:07] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 47 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:58:07] [INFO ] Flatten gal took : 76 ms
[2024-06-01 21:58:07] [INFO ] Flatten gal took : 94 ms
[2024-06-01 21:58:07] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1992 transition count 2201
Reduce places removed 895 places and 0 transitions.
Iterating post reduction 1 with 895 rules applied. Total rules applied 1790 place count 1097 transition count 2201
Performed 441 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 441 Pre rules applied. Total rules applied 1790 place count 1097 transition count 1760
Deduced a syphon composed of 441 places in 1 ms
Reduce places removed 441 places and 0 transitions.
Iterating global reduction 2 with 882 rules applied. Total rules applied 2672 place count 656 transition count 1760
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 2768 place count 608 transition count 1712
Applied a total of 2768 rules in 298 ms. Remains 608 /1992 variables (removed 1384) and now considering 1712/3096 (removed 1384) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 300 ms. Remains : 608/1992 places, 1712/3096 transitions.
[2024-06-01 21:58:07] [INFO ] Flatten gal took : 39 ms
[2024-06-01 21:58:08] [INFO ] Flatten gal took : 47 ms
[2024-06-01 21:58:08] [INFO ] Input system was already deterministic with 1712 transitions.
RANDOM walk for 705 steps (0 resets) in 11 ms. (58 steps per ms) remains 0/1 properties
FORMULA Peterson-PT-7-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 99 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:58:08] [INFO ] Flatten gal took : 65 ms
[2024-06-01 21:58:08] [INFO ] Flatten gal took : 90 ms
[2024-06-01 21:58:08] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 22 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:58:08] [INFO ] Flatten gal took : 68 ms
[2024-06-01 21:58:08] [INFO ] Flatten gal took : 83 ms
[2024-06-01 21:58:08] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 504 place count 1992 transition count 2592
Reduce places removed 504 places and 0 transitions.
Iterating post reduction 1 with 504 rules applied. Total rules applied 1008 place count 1488 transition count 2592
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1008 place count 1488 transition count 2144
Deduced a syphon composed of 448 places in 2 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 1904 place count 1040 transition count 2144
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2016 place count 984 transition count 2088
Applied a total of 2016 rules in 234 ms. Remains 984 /1992 variables (removed 1008) and now considering 2088/3096 (removed 1008) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 235 ms. Remains : 984/1992 places, 2088/3096 transitions.
[2024-06-01 21:58:09] [INFO ] Flatten gal took : 56 ms
[2024-06-01 21:58:09] [INFO ] Flatten gal took : 64 ms
[2024-06-01 21:58:09] [INFO ] Input system was already deterministic with 2088 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 85 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:58:09] [INFO ] Flatten gal took : 59 ms
[2024-06-01 21:58:09] [INFO ] Flatten gal took : 68 ms
[2024-06-01 21:58:09] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 80 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:58:10] [INFO ] Flatten gal took : 57 ms
[2024-06-01 21:58:10] [INFO ] Flatten gal took : 69 ms
[2024-06-01 21:58:10] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 893 transitions
Trivial Post-agglo rules discarded 893 transitions
Performed 893 trivial Post agglomeration. Transition count delta: 893
Iterating post reduction 0 with 893 rules applied. Total rules applied 893 place count 1992 transition count 2203
Reduce places removed 893 places and 0 transitions.
Iterating post reduction 1 with 893 rules applied. Total rules applied 1786 place count 1099 transition count 2203
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 447 Pre rules applied. Total rules applied 1786 place count 1099 transition count 1756
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 2 with 894 rules applied. Total rules applied 2680 place count 652 transition count 1756
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2792 place count 596 transition count 1700
Applied a total of 2792 rules in 158 ms. Remains 596 /1992 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 159 ms. Remains : 596/1992 places, 1700/3096 transitions.
[2024-06-01 21:58:10] [INFO ] Flatten gal took : 34 ms
[2024-06-01 21:58:10] [INFO ] Flatten gal took : 63 ms
[2024-06-01 21:58:10] [INFO ] Input system was already deterministic with 1700 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 82 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:58:10] [INFO ] Flatten gal took : 57 ms
[2024-06-01 21:58:10] [INFO ] Flatten gal took : 64 ms
[2024-06-01 21:58:10] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 113 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:58:11] [INFO ] Flatten gal took : 92 ms
[2024-06-01 21:58:11] [INFO ] Flatten gal took : 103 ms
[2024-06-01 21:58:11] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 117 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:58:11] [INFO ] Flatten gal took : 89 ms
[2024-06-01 21:58:11] [INFO ] Flatten gal took : 100 ms
[2024-06-01 21:58:11] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 885 transitions
Trivial Post-agglo rules discarded 885 transitions
Performed 885 trivial Post agglomeration. Transition count delta: 885
Iterating post reduction 0 with 885 rules applied. Total rules applied 885 place count 1992 transition count 2211
Reduce places removed 885 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 886 rules applied. Total rules applied 1771 place count 1107 transition count 2210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1772 place count 1106 transition count 2210
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1772 place count 1106 transition count 1764
Deduced a syphon composed of 446 places in 2 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2664 place count 660 transition count 1764
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2776 place count 604 transition count 1708
Applied a total of 2776 rules in 250 ms. Remains 604 /1992 variables (removed 1388) and now considering 1708/3096 (removed 1388) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 251 ms. Remains : 604/1992 places, 1708/3096 transitions.
[2024-06-01 21:58:12] [INFO ] Flatten gal took : 67 ms
[2024-06-01 21:58:12] [INFO ] Flatten gal took : 73 ms
[2024-06-01 21:58:12] [INFO ] Input system was already deterministic with 1708 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 890 transitions
Trivial Post-agglo rules discarded 890 transitions
Performed 890 trivial Post agglomeration. Transition count delta: 890
Iterating post reduction 0 with 890 rules applied. Total rules applied 890 place count 1992 transition count 2206
Reduce places removed 890 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 893 rules applied. Total rules applied 1783 place count 1102 transition count 2203
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1786 place count 1099 transition count 2203
Performed 445 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 445 Pre rules applied. Total rules applied 1786 place count 1099 transition count 1758
Deduced a syphon composed of 445 places in 1 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 3 with 890 rules applied. Total rules applied 2676 place count 654 transition count 1758
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2786 place count 599 transition count 1703
Applied a total of 2786 rules in 243 ms. Remains 599 /1992 variables (removed 1393) and now considering 1703/3096 (removed 1393) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 243 ms. Remains : 599/1992 places, 1703/3096 transitions.
[2024-06-01 21:58:12] [INFO ] Flatten gal took : 58 ms
[2024-06-01 21:58:12] [INFO ] Flatten gal took : 65 ms
[2024-06-01 21:58:12] [INFO ] Input system was already deterministic with 1703 transitions.
[2024-06-01 21:58:13] [INFO ] Flatten gal took : 196 ms
[2024-06-01 21:58:13] [INFO ] Flatten gal took : 177 ms
[2024-06-01 21:58:14] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 71 ms.
[2024-06-01 21:58:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1992 places, 3096 transitions and 9584 arcs took 19 ms.
Total runtime 193305 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 : Peterson-PT-7-CTLFireability-2024-00
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-01
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-02
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-03
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-05
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-06
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-07
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-08
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-09
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-10
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-11
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-12
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-13
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-14
Could not compute solution for formula : Peterson-PT-7-CTLFireability-2024-15

BK_STOP 1717279095835

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Peterson-PT-7, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407300290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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