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.r464-smll-171620118400362.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 Anderson-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717258818305

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:20:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:20:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:20:20] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2024-06-01 16:20:20] [INFO ] Transformed 621 places.
[2024-06-01 16:20:20] [INFO ] Transformed 2480 transitions.
[2024-06-01 16:20:20] [INFO ] Found NUPN structural information;
[2024-06-01 16:20:20] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 551 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 46 ms.
Support contains 120 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Discarding 108 places :
Symmetric choice reduction at 0 with 108 rule applications. Total rules 108 place count 513 transition count 1868
Iterating global reduction 0 with 108 rules applied. Total rules applied 216 place count 513 transition count 1868
Applied a total of 216 rules in 160 ms. Remains 513 /621 variables (removed 108) and now considering 1868/2480 (removed 612) transitions.
// Phase 1: matrix 1868 rows 513 cols
[2024-06-01 16:20:21] [INFO ] Computed 23 invariants in 92 ms
[2024-06-01 16:20:22] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-06-01 16:20:22] [INFO ] Invariant cache hit.
[2024-06-01 16:20:22] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:20:26] [INFO ] Implicit Places using invariants and state equation in 4123 ms returned []
Implicit Place search using SMT with State Equation took 5132 ms to find 0 implicit places.
Running 1858 sub problems to find dead transitions.
[2024-06-01 16:20:26] [INFO ] Invariant cache hit.
[2024-06-01 16:20:26] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
[2024-06-01 16:20:55] [INFO ] Deduced a trap composed of 139 places in 936 ms of which 73 ms to minimize.
[2024-06-01 16:20:56] [INFO ] Deduced a trap composed of 111 places in 814 ms of which 6 ms to minimize.
[2024-06-01 16:20:56] [INFO ] Deduced a trap composed of 261 places in 670 ms of which 6 ms to minimize.
[2024-06-01 16:20:57] [INFO ] Deduced a trap composed of 126 places in 480 ms of which 6 ms to minimize.
[2024-06-01 16:20:57] [INFO ] Deduced a trap composed of 188 places in 485 ms of which 6 ms to minimize.
[2024-06-01 16:20:58] [INFO ] Deduced a trap composed of 130 places in 498 ms of which 5 ms to minimize.
[2024-06-01 16:20:59] [INFO ] Deduced a trap composed of 87 places in 588 ms of which 5 ms to minimize.
[2024-06-01 16:20:59] [INFO ] Deduced a trap composed of 159 places in 625 ms of which 6 ms to minimize.
[2024-06-01 16:21:00] [INFO ] Deduced a trap composed of 196 places in 589 ms of which 6 ms to minimize.
[2024-06-01 16:21:00] [INFO ] Deduced a trap composed of 191 places in 606 ms of which 5 ms to minimize.
[2024-06-01 16:21:01] [INFO ] Deduced a trap composed of 110 places in 566 ms of which 6 ms to minimize.
[2024-06-01 16:21:02] [INFO ] Deduced a trap composed of 323 places in 600 ms of which 5 ms to minimize.
[2024-06-01 16:21:02] [INFO ] Deduced a trap composed of 113 places in 594 ms of which 5 ms to minimize.
SMT process timed out in 36553ms, After SMT, problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 36637ms
Starting structural reductions in LTL mode, iteration 1 : 513/621 places, 1868/2480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41989 ms. Remains : 513/621 places, 1868/2480 transitions.
Support contains 120 out of 513 places after structural reductions.
[2024-06-01 16:21:03] [INFO ] Flatten gal took : 251 ms
[2024-06-01 16:21:03] [INFO ] Flatten gal took : 174 ms
[2024-06-01 16:21:03] [INFO ] Input system was already deterministic with 1868 transitions.
RANDOM walk for 40000 steps (8 resets) in 5501 ms. (7 steps per ms) remains 58/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 56/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 54/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 49/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 46/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
[2024-06-01 16:21:06] [INFO ] Invariant cache hit.
[2024-06-01 16:21:06] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 443/511 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/513 variables, 4/23 constraints. Problems are: Problem set: 4 solved, 34 unsolved
[2024-06-01 16:21:09] [INFO ] Deduced a trap composed of 240 places in 754 ms of which 6 ms to minimize.
[2024-06-01 16:21:09] [INFO ] Deduced a trap composed of 130 places in 649 ms of which 5 ms to minimize.
[2024-06-01 16:21:10] [INFO ] Deduced a trap composed of 195 places in 622 ms of which 5 ms to minimize.
[2024-06-01 16:21:11] [INFO ] Deduced a trap composed of 210 places in 570 ms of which 5 ms to minimize.
[2024-06-01 16:21:13] [INFO ] Deduced a trap composed of 183 places in 1768 ms of which 5 ms to minimize.
SMT process timed out in 6816ms, After SMT, problems are : Problem set: 4 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 87 Pre rules applied. Total rules applied 0 place count 513 transition count 1781
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 426 transition count 1781
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 214 place count 386 transition count 1147
Iterating global reduction 0 with 40 rules applied. Total rules applied 254 place count 386 transition count 1147
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 260 place count 383 transition count 1144
Applied a total of 260 rules in 170 ms. Remains 383 /513 variables (removed 130) and now considering 1144/1868 (removed 724) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 383/513 places, 1144/1868 transitions.
RANDOM walk for 40000 steps (8 resets) in 962 ms. (41 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
// Phase 1: matrix 1144 rows 383 cols
[2024-06-01 16:21:13] [INFO ] Computed 23 invariants in 24 ms
[2024-06-01 16:21:13] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 318/348 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/373 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 10/383 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1144/1527 variables, 383/406 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1527 variables, 90/496 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1527 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/1527 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1527/1527 variables, and 496 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2464 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 383/383 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 318/348 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/373 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 10/383 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:21:18] [INFO ] Deduced a trap composed of 117 places in 413 ms of which 4 ms to minimize.
[2024-06-01 16:21:19] [INFO ] Deduced a trap composed of 127 places in 414 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:21:20] [INFO ] Deduced a trap composed of 144 places in 423 ms of which 4 ms to minimize.
[2024-06-01 16:21:20] [INFO ] Deduced a trap composed of 178 places in 416 ms of which 4 ms to minimize.
[2024-06-01 16:21:20] [INFO ] Deduced a trap composed of 157 places in 415 ms of which 4 ms to minimize.
[2024-06-01 16:21:21] [INFO ] Deduced a trap composed of 105 places in 429 ms of which 4 ms to minimize.
[2024-06-01 16:21:21] [INFO ] Deduced a trap composed of 85 places in 405 ms of which 4 ms to minimize.
[2024-06-01 16:21:22] [INFO ] Deduced a trap composed of 135 places in 371 ms of which 4 ms to minimize.
[2024-06-01 16:21:22] [INFO ] Deduced a trap composed of 96 places in 414 ms of which 4 ms to minimize.
[2024-06-01 16:21:23] [INFO ] Deduced a trap composed of 164 places in 401 ms of which 4 ms to minimize.
[2024-06-01 16:21:23] [INFO ] Deduced a trap composed of 54 places in 411 ms of which 4 ms to minimize.
[2024-06-01 16:21:24] [INFO ] Deduced a trap composed of 109 places in 382 ms of which 4 ms to minimize.
[2024-06-01 16:21:24] [INFO ] Deduced a trap composed of 116 places in 350 ms of which 4 ms to minimize.
[2024-06-01 16:21:24] [INFO ] Deduced a trap composed of 268 places in 396 ms of which 4 ms to minimize.
[2024-06-01 16:21:25] [INFO ] Deduced a trap composed of 272 places in 386 ms of which 4 ms to minimize.
[2024-06-01 16:21:25] [INFO ] Deduced a trap composed of 64 places in 348 ms of which 4 ms to minimize.
[2024-06-01 16:21:26] [INFO ] Deduced a trap composed of 229 places in 394 ms of which 4 ms to minimize.
[2024-06-01 16:21:26] [INFO ] Deduced a trap composed of 192 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:21:26] [INFO ] Deduced a trap composed of 58 places in 453 ms of which 4 ms to minimize.
[2024-06-01 16:21:27] [INFO ] Deduced a trap composed of 112 places in 431 ms of which 3 ms to minimize.
[2024-06-01 16:21:27] [INFO ] Deduced a trap composed of 146 places in 352 ms of which 4 ms to minimize.
[2024-06-01 16:21:28] [INFO ] Deduced a trap composed of 131 places in 366 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:21:29] [INFO ] Deduced a trap composed of 103 places in 368 ms of which 4 ms to minimize.
[2024-06-01 16:21:29] [INFO ] Deduced a trap composed of 177 places in 381 ms of which 4 ms to minimize.
[2024-06-01 16:21:29] [INFO ] Deduced a trap composed of 163 places in 406 ms of which 4 ms to minimize.
[2024-06-01 16:21:30] [INFO ] Deduced a trap composed of 176 places in 384 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:21:31] [INFO ] Deduced a trap composed of 132 places in 398 ms of which 4 ms to minimize.
[2024-06-01 16:21:31] [INFO ] Deduced a trap composed of 166 places in 424 ms of which 4 ms to minimize.
[2024-06-01 16:21:32] [INFO ] Deduced a trap composed of 150 places in 418 ms of which 4 ms to minimize.
[2024-06-01 16:21:32] [INFO ] Deduced a trap composed of 130 places in 342 ms of which 4 ms to minimize.
[2024-06-01 16:21:32] [INFO ] Deduced a trap composed of 130 places in 481 ms of which 4 ms to minimize.
[2024-06-01 16:21:33] [INFO ] Deduced a trap composed of 171 places in 391 ms of which 3 ms to minimize.
[2024-06-01 16:21:33] [INFO ] Deduced a trap composed of 158 places in 459 ms of which 8 ms to minimize.
[2024-06-01 16:21:34] [INFO ] Deduced a trap composed of 93 places in 556 ms of which 6 ms to minimize.
[2024-06-01 16:21:34] [INFO ] Deduced a trap composed of 80 places in 471 ms of which 4 ms to minimize.
[2024-06-01 16:21:35] [INFO ] Deduced a trap composed of 123 places in 448 ms of which 6 ms to minimize.
[2024-06-01 16:21:35] [INFO ] Deduced a trap composed of 105 places in 406 ms of which 4 ms to minimize.
[2024-06-01 16:21:36] [INFO ] Deduced a trap composed of 86 places in 399 ms of which 4 ms to minimize.
[2024-06-01 16:21:36] [INFO ] Deduced a trap composed of 215 places in 373 ms of which 8 ms to minimize.
[2024-06-01 16:21:37] [INFO ] Deduced a trap composed of 171 places in 372 ms of which 3 ms to minimize.
[2024-06-01 16:21:37] [INFO ] Deduced a trap composed of 101 places in 397 ms of which 4 ms to minimize.
[2024-06-01 16:21:37] [INFO ] Deduced a trap composed of 154 places in 406 ms of which 4 ms to minimize.
[2024-06-01 16:21:38] [INFO ] Deduced a trap composed of 79 places in 326 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 17/66 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:21:39] [INFO ] Deduced a trap composed of 98 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:21:39] [INFO ] Deduced a trap composed of 94 places in 384 ms of which 4 ms to minimize.
[2024-06-01 16:21:40] [INFO ] Deduced a trap composed of 161 places in 391 ms of which 4 ms to minimize.
[2024-06-01 16:21:40] [INFO ] Deduced a trap composed of 145 places in 400 ms of which 4 ms to minimize.
[2024-06-01 16:21:41] [INFO ] Deduced a trap composed of 182 places in 363 ms of which 4 ms to minimize.
[2024-06-01 16:21:41] [INFO ] Deduced a trap composed of 145 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:21:42] [INFO ] Deduced a trap composed of 189 places in 372 ms of which 4 ms to minimize.
[2024-06-01 16:21:42] [INFO ] Deduced a trap composed of 190 places in 392 ms of which 4 ms to minimize.
[2024-06-01 16:21:43] [INFO ] Deduced a trap composed of 220 places in 368 ms of which 4 ms to minimize.
[2024-06-01 16:21:43] [INFO ] Deduced a trap composed of 175 places in 389 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 1144/1527 variables, 383/459 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1527 variables, 90/549 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1527 variables, 15/564 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1527/1527 variables, and 564 constraints, problems are : Problem set: 0 solved, 15 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 383/383 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 53/53 constraints]
After SMT, in 47557ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 1144/1144 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 368 transition count 859
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 368 transition count 859
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 367 transition count 858
Applied a total of 32 rules in 118 ms. Remains 367 /383 variables (removed 16) and now considering 858/1144 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 367/383 places, 858/1144 transitions.
RANDOM walk for 40000 steps (8 resets) in 676 ms. (59 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 115669 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 15
Probabilistic random walk after 115669 steps, saw 85296 distinct states, run finished after 3017 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 858 rows 367 cols
[2024-06-01 16:22:05] [INFO ] Computed 23 invariants in 19 ms
[2024-06-01 16:22:05] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 329/359 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/360 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 7/367 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 858/1225 variables, 367/390 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1225 variables, 90/480 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1225 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:22:07] [INFO ] Deduced a trap composed of 177 places in 416 ms of which 4 ms to minimize.
[2024-06-01 16:22:07] [INFO ] Deduced a trap composed of 178 places in 361 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/1225 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1225 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/1225 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1225/1225 variables, and 482 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3766 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 367/367 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 329/359 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/360 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:22:09] [INFO ] Deduced a trap composed of 154 places in 316 ms of which 3 ms to minimize.
[2024-06-01 16:22:09] [INFO ] Deduced a trap composed of 263 places in 305 ms of which 3 ms to minimize.
[2024-06-01 16:22:10] [INFO ] Deduced a trap composed of 143 places in 314 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 7/367 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:22:11] [INFO ] Deduced a trap composed of 77 places in 354 ms of which 3 ms to minimize.
[2024-06-01 16:22:11] [INFO ] Deduced a trap composed of 82 places in 332 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:22:11] [INFO ] Deduced a trap composed of 119 places in 321 ms of which 3 ms to minimize.
[2024-06-01 16:22:12] [INFO ] Deduced a trap composed of 158 places in 314 ms of which 4 ms to minimize.
[2024-06-01 16:22:12] [INFO ] Deduced a trap composed of 141 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:22:13] [INFO ] Deduced a trap composed of 113 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:22:13] [INFO ] Deduced a trap composed of 200 places in 321 ms of which 3 ms to minimize.
[2024-06-01 16:22:13] [INFO ] Deduced a trap composed of 107 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:22:14] [INFO ] Deduced a trap composed of 207 places in 334 ms of which 3 ms to minimize.
[2024-06-01 16:22:14] [INFO ] Deduced a trap composed of 61 places in 336 ms of which 3 ms to minimize.
[2024-06-01 16:22:14] [INFO ] Deduced a trap composed of 146 places in 333 ms of which 4 ms to minimize.
[2024-06-01 16:22:15] [INFO ] Deduced a trap composed of 121 places in 330 ms of which 3 ms to minimize.
[2024-06-01 16:22:15] [INFO ] Deduced a trap composed of 159 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:22:15] [INFO ] Deduced a trap composed of 115 places in 335 ms of which 4 ms to minimize.
[2024-06-01 16:22:16] [INFO ] Deduced a trap composed of 160 places in 339 ms of which 3 ms to minimize.
[2024-06-01 16:22:16] [INFO ] Deduced a trap composed of 152 places in 337 ms of which 3 ms to minimize.
[2024-06-01 16:22:16] [INFO ] Deduced a trap composed of 158 places in 333 ms of which 3 ms to minimize.
[2024-06-01 16:22:17] [INFO ] Deduced a trap composed of 107 places in 336 ms of which 3 ms to minimize.
[2024-06-01 16:22:17] [INFO ] Deduced a trap composed of 100 places in 290 ms of which 3 ms to minimize.
[2024-06-01 16:22:17] [INFO ] Deduced a trap composed of 133 places in 336 ms of which 4 ms to minimize.
[2024-06-01 16:22:18] [INFO ] Deduced a trap composed of 154 places in 337 ms of which 4 ms to minimize.
[2024-06-01 16:22:18] [INFO ] Deduced a trap composed of 168 places in 344 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:22:18] [INFO ] Deduced a trap composed of 167 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:22:19] [INFO ] Deduced a trap composed of 129 places in 329 ms of which 4 ms to minimize.
[2024-06-01 16:22:19] [INFO ] Deduced a trap composed of 144 places in 332 ms of which 4 ms to minimize.
[2024-06-01 16:22:20] [INFO ] Deduced a trap composed of 167 places in 366 ms of which 4 ms to minimize.
[2024-06-01 16:22:20] [INFO ] Deduced a trap composed of 129 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:22:20] [INFO ] Deduced a trap composed of 129 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:22:21] [INFO ] Deduced a trap composed of 126 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:22:21] [INFO ] Deduced a trap composed of 158 places in 309 ms of which 3 ms to minimize.
[2024-06-01 16:22:21] [INFO ] Deduced a trap composed of 114 places in 360 ms of which 4 ms to minimize.
[2024-06-01 16:22:22] [INFO ] Deduced a trap composed of 90 places in 359 ms of which 4 ms to minimize.
[2024-06-01 16:22:22] [INFO ] Deduced a trap composed of 120 places in 332 ms of which 4 ms to minimize.
[2024-06-01 16:22:22] [INFO ] Deduced a trap composed of 194 places in 344 ms of which 4 ms to minimize.
[2024-06-01 16:22:23] [INFO ] Deduced a trap composed of 132 places in 343 ms of which 4 ms to minimize.
[2024-06-01 16:22:23] [INFO ] Deduced a trap composed of 197 places in 345 ms of which 4 ms to minimize.
[2024-06-01 16:22:23] [INFO ] Deduced a trap composed of 152 places in 351 ms of which 3 ms to minimize.
[2024-06-01 16:22:24] [INFO ] Deduced a trap composed of 125 places in 345 ms of which 4 ms to minimize.
[2024-06-01 16:22:24] [INFO ] Deduced a trap composed of 103 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:22:24] [INFO ] Deduced a trap composed of 126 places in 347 ms of which 4 ms to minimize.
[2024-06-01 16:22:25] [INFO ] Deduced a trap composed of 100 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:22:25] [INFO ] Deduced a trap composed of 80 places in 356 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:22:26] [INFO ] Deduced a trap composed of 99 places in 329 ms of which 4 ms to minimize.
[2024-06-01 16:22:26] [INFO ] Deduced a trap composed of 90 places in 323 ms of which 4 ms to minimize.
[2024-06-01 16:22:27] [INFO ] Deduced a trap composed of 200 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:22:27] [INFO ] Deduced a trap composed of 203 places in 337 ms of which 4 ms to minimize.
[2024-06-01 16:22:27] [INFO ] Deduced a trap composed of 132 places in 331 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:22:28] [INFO ] Deduced a trap composed of 97 places in 335 ms of which 4 ms to minimize.
[2024-06-01 16:22:29] [INFO ] Deduced a trap composed of 74 places in 310 ms of which 4 ms to minimize.
[2024-06-01 16:22:29] [INFO ] Deduced a trap composed of 96 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:22:29] [INFO ] Deduced a trap composed of 173 places in 306 ms of which 4 ms to minimize.
[2024-06-01 16:22:30] [INFO ] Deduced a trap composed of 123 places in 326 ms of which 3 ms to minimize.
[2024-06-01 16:22:30] [INFO ] Deduced a trap composed of 226 places in 354 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/367 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/367 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 858/1225 variables, 367/448 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1225 variables, 90/538 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1225 variables, 15/553 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 16:23:02] [INFO ] Deduced a trap composed of 206 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:23:03] [INFO ] Deduced a trap composed of 219 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:23:03] [INFO ] Deduced a trap composed of 147 places in 299 ms of which 3 ms to minimize.
[2024-06-01 16:23:04] [INFO ] Deduced a trap composed of 107 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:23:04] [INFO ] Deduced a trap composed of 166 places in 309 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1225 variables, 5/558 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1225/1225 variables, and 558 constraints, problems are : Problem set: 0 solved, 15 unsolved in 75009 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 367/367 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 63/63 constraints]
After SMT, in 78852ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 858/858 transitions.
Applied a total of 0 rules in 23 ms. Remains 367 /367 variables (removed 0) and now considering 858/858 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 367/367 places, 858/858 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 858/858 transitions.
Applied a total of 0 rules in 22 ms. Remains 367 /367 variables (removed 0) and now considering 858/858 (removed 0) transitions.
[2024-06-01 16:23:23] [INFO ] Invariant cache hit.
[2024-06-01 16:23:24] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-06-01 16:23:24] [INFO ] Invariant cache hit.
[2024-06-01 16:23:25] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:23:26] [INFO ] Implicit Places using invariants and state equation in 2155 ms returned []
Implicit Place search using SMT with State Equation took 2885 ms to find 0 implicit places.
[2024-06-01 16:23:26] [INFO ] Redundant transitions in 57 ms returned []
Running 848 sub problems to find dead transitions.
[2024-06-01 16:23:26] [INFO ] Invariant cache hit.
[2024-06-01 16:23:26] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-06-01 16:23:36] [INFO ] Deduced a trap composed of 198 places in 338 ms of which 4 ms to minimize.
[2024-06-01 16:23:36] [INFO ] Deduced a trap composed of 108 places in 329 ms of which 4 ms to minimize.
[2024-06-01 16:23:37] [INFO ] Deduced a trap composed of 225 places in 327 ms of which 4 ms to minimize.
[2024-06-01 16:23:37] [INFO ] Deduced a trap composed of 178 places in 465 ms of which 4 ms to minimize.
[2024-06-01 16:23:38] [INFO ] Deduced a trap composed of 176 places in 343 ms of which 3 ms to minimize.
[2024-06-01 16:23:38] [INFO ] Deduced a trap composed of 152 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:23:38] [INFO ] Deduced a trap composed of 205 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:23:39] [INFO ] Deduced a trap composed of 109 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:23:39] [INFO ] Deduced a trap composed of 81 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:23:39] [INFO ] Deduced a trap composed of 196 places in 338 ms of which 3 ms to minimize.
[2024-06-01 16:23:40] [INFO ] Deduced a trap composed of 98 places in 333 ms of which 3 ms to minimize.
[2024-06-01 16:23:40] [INFO ] Deduced a trap composed of 205 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:23:40] [INFO ] Deduced a trap composed of 179 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:23:41] [INFO ] Deduced a trap composed of 108 places in 326 ms of which 3 ms to minimize.
[2024-06-01 16:23:41] [INFO ] Deduced a trap composed of 253 places in 332 ms of which 4 ms to minimize.
[2024-06-01 16:23:41] [INFO ] Deduced a trap composed of 112 places in 333 ms of which 3 ms to minimize.
[2024-06-01 16:23:42] [INFO ] Deduced a trap composed of 187 places in 331 ms of which 4 ms to minimize.
[2024-06-01 16:23:42] [INFO ] Deduced a trap composed of 195 places in 341 ms of which 4 ms to minimize.
[2024-06-01 16:23:42] [INFO ] Deduced a trap composed of 192 places in 326 ms of which 3 ms to minimize.
[2024-06-01 16:23:43] [INFO ] Deduced a trap composed of 122 places in 328 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-06-01 16:23:44] [INFO ] Deduced a trap composed of 106 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:23:45] [INFO ] Deduced a trap composed of 142 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:23:45] [INFO ] Deduced a trap composed of 74 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:23:46] [INFO ] Deduced a trap composed of 199 places in 316 ms of which 3 ms to minimize.
[2024-06-01 16:23:46] [INFO ] Deduced a trap composed of 194 places in 318 ms of which 4 ms to minimize.
[2024-06-01 16:23:46] [INFO ] Deduced a trap composed of 136 places in 318 ms of which 4 ms to minimize.
[2024-06-01 16:23:47] [INFO ] Deduced a trap composed of 106 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:23:47] [INFO ] Deduced a trap composed of 216 places in 324 ms of which 4 ms to minimize.
[2024-06-01 16:23:48] [INFO ] Deduced a trap composed of 112 places in 328 ms of which 3 ms to minimize.
[2024-06-01 16:23:48] [INFO ] Deduced a trap composed of 160 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:23:48] [INFO ] Deduced a trap composed of 202 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:23:49] [INFO ] Deduced a trap composed of 159 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:23:49] [INFO ] Deduced a trap composed of 186 places in 309 ms of which 4 ms to minimize.
[2024-06-01 16:23:49] [INFO ] Deduced a trap composed of 140 places in 334 ms of which 3 ms to minimize.
[2024-06-01 16:23:50] [INFO ] Deduced a trap composed of 157 places in 335 ms of which 4 ms to minimize.
[2024-06-01 16:23:50] [INFO ] Deduced a trap composed of 115 places in 343 ms of which 4 ms to minimize.
[2024-06-01 16:23:50] [INFO ] Deduced a trap composed of 91 places in 345 ms of which 4 ms to minimize.
[2024-06-01 16:23:51] [INFO ] Deduced a trap composed of 121 places in 338 ms of which 4 ms to minimize.
[2024-06-01 16:23:51] [INFO ] Deduced a trap composed of 111 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:23:52] [INFO ] Deduced a trap composed of 165 places in 337 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/1225 variables, and 63 constraints, problems are : Problem set: 0 solved, 848 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/367 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 848/848 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 848 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 40/63 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-06-01 16:24:02] [INFO ] Deduced a trap composed of 208 places in 338 ms of which 4 ms to minimize.
[2024-06-01 16:24:02] [INFO ] Deduced a trap composed of 201 places in 385 ms of which 4 ms to minimize.
[2024-06-01 16:24:03] [INFO ] Deduced a trap composed of 176 places in 332 ms of which 3 ms to minimize.
[2024-06-01 16:24:03] [INFO ] Deduced a trap composed of 85 places in 339 ms of which 4 ms to minimize.
[2024-06-01 16:24:03] [INFO ] Deduced a trap composed of 186 places in 342 ms of which 4 ms to minimize.
[2024-06-01 16:24:04] [INFO ] Deduced a trap composed of 164 places in 324 ms of which 3 ms to minimize.
[2024-06-01 16:24:04] [INFO ] Deduced a trap composed of 160 places in 348 ms of which 3 ms to minimize.
[2024-06-01 16:24:05] [INFO ] Deduced a trap composed of 122 places in 334 ms of which 7 ms to minimize.
[2024-06-01 16:24:05] [INFO ] Deduced a trap composed of 70 places in 346 ms of which 4 ms to minimize.
[2024-06-01 16:24:05] [INFO ] Deduced a trap composed of 137 places in 332 ms of which 3 ms to minimize.
[2024-06-01 16:24:06] [INFO ] Deduced a trap composed of 146 places in 339 ms of which 4 ms to minimize.
[2024-06-01 16:24:06] [INFO ] Deduced a trap composed of 141 places in 327 ms of which 4 ms to minimize.
[2024-06-01 16:24:07] [INFO ] Deduced a trap composed of 179 places in 338 ms of which 4 ms to minimize.
[2024-06-01 16:24:08] [INFO ] Deduced a trap composed of 97 places in 321 ms of which 3 ms to minimize.
[2024-06-01 16:24:08] [INFO ] Deduced a trap composed of 95 places in 327 ms of which 3 ms to minimize.
[2024-06-01 16:24:09] [INFO ] Deduced a trap composed of 81 places in 326 ms of which 3 ms to minimize.
[2024-06-01 16:24:09] [INFO ] Deduced a trap composed of 178 places in 301 ms of which 3 ms to minimize.
[2024-06-01 16:24:09] [INFO ] Deduced a trap composed of 182 places in 306 ms of which 4 ms to minimize.
[2024-06-01 16:24:10] [INFO ] Deduced a trap composed of 118 places in 390 ms of which 6 ms to minimize.
[2024-06-01 16:24:10] [INFO ] Deduced a trap composed of 170 places in 384 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-06-01 16:24:13] [INFO ] Deduced a trap composed of 142 places in 345 ms of which 4 ms to minimize.
[2024-06-01 16:24:14] [INFO ] Deduced a trap composed of 94 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:24:14] [INFO ] Deduced a trap composed of 62 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:24:15] [INFO ] Deduced a trap composed of 101 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:24:15] [INFO ] Deduced a trap composed of 100 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:24:15] [INFO ] Deduced a trap composed of 82 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:24:16] [INFO ] Deduced a trap composed of 185 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:24:16] [INFO ] Deduced a trap composed of 154 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:24:16] [INFO ] Deduced a trap composed of 163 places in 309 ms of which 4 ms to minimize.
[2024-06-01 16:24:17] [INFO ] Deduced a trap composed of 88 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:24:17] [INFO ] Deduced a trap composed of 98 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:24:17] [INFO ] Deduced a trap composed of 134 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:24:18] [INFO ] Deduced a trap composed of 82 places in 309 ms of which 3 ms to minimize.
[2024-06-01 16:24:18] [INFO ] Deduced a trap composed of 93 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:24:18] [INFO ] Deduced a trap composed of 81 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:24:19] [INFO ] Deduced a trap composed of 83 places in 317 ms of which 4 ms to minimize.
[2024-06-01 16:24:19] [INFO ] Deduced a trap composed of 138 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:24:19] [INFO ] Deduced a trap composed of 97 places in 359 ms of which 4 ms to minimize.
[2024-06-01 16:24:20] [INFO ] Deduced a trap composed of 143 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:24:20] [INFO ] Deduced a trap composed of 128 places in 341 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-06-01 16:24:26] [INFO ] Deduced a trap composed of 136 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:24:26] [INFO ] Deduced a trap composed of 184 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:24:26] [INFO ] Deduced a trap composed of 104 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:24:27] [INFO ] Deduced a trap composed of 122 places in 324 ms of which 4 ms to minimize.
[2024-06-01 16:24:27] [INFO ] Deduced a trap composed of 103 places in 312 ms of which 3 ms to minimize.
[2024-06-01 16:24:27] [INFO ] Deduced a trap composed of 96 places in 303 ms of which 8 ms to minimize.
[2024-06-01 16:24:28] [INFO ] Deduced a trap composed of 125 places in 343 ms of which 4 ms to minimize.
SMT process timed out in 61278ms, After SMT, problems are : Problem set: 0 solved, 848 unsolved
Search for dead transitions found 0 dead transitions in 61289ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64265 ms. Remains : 367/367 places, 858/858 transitions.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA Anderson-PT-10-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:24:28] [INFO ] Flatten gal took : 167 ms
[2024-06-01 16:24:28] [INFO ] Flatten gal took : 118 ms
[2024-06-01 16:24:28] [INFO ] Input system was already deterministic with 1868 transitions.
Support contains 90 out of 513 places (down from 91) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 513 transition count 1778
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 423 transition count 1778
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 247 place count 356 transition count 685
Iterating global reduction 0 with 67 rules applied. Total rules applied 314 place count 356 transition count 685
Applied a total of 314 rules in 85 ms. Remains 356 /513 variables (removed 157) and now considering 685/1868 (removed 1183) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 87 ms. Remains : 356/513 places, 685/1868 transitions.
[2024-06-01 16:24:29] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:24:29] [INFO ] Flatten gal took : 28 ms
[2024-06-01 16:24:29] [INFO ] Input system was already deterministic with 685 transitions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 447 transition count 758
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 447 transition count 758
Applied a total of 132 rules in 18 ms. Remains 447 /513 variables (removed 66) and now considering 758/1868 (removed 1110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 447/513 places, 758/1868 transitions.
[2024-06-01 16:24:29] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:24:29] [INFO ] Flatten gal took : 30 ms
[2024-06-01 16:24:29] [INFO ] Input system was already deterministic with 758 transitions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 447 transition count 794
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 447 transition count 794
Applied a total of 132 rules in 18 ms. Remains 447 /513 variables (removed 66) and now considering 794/1868 (removed 1074) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 447/513 places, 794/1868 transitions.
[2024-06-01 16:24:29] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:24:29] [INFO ] Flatten gal took : 30 ms
[2024-06-01 16:24:29] [INFO ] Input system was already deterministic with 794 transitions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 443 transition count 718
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 443 transition count 718
Applied a total of 140 rules in 17 ms. Remains 443 /513 variables (removed 70) and now considering 718/1868 (removed 1150) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 443/513 places, 718/1868 transitions.
[2024-06-01 16:24:29] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:24:29] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:24:29] [INFO ] Input system was already deterministic with 718 transitions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 450 transition count 833
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 450 transition count 833
Applied a total of 126 rules in 19 ms. Remains 450 /513 variables (removed 63) and now considering 833/1868 (removed 1035) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 450/513 places, 833/1868 transitions.
[2024-06-01 16:24:29] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:24:29] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:24:29] [INFO ] Input system was already deterministic with 833 transitions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 443 transition count 718
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 443 transition count 718
Applied a total of 140 rules in 18 ms. Remains 443 /513 variables (removed 70) and now considering 718/1868 (removed 1150) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 443/513 places, 718/1868 transitions.
[2024-06-01 16:24:29] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:24:29] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:24:30] [INFO ] Input system was already deterministic with 718 transitions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 448 transition count 777
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 448 transition count 777
Applied a total of 130 rules in 17 ms. Remains 448 /513 variables (removed 65) and now considering 777/1868 (removed 1091) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 448/513 places, 777/1868 transitions.
[2024-06-01 16:24:30] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:24:30] [INFO ] Flatten gal took : 28 ms
[2024-06-01 16:24:30] [INFO ] Input system was already deterministic with 777 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 513 transition count 1778
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 423 transition count 1778
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 251 place count 352 transition count 609
Iterating global reduction 0 with 71 rules applied. Total rules applied 322 place count 352 transition count 609
Applied a total of 322 rules in 45 ms. Remains 352 /513 variables (removed 161) and now considering 609/1868 (removed 1259) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 352/513 places, 609/1868 transitions.
[2024-06-01 16:24:30] [INFO ] Flatten gal took : 19 ms
[2024-06-01 16:24:30] [INFO ] Flatten gal took : 19 ms
[2024-06-01 16:24:30] [INFO ] Input system was already deterministic with 609 transitions.
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 457291 steps, run visited all 1 properties in 1413 ms. (steps per millisecond=323 )
Probabilistic random walk after 457291 steps, saw 340531 distinct states, run finished after 1424 ms. (steps per millisecond=321 ) properties seen :1
FORMULA Anderson-PT-10-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 513 transition count 1778
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 423 transition count 1778
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 251 place count 352 transition count 609
Iterating global reduction 0 with 71 rules applied. Total rules applied 322 place count 352 transition count 609
Applied a total of 322 rules in 42 ms. Remains 352 /513 variables (removed 161) and now considering 609/1868 (removed 1259) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 352/513 places, 609/1868 transitions.
[2024-06-01 16:24:31] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:24:32] [INFO ] Input system was already deterministic with 609 transitions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 448 transition count 795
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 448 transition count 795
Applied a total of 130 rules in 17 ms. Remains 448 /513 variables (removed 65) and now considering 795/1868 (removed 1073) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 448/513 places, 795/1868 transitions.
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:24:32] [INFO ] Input system was already deterministic with 795 transitions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 444 transition count 737
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 444 transition count 737
Applied a total of 138 rules in 18 ms. Remains 444 /513 variables (removed 69) and now considering 737/1868 (removed 1131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 444/513 places, 737/1868 transitions.
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:24:32] [INFO ] Input system was already deterministic with 737 transitions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 445 transition count 756
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 445 transition count 756
Applied a total of 136 rules in 20 ms. Remains 445 /513 variables (removed 68) and now considering 756/1868 (removed 1112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 445/513 places, 756/1868 transitions.
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:24:32] [INFO ] Input system was already deterministic with 756 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 89 Pre rules applied. Total rules applied 0 place count 513 transition count 1779
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 0 with 178 rules applied. Total rules applied 178 place count 424 transition count 1779
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 246 place count 356 transition count 667
Iterating global reduction 0 with 68 rules applied. Total rules applied 314 place count 356 transition count 667
Applied a total of 314 rules in 39 ms. Remains 356 /513 variables (removed 157) and now considering 667/1868 (removed 1201) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 356/513 places, 667/1868 transitions.
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:24:32] [INFO ] Input system was already deterministic with 667 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 513 transition count 1778
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 423 transition count 1778
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 248 place count 355 transition count 666
Iterating global reduction 0 with 68 rules applied. Total rules applied 316 place count 355 transition count 666
Applied a total of 316 rules in 39 ms. Remains 355 /513 variables (removed 158) and now considering 666/1868 (removed 1202) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 355/513 places, 666/1868 transitions.
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:24:32] [INFO ] Input system was already deterministic with 666 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 513/513 places, 1868/1868 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 513 transition count 1778
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 423 transition count 1778
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 248 place count 355 transition count 666
Iterating global reduction 0 with 68 rules applied. Total rules applied 316 place count 355 transition count 666
Applied a total of 316 rules in 38 ms. Remains 355 /513 variables (removed 158) and now considering 666/1868 (removed 1202) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 355/513 places, 666/1868 transitions.
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 17 ms
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:24:32] [INFO ] Input system was already deterministic with 666 transitions.
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:24:32] [INFO ] Flatten gal took : 58 ms
[2024-06-01 16:24:33] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-06-01 16:24:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 513 places, 1868 transitions and 7272 arcs took 16 ms.
Total runtime 253072 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 : Anderson-PT-10-CTLFireability-2024-00
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2024-01
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2024-02
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2024-03
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2024-04
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2024-05
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2024-07
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2024-09
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2024-10
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2024-11
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2023-12
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2023-13
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2023-14
Could not compute solution for formula : Anderson-PT-10-CTLFireability-2023-15

BK_STOP 1717259073524

--------------------
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 Anderson-PT-10-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1234/ctl_0_
ctl formula name Anderson-PT-10-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1234/ctl_1_
ctl formula name Anderson-PT-10-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1234/ctl_2_
ctl formula name Anderson-PT-10-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1234/ctl_3_
ctl formula name Anderson-PT-10-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1234/ctl_4_
ctl formula name Anderson-PT-10-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1234/ctl_5_
ctl formula name Anderson-PT-10-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1234/ctl_6_
ctl formula name Anderson-PT-10-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1234/ctl_7_
ctl formula name Anderson-PT-10-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1234/ctl_8_
ctl formula name Anderson-PT-10-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1234/ctl_9_
ctl formula name Anderson-PT-10-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1234/ctl_10_
ctl formula name Anderson-PT-10-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1234/ctl_11_
ctl formula name Anderson-PT-10-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1234/ctl_12_
ctl formula name Anderson-PT-10-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1234/ctl_13_
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="Anderson-PT-10"
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 Anderson-PT-10, 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 r464-smll-171620118400362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-10.tgz
mv Anderson-PT-10 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 ;