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.r069-tall-171620503900126.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 greatspnxred
Input is CANInsertWithFailure-PT-040, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503900126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.8M 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 CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2023-02
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2023-07
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2023-10
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-11
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-13
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-14
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716395834237

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 16:37:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 16:37:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 16:37:15] [INFO ] Load time of PNML (sax parser for PT used): 367 ms
[2024-05-22 16:37:15] [INFO ] Transformed 3684 places.
[2024-05-22 16:37:15] [INFO ] Transformed 9840 transitions.
[2024-05-22 16:37:15] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (40 resets) in 2275 ms. (17 steps per ms) remains 7/16 properties
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 815 ms. (49 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
// Phase 1: matrix 9840 rows 3684 cols
[2024-05-22 16:37:17] [INFO ] Computed 43 invariants in 602 ms
[2024-05-22 16:37:18] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 3479/3627 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3627 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 52/3679 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/3681 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3681 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 9840/13521 variables, 3681/3723 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13521 variables, 3160/6883 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13521/13524 variables, and 6883 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5063 ms.
Refiners :[Positive P Invariants (semi-flows): 40/41 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3681/3684 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 3479/3627 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 16:37:24] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3627 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3627 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 52/3679 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 16:37:28] [INFO ] Deduced a trap composed of 72 places in 2994 ms of which 23 ms to minimize.
SMT process timed out in 11565ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 148 out of 3684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Graph (complete) has 13401 edges and 3684 vertex of which 3683 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 255 rules applied. Total rules applied 256 place count 3683 transition count 9585
Reduce places removed 255 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 264 rules applied. Total rules applied 520 place count 3428 transition count 9576
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 529 place count 3419 transition count 9576
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 529 place count 3419 transition count 9574
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 533 place count 3417 transition count 9574
Performed 1307 Post agglomeration using F-continuation condition.Transition count delta: 1307
Deduced a syphon composed of 1307 places in 6 ms
Reduce places removed 1307 places and 0 transitions.
Iterating global reduction 3 with 2614 rules applied. Total rules applied 3147 place count 2110 transition count 8267
Drop transitions (Redundant composition of simpler transitions.) removed 1236 transitions
Redundant transition composition rules discarded 1236 transitions
Iterating global reduction 3 with 1236 rules applied. Total rules applied 4383 place count 2110 transition count 7031
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 4390 place count 2110 transition count 7024
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 4397 place count 2103 transition count 7024
Partial Free-agglomeration rule applied 1911 times.
Drop transitions (Partial Free agglomeration) removed 1911 transitions
Iterating global reduction 4 with 1911 rules applied. Total rules applied 6308 place count 2103 transition count 7024
Partial Free-agglomeration rule applied 45 times.
Drop transitions (Partial Free agglomeration) removed 45 transitions
Iterating global reduction 4 with 45 rules applied. Total rules applied 6353 place count 2103 transition count 7024
Applied a total of 6353 rules in 2091 ms. Remains 2103 /3684 variables (removed 1581) and now considering 7024/9840 (removed 2816) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2107 ms. Remains : 2103/3684 places, 7024/9840 transitions.
RANDOM walk for 40000 steps (171 resets) in 1163 ms. (34 steps per ms) remains 5/7 properties
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
// Phase 1: matrix 7024 rows 2103 cols
[2024-05-22 16:37:31] [INFO ] Computed 42 invariants in 189 ms
[2024-05-22 16:37:31] [INFO ] State equation strengthened by 6253 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1903/2048 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2048 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 52/2100 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2100 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2100 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/2101 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 7024/9125 variables, 2101/2143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CANInsertWithFailure-PT-040-ReachabilityCardinality-2023-02 is UNSAT
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-2023-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (INCLUDED_ONLY) 0/9125 variables, 6253/8396 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/9125 variables, 0/8396 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/9127 variables, 2/8398 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/9127 variables, 0/8398 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/9127 variables, 0/8398 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9127/9127 variables, and 8398 constraints, problems are : Problem set: 1 solved, 4 unsolved in 6033 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2103/2103 constraints, ReadFeed: 6253/6253 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1971/2037 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 16:37:38] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2037 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2037 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 62/2099 variables, 31/41 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2099 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/2101 variables, 2/43 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 16:37:40] [INFO ] Deduced a trap composed of 75 places in 1705 ms of which 12 ms to minimize.
[2024-05-22 16:37:42] [INFO ] Deduced a trap composed of 72 places in 1700 ms of which 13 ms to minimize.
[2024-05-22 16:37:44] [INFO ] Deduced a trap composed of 47 places in 1613 ms of which 12 ms to minimize.
[2024-05-22 16:37:45] [INFO ] Deduced a trap composed of 47 places in 1657 ms of which 13 ms to minimize.
[2024-05-22 16:37:47] [INFO ] Deduced a trap composed of 47 places in 1670 ms of which 18 ms to minimize.
[2024-05-22 16:37:49] [INFO ] Deduced a trap composed of 48 places in 1608 ms of which 13 ms to minimize.
[2024-05-22 16:37:50] [INFO ] Deduced a trap composed of 54 places in 1511 ms of which 12 ms to minimize.
[2024-05-22 16:37:52] [INFO ] Deduced a trap composed of 49 places in 1453 ms of which 15 ms to minimize.
[2024-05-22 16:37:53] [INFO ] Deduced a trap composed of 79 places in 1478 ms of which 11 ms to minimize.
[2024-05-22 16:37:55] [INFO ] Deduced a trap composed of 47 places in 1380 ms of which 12 ms to minimize.
[2024-05-22 16:37:56] [INFO ] Deduced a trap composed of 46 places in 1240 ms of which 11 ms to minimize.
[2024-05-22 16:37:57] [INFO ] Deduced a trap composed of 48 places in 1326 ms of which 11 ms to minimize.
[2024-05-22 16:37:58] [INFO ] Deduced a trap composed of 71 places in 1328 ms of which 11 ms to minimize.
[2024-05-22 16:38:00] [INFO ] Deduced a trap composed of 59 places in 1328 ms of which 11 ms to minimize.
[2024-05-22 16:38:01] [INFO ] Deduced a trap composed of 47 places in 1217 ms of which 11 ms to minimize.
[2024-05-22 16:38:02] [INFO ] Deduced a trap composed of 54 places in 1177 ms of which 10 ms to minimize.
[2024-05-22 16:38:04] [INFO ] Deduced a trap composed of 48 places in 1212 ms of which 11 ms to minimize.
[2024-05-22 16:38:05] [INFO ] Deduced a trap composed of 71 places in 1231 ms of which 10 ms to minimize.
[2024-05-22 16:38:06] [INFO ] Deduced a trap composed of 49 places in 1153 ms of which 10 ms to minimize.
[2024-05-22 16:38:07] [INFO ] Deduced a trap composed of 75 places in 1159 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2101 variables, 20/63 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 16:38:08] [INFO ] Deduced a trap composed of 65 places in 1143 ms of which 9 ms to minimize.
[2024-05-22 16:38:10] [INFO ] Deduced a trap composed of 59 places in 1105 ms of which 10 ms to minimize.
[2024-05-22 16:38:11] [INFO ] Deduced a trap composed of 53 places in 1111 ms of which 10 ms to minimize.
[2024-05-22 16:38:12] [INFO ] Deduced a trap composed of 58 places in 1101 ms of which 11 ms to minimize.
[2024-05-22 16:38:13] [INFO ] Deduced a trap composed of 57 places in 1055 ms of which 9 ms to minimize.
[2024-05-22 16:38:14] [INFO ] Deduced a trap composed of 65 places in 1049 ms of which 11 ms to minimize.
[2024-05-22 16:38:15] [INFO ] Deduced a trap composed of 68 places in 1053 ms of which 9 ms to minimize.
[2024-05-22 16:38:16] [INFO ] Deduced a trap composed of 65 places in 1089 ms of which 9 ms to minimize.
[2024-05-22 16:38:17] [INFO ] Deduced a trap composed of 48 places in 1090 ms of which 10 ms to minimize.
[2024-05-22 16:38:18] [INFO ] Deduced a trap composed of 64 places in 1098 ms of which 9 ms to minimize.
[2024-05-22 16:38:20] [INFO ] Deduced a trap composed of 63 places in 1093 ms of which 10 ms to minimize.
[2024-05-22 16:38:21] [INFO ] Deduced a trap composed of 62 places in 1073 ms of which 12 ms to minimize.
[2024-05-22 16:38:22] [INFO ] Deduced a trap composed of 46 places in 1016 ms of which 10 ms to minimize.
[2024-05-22 16:38:23] [INFO ] Deduced a trap composed of 49 places in 1089 ms of which 10 ms to minimize.
SMT process timed out in 51731ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 66 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 7024/7024 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 2103 transition count 7021
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 2100 transition count 7020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 2099 transition count 7020
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 84 place count 2061 transition count 6982
Partial Free-agglomeration rule applied 223 times.
Drop transitions (Partial Free agglomeration) removed 223 transitions
Iterating global reduction 3 with 223 rules applied. Total rules applied 307 place count 2061 transition count 6982
Applied a total of 307 rules in 464 ms. Remains 2061 /2103 variables (removed 42) and now considering 6982/7024 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 2061/2103 places, 6982/7024 transitions.
RANDOM walk for 40000 steps (184 resets) in 822 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 97095 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 4
Probabilistic random walk after 97095 steps, saw 32642 distinct states, run finished after 3005 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 6982 rows 2061 cols
[2024-05-22 16:38:27] [INFO ] Computed 42 invariants in 190 ms
[2024-05-22 16:38:27] [INFO ] State equation strengthened by 6514 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1929/1995 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1995 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 62/2057 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2057 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/2059 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2059 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6982/9041 variables, 2059/2101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9041 variables, 6514/8615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9041 variables, 0/8615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/9043 variables, 2/8617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9043 variables, 0/8617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/9043 variables, 0/8617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9043/9043 variables, and 8617 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5092 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2061/2061 constraints, ReadFeed: 6514/6514 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1929/1995 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:38:32] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1995 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1995 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 62/2057 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2057 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/2059 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:38:35] [INFO ] Deduced a trap composed of 68 places in 1642 ms of which 12 ms to minimize.
[2024-05-22 16:38:36] [INFO ] Deduced a trap composed of 48 places in 1591 ms of which 12 ms to minimize.
[2024-05-22 16:38:38] [INFO ] Deduced a trap composed of 46 places in 1539 ms of which 14 ms to minimize.
[2024-05-22 16:38:39] [INFO ] Deduced a trap composed of 47 places in 1447 ms of which 12 ms to minimize.
[2024-05-22 16:38:41] [INFO ] Deduced a trap composed of 46 places in 1450 ms of which 12 ms to minimize.
[2024-05-22 16:38:42] [INFO ] Deduced a trap composed of 59 places in 1459 ms of which 12 ms to minimize.
[2024-05-22 16:38:44] [INFO ] Deduced a trap composed of 57 places in 1481 ms of which 11 ms to minimize.
[2024-05-22 16:38:45] [INFO ] Deduced a trap composed of 48 places in 1497 ms of which 12 ms to minimize.
[2024-05-22 16:38:47] [INFO ] Deduced a trap composed of 67 places in 1511 ms of which 12 ms to minimize.
[2024-05-22 16:38:48] [INFO ] Deduced a trap composed of 58 places in 1501 ms of which 12 ms to minimize.
[2024-05-22 16:38:50] [INFO ] Deduced a trap composed of 50 places in 1384 ms of which 11 ms to minimize.
[2024-05-22 16:38:51] [INFO ] Deduced a trap composed of 45 places in 1359 ms of which 11 ms to minimize.
[2024-05-22 16:38:53] [INFO ] Deduced a trap composed of 59 places in 1366 ms of which 11 ms to minimize.
[2024-05-22 16:38:54] [INFO ] Deduced a trap composed of 46 places in 1239 ms of which 10 ms to minimize.
[2024-05-22 16:38:55] [INFO ] Deduced a trap composed of 46 places in 1249 ms of which 11 ms to minimize.
[2024-05-22 16:38:56] [INFO ] Deduced a trap composed of 65 places in 1260 ms of which 10 ms to minimize.
[2024-05-22 16:38:58] [INFO ] Deduced a trap composed of 52 places in 1295 ms of which 11 ms to minimize.
[2024-05-22 16:38:59] [INFO ] Deduced a trap composed of 51 places in 1217 ms of which 10 ms to minimize.
[2024-05-22 16:39:00] [INFO ] Deduced a trap composed of 57 places in 1274 ms of which 11 ms to minimize.
[2024-05-22 16:39:02] [INFO ] Deduced a trap composed of 58 places in 1242 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2059 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:39:03] [INFO ] Deduced a trap composed of 51 places in 1304 ms of which 10 ms to minimize.
[2024-05-22 16:39:04] [INFO ] Deduced a trap composed of 46 places in 1254 ms of which 11 ms to minimize.
[2024-05-22 16:39:06] [INFO ] Deduced a trap composed of 45 places in 1238 ms of which 10 ms to minimize.
[2024-05-22 16:39:07] [INFO ] Deduced a trap composed of 44 places in 1250 ms of which 13 ms to minimize.
[2024-05-22 16:39:08] [INFO ] Deduced a trap composed of 48 places in 1130 ms of which 10 ms to minimize.
[2024-05-22 16:39:09] [INFO ] Deduced a trap composed of 67 places in 1057 ms of which 9 ms to minimize.
[2024-05-22 16:39:10] [INFO ] Deduced a trap composed of 57 places in 1100 ms of which 10 ms to minimize.
[2024-05-22 16:39:11] [INFO ] Deduced a trap composed of 56 places in 1078 ms of which 10 ms to minimize.
[2024-05-22 16:39:12] [INFO ] Deduced a trap composed of 59 places in 989 ms of which 9 ms to minimize.
[2024-05-22 16:39:13] [INFO ] Deduced a trap composed of 66 places in 1017 ms of which 9 ms to minimize.
[2024-05-22 16:39:14] [INFO ] Deduced a trap composed of 47 places in 853 ms of which 8 ms to minimize.
[2024-05-22 16:39:15] [INFO ] Deduced a trap composed of 45 places in 855 ms of which 8 ms to minimize.
[2024-05-22 16:39:16] [INFO ] Deduced a trap composed of 48 places in 820 ms of which 8 ms to minimize.
[2024-05-22 16:39:17] [INFO ] Deduced a trap composed of 45 places in 879 ms of which 8 ms to minimize.
[2024-05-22 16:39:18] [INFO ] Deduced a trap composed of 53 places in 873 ms of which 8 ms to minimize.
[2024-05-22 16:39:19] [INFO ] Deduced a trap composed of 53 places in 862 ms of which 9 ms to minimize.
[2024-05-22 16:39:20] [INFO ] Deduced a trap composed of 50 places in 921 ms of which 9 ms to minimize.
[2024-05-22 16:39:21] [INFO ] Deduced a trap composed of 52 places in 906 ms of which 9 ms to minimize.
[2024-05-22 16:39:21] [INFO ] Deduced a trap composed of 57 places in 827 ms of which 8 ms to minimize.
[2024-05-22 16:39:22] [INFO ] Deduced a trap composed of 44 places in 943 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2059 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:39:23] [INFO ] Deduced a trap composed of 48 places in 1014 ms of which 9 ms to minimize.
[2024-05-22 16:39:25] [INFO ] Deduced a trap composed of 51 places in 1014 ms of which 9 ms to minimize.
[2024-05-22 16:39:26] [INFO ] Deduced a trap composed of 46 places in 1050 ms of which 9 ms to minimize.
[2024-05-22 16:39:27] [INFO ] Deduced a trap composed of 45 places in 1033 ms of which 9 ms to minimize.
[2024-05-22 16:39:28] [INFO ] Deduced a trap composed of 45 places in 908 ms of which 8 ms to minimize.
[2024-05-22 16:39:29] [INFO ] Deduced a trap composed of 49 places in 883 ms of which 8 ms to minimize.
[2024-05-22 16:39:29] [INFO ] Deduced a trap composed of 55 places in 889 ms of which 8 ms to minimize.
[2024-05-22 16:39:30] [INFO ] Deduced a trap composed of 50 places in 885 ms of which 8 ms to minimize.
[2024-05-22 16:39:31] [INFO ] Deduced a trap composed of 59 places in 864 ms of which 8 ms to minimize.
[2024-05-22 16:39:32] [INFO ] Deduced a trap composed of 52 places in 873 ms of which 9 ms to minimize.
[2024-05-22 16:39:33] [INFO ] Deduced a trap composed of 47 places in 803 ms of which 7 ms to minimize.
[2024-05-22 16:39:34] [INFO ] Deduced a trap composed of 51 places in 834 ms of which 8 ms to minimize.
[2024-05-22 16:39:35] [INFO ] Deduced a trap composed of 48 places in 790 ms of which 7 ms to minimize.
[2024-05-22 16:39:36] [INFO ] Deduced a trap composed of 53 places in 801 ms of which 8 ms to minimize.
[2024-05-22 16:39:36] [INFO ] Deduced a trap composed of 48 places in 809 ms of which 8 ms to minimize.
[2024-05-22 16:39:37] [INFO ] Deduced a trap composed of 49 places in 806 ms of which 8 ms to minimize.
[2024-05-22 16:39:38] [INFO ] Deduced a trap composed of 48 places in 787 ms of which 7 ms to minimize.
[2024-05-22 16:39:39] [INFO ] Deduced a trap composed of 48 places in 839 ms of which 8 ms to minimize.
[2024-05-22 16:39:40] [INFO ] Deduced a trap composed of 49 places in 805 ms of which 8 ms to minimize.
[2024-05-22 16:39:41] [INFO ] Deduced a trap composed of 50 places in 787 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2059 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:39:41] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2024-05-22 16:39:41] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2024-05-22 16:39:41] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 2 ms to minimize.
[2024-05-22 16:39:41] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-22 16:39:42] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2059 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2059 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 6982/9041 variables, 2059/2167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/9041 variables, 6514/8681 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 9041/9043 variables, and 8685 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75045 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2059/2061 constraints, ReadFeed: 6514/6514 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 66/66 constraints]
After SMT, in 80438ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 2061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2061/2061 places, 6982/6982 transitions.
Applied a total of 0 rules in 164 ms. Remains 2061 /2061 variables (removed 0) and now considering 6982/6982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 2061/2061 places, 6982/6982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2061/2061 places, 6982/6982 transitions.
Applied a total of 0 rules in 157 ms. Remains 2061 /2061 variables (removed 0) and now considering 6982/6982 (removed 0) transitions.
[2024-05-22 16:39:47] [INFO ] Invariant cache hit.
[2024-05-22 16:39:50] [INFO ] Implicit Places using invariants in 2132 ms returned []
[2024-05-22 16:39:50] [INFO ] Invariant cache hit.
[2024-05-22 16:39:51] [INFO ] State equation strengthened by 6514 read => feed constraints.
[2024-05-22 16:40:22] [INFO ] Performed 856/2061 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:40:47] [INFO ] Implicit Places using invariants and state equation in 57904 ms returned []
Implicit Place search using SMT with State Equation took 60044 ms to find 0 implicit places.
[2024-05-22 16:40:48] [INFO ] Redundant transitions in 682 ms returned []
Running 6942 sub problems to find dead transitions.
[2024-05-22 16:40:48] [INFO ] Invariant cache hit.
[2024-05-22 16:40:48] [INFO ] State equation strengthened by 6514 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
(s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 0.0)
(s735 1.0)
(s736 1.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 1.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 1.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 1.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 1.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 1.0)
(s951 0.0)
(s952 0.0)
(s953 1.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 1.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 1.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 1.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 1.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 0.0)
(s1053 1.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2060 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6942 unsolved
SMT process timed out in 38118ms, After SMT, problems are : Problem set: 0 solved, 6942 unsolved
Search for dead transitions found 0 dead transitions in 38190ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99120 ms. Remains : 2061/2061 places, 6982/6982 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 6290 edges and 2061 vertex of which 1793 / 2061 are part of one of the 2 SCC in 6 ms
Free SCC test removed 1791 places
Drop transitions (Empty/Sink Transition effects.) removed 4857 transitions
Ensure Unique test removed 1579 transitions
Reduce isomorphic transitions removed 6436 transitions.
Graph (complete) has 790 edges and 270 vertex of which 165 are kept as prefixes of interest. Removing 105 places using SCC suffix rule.1 ms
Discarding 105 places :
Also discarding 33 output transitions
Drop transitions (Output transitions of discarded places.) removed 33 transitions
Drop transitions (Empty/Sink Transition effects.) removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 165 transition count 375
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 142 place count 164 transition count 374
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 208 place count 98 transition count 272
Iterating global reduction 2 with 66 rules applied. Total rules applied 274 place count 98 transition count 272
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 309 place count 98 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 313 place count 96 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 314 place count 96 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 325 place count 96 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 326 place count 96 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 327 place count 95 transition count 222
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 328 place count 95 transition count 221
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 330 place count 94 transition count 220
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 331 place count 94 transition count 220
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 333 place count 92 transition count 218
Applied a total of 333 rules in 130 ms. Remains 92 /2061 variables (removed 1969) and now considering 218/6982 (removed 6764) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 218 rows 92 cols
[2024-05-22 16:41:27] [INFO ] Computed 5 invariants in 2 ms
[2024-05-22 16:41:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 16:41:27] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 16:41:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-22 16:41:27] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 16:41:27] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 16:41:27] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 590 ms.
[2024-05-22 16:41:27] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-22 16:41:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2061 places, 6982 transitions and 27689 arcs took 32 ms.
[2024-05-22 16:41:28] [INFO ] Flatten gal took : 356 ms
Total runtime 252758 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANInsertWithFailure-PT-040

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2061
TRANSITIONS: 6982
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.139s, Sys 0.008s]


SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.022s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 894
MODEL NAME: /home/mcc/execution/408/model
2061 places, 6982 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716398661181

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CANInsertWithFailure-PT-040"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CANInsertWithFailure-PT-040, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620503900126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-040.tgz
mv CANInsertWithFailure-PT-040 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;