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.r003-smll-171620117000126.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 ASLink-PT-08a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117000126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 757K 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 ASLink-PT-08a-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2023-01
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2023-10
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2023-12
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716351193158

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 04:13:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 04:13:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:13:16] [INFO ] Load time of PNML (sax parser for PT used): 488 ms
[2024-05-22 04:13:16] [INFO ] Transformed 1796 places.
[2024-05-22 04:13:16] [INFO ] Transformed 2646 transitions.
[2024-05-22 04:13:16] [INFO ] Found NUPN structural information;
[2024-05-22 04:13:16] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 716 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA ASLink-PT-08a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (194 resets) in 3103 ms. (12 steps per ms) remains 6/15 properties
FORMULA ASLink-PT-08a-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (17 resets) in 326 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 563 ms. (70 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 308 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 769 ms. (51 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 548 ms. (72 steps per ms) remains 6/6 properties
// Phase 1: matrix 2618 rows 1796 cols
[2024-05-22 04:13:18] [INFO ] Computed 346 invariants in 381 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 117/217 variables, 22/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 117/239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 227/444 variables, 63/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 227/530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem ASLink-PT-08a-ReachabilityCardinality-2024-15 is UNSAT
FORMULA ASLink-PT-08a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 1316/1760 variables, 249/779 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1760 variables, 1316/2095 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1760 variables, 0/2095 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 36/1796 variables, 11/2106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1796 variables, 36/2142 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1796 variables, 0/2142 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2618/4414 variables, 1796/3938 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4414 variables, 0/3938 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/4414 variables, 0/3938 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4414/4414 variables, and 3938 constraints, problems are : Problem set: 1 solved, 5 unsolved in 4892 ms.
Refiners :[Domain max(s): 1796/1796 constraints, Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 261/261 constraints, State Equation: 1796/1796 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 101/188 variables, 19/106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 101/207 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 1/208 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 247/435 variables, 66/274 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 247/521 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem ASLink-PT-08a-ReachabilityCardinality-2024-08 is UNSAT
FORMULA ASLink-PT-08a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 1324/1759 variables, 248/769 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1759 variables, 1324/2093 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 04:13:26] [INFO ] Deduced a trap composed of 28 places in 1009 ms of which 188 ms to minimize.
[2024-05-22 04:13:27] [INFO ] Deduced a trap composed of 38 places in 852 ms of which 11 ms to minimize.
[2024-05-22 04:13:27] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1759 variables, 3/2096 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1759 variables, 0/2096 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 37/1796 variables, 12/2108 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1796 variables, 37/2145 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1796/4414 variables, and 2145 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5059 ms.
Refiners :[Domain max(s): 1796/1796 constraints, Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 261/261 constraints, State Equation: 0/1796 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 10588ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 1796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 32 places
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1748 transition count 2467
Reduce places removed 151 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 156 rules applied. Total rules applied 355 place count 1597 transition count 2462
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 360 place count 1592 transition count 2462
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 360 place count 1592 transition count 2303
Deduced a syphon composed of 159 places in 14 ms
Ensure Unique test removed 55 places
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 3 with 373 rules applied. Total rules applied 733 place count 1378 transition count 2303
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 734 place count 1378 transition count 2302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 735 place count 1377 transition count 2302
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 746 place count 1366 transition count 2243
Ensure Unique test removed 1 places
Iterating global reduction 5 with 12 rules applied. Total rules applied 758 place count 1365 transition count 2243
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 761 place count 1365 transition count 2240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 762 place count 1364 transition count 2240
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 762 place count 1364 transition count 2238
Deduced a syphon composed of 2 places in 26 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 767 place count 1361 transition count 2238
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 768 place count 1360 transition count 2230
Iterating global reduction 7 with 1 rules applied. Total rules applied 769 place count 1360 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 770 place count 1359 transition count 2222
Iterating global reduction 7 with 1 rules applied. Total rules applied 771 place count 1359 transition count 2222
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 772 place count 1358 transition count 2214
Iterating global reduction 7 with 1 rules applied. Total rules applied 773 place count 1358 transition count 2214
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 774 place count 1357 transition count 2206
Iterating global reduction 7 with 1 rules applied. Total rules applied 775 place count 1357 transition count 2206
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 776 place count 1356 transition count 2198
Iterating global reduction 7 with 1 rules applied. Total rules applied 777 place count 1356 transition count 2198
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 778 place count 1355 transition count 2190
Iterating global reduction 7 with 1 rules applied. Total rules applied 779 place count 1355 transition count 2190
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 780 place count 1354 transition count 2182
Iterating global reduction 7 with 1 rules applied. Total rules applied 781 place count 1354 transition count 2182
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 782 place count 1353 transition count 2174
Iterating global reduction 7 with 1 rules applied. Total rules applied 783 place count 1353 transition count 2174
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 784 place count 1352 transition count 2166
Iterating global reduction 7 with 1 rules applied. Total rules applied 785 place count 1352 transition count 2166
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 786 place count 1351 transition count 2158
Iterating global reduction 7 with 1 rules applied. Total rules applied 787 place count 1351 transition count 2158
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 788 place count 1350 transition count 2150
Iterating global reduction 7 with 1 rules applied. Total rules applied 789 place count 1350 transition count 2150
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 790 place count 1349 transition count 2142
Iterating global reduction 7 with 1 rules applied. Total rules applied 791 place count 1349 transition count 2142
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 792 place count 1348 transition count 2134
Iterating global reduction 7 with 1 rules applied. Total rules applied 793 place count 1348 transition count 2134
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 5 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 891 place count 1299 transition count 2085
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 892 place count 1299 transition count 2084
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 893 place count 1298 transition count 2084
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 899 place count 1298 transition count 2078
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 905 place count 1292 transition count 2078
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 915 place count 1292 transition count 2078
Applied a total of 915 rules in 2401 ms. Remains 1292 /1796 variables (removed 504) and now considering 2078/2618 (removed 540) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2419 ms. Remains : 1292/1796 places, 2078/2618 transitions.
RANDOM walk for 40000 steps (302 resets) in 832 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (38 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (40 resets) in 304 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (39 resets) in 204 ms. (195 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (38 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 74539 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 4
Probabilistic random walk after 74539 steps, saw 39036 distinct states, run finished after 3009 ms. (steps per millisecond=24 ) properties seen :0
// Phase 1: matrix 2078 rows 1292 cols
[2024-05-22 04:13:35] [INFO ] Computed 241 invariants in 131 ms
[2024-05-22 04:13:35] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 93/139 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 213/352 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 906/1258 variables, 168/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1258 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 34/1292 variables, 10/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1292 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2078/3370 variables, 1292/1533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3370 variables, 50/1583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3370 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/3370 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3370/3370 variables, and 1583 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4277 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 178/178 constraints, State Equation: 1292/1292 constraints, ReadFeed: 50/50 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/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 93/139 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 213/352 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 906/1258 variables, 168/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 04:13:40] [INFO ] Deduced a trap composed of 34 places in 725 ms of which 10 ms to minimize.
[2024-05-22 04:13:41] [INFO ] Deduced a trap composed of 24 places in 690 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1258 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1258 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 34/1292 variables, 10/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1292 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2078/3370 variables, 1292/1535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3370 variables, 50/1585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3370 variables, 4/1589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3370/3370 variables, and 1589 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 178/178 constraints, State Equation: 1292/1292 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 49535ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7609 ms.
Support contains 46 out of 1292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1292/1292 places, 2078/2078 transitions.
Applied a total of 0 rules in 80 ms. Remains 1292 /1292 variables (removed 0) and now considering 2078/2078 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1292/1292 places, 2078/2078 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1292/1292 places, 2078/2078 transitions.
Applied a total of 0 rules in 86 ms. Remains 1292 /1292 variables (removed 0) and now considering 2078/2078 (removed 0) transitions.
[2024-05-22 04:14:32] [INFO ] Invariant cache hit.
[2024-05-22 04:14:34] [INFO ] Implicit Places using invariants in 2185 ms returned [1, 19, 20, 22, 32, 50, 68, 123, 153, 166, 167, 168, 169, 170, 188, 206, 277, 289, 302, 303, 304, 305, 306, 324, 342, 380, 396, 411, 421, 433, 446, 449, 450, 451, 469, 487, 547, 570, 583, 584, 585, 586, 587, 605, 623, 703, 716, 717, 718, 719, 720, 738, 756, 809, 840, 855, 856, 857, 858, 859, 877, 895, 956, 978, 991, 992, 993, 994, 995, 1013, 1031, 1081, 1114, 1119, 1130, 1131, 1132, 1133, 1134, 1155, 1157, 1160, 1178, 1179, 1180, 1181, 1193, 1199, 1205, 1211, 1217, 1223, 1229, 1235, 1241, 1247, 1253, 1291]
[2024-05-22 04:14:34] [INFO ] Actually due to overlaps returned [1155, 1134, 32, 50, 170, 188, 306, 324, 451, 469, 587, 605, 720, 738, 859, 877, 995, 1013, 1160, 169, 305, 450, 586, 719, 858, 994, 1133, 1179, 1291, 168, 304, 449, 585, 718, 857, 993, 1132, 1157, 1178, 1, 167, 289, 303, 433, 570, 584, 703, 717, 840, 856, 978, 992, 1114, 1131, 19, 20, 68, 166, 206, 302, 342, 446, 487, 583, 623, 716, 756, 855, 895, 991, 1031, 1130, 1181, 1223, 1241, 1253, 22, 153, 1119, 1180, 1193, 1199, 1205, 1211, 1217, 1229, 1235, 1247]
Discarding 88 places :
Implicit Place search using SMT only with invariants took 2203 ms to find 88 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1204/1292 places, 2078/2078 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1195 transition count 1951
Reduce places removed 127 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 140 rules applied. Total rules applied 276 place count 1068 transition count 1938
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 289 place count 1055 transition count 1938
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 289 place count 1055 transition count 1883
Deduced a syphon composed of 55 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 111 rules applied. Total rules applied 400 place count 999 transition count 1883
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 37 rules applied. Total rules applied 437 place count 979 transition count 1866
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 454 place count 962 transition count 1866
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 454 place count 962 transition count 1865
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 456 place count 961 transition count 1865
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 470 place count 947 transition count 1851
Iterating global reduction 5 with 14 rules applied. Total rules applied 484 place count 947 transition count 1851
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 484 place count 947 transition count 1850
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 486 place count 946 transition count 1850
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 492 place count 940 transition count 1844
Iterating global reduction 5 with 6 rules applied. Total rules applied 498 place count 940 transition count 1844
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 501 place count 940 transition count 1841
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 502 place count 939 transition count 1840
Iterating global reduction 6 with 1 rules applied. Total rules applied 503 place count 939 transition count 1840
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 504 place count 938 transition count 1839
Iterating global reduction 6 with 1 rules applied. Total rules applied 505 place count 938 transition count 1839
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 3 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 643 place count 869 transition count 1770
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 650 place count 862 transition count 1763
Iterating global reduction 6 with 7 rules applied. Total rules applied 657 place count 862 transition count 1763
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 663 place count 862 transition count 1757
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 664 place count 862 transition count 1756
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 672 place count 862 transition count 1748
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 685 place count 854 transition count 1743
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 687 place count 854 transition count 1741
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 8 with 22 rules applied. Total rules applied 709 place count 854 transition count 1719
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 731 place count 832 transition count 1719
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 9 with 21 rules applied. Total rules applied 752 place count 832 transition count 1719
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 753 place count 832 transition count 1719
Applied a total of 753 rules in 1057 ms. Remains 832 /1204 variables (removed 372) and now considering 1719/2078 (removed 359) transitions.
// Phase 1: matrix 1719 rows 832 cols
[2024-05-22 04:14:35] [INFO ] Computed 123 invariants in 21 ms
[2024-05-22 04:14:36] [INFO ] Implicit Places using invariants in 1439 ms returned [73, 101, 104, 106, 109, 110, 162, 180, 186, 188, 196, 201, 202, 288, 291, 298, 305, 307, 362, 379, 393, 400, 401, 453, 471, 477, 480, 482, 483, 488, 489, 541, 569, 572, 574, 575, 580, 581, 634, 665, 667, 668, 673, 675, 728, 753, 756, 758, 759, 828, 830]
[2024-05-22 04:14:36] [INFO ] Actually due to overlaps returned [196, 483, 575, 759, 668, 201, 305, 307, 202, 101, 106, 180, 186, 379, 471, 482, 569, 574, 667, 753, 758, 73, 162, 188, 288, 291, 298, 362, 393, 453, 477, 541, 634, 728, 828]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 1444 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 797/1292 places, 1719/2078 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 797 transition count 1718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 796 transition count 1718
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 15 place count 783 transition count 1705
Iterating global reduction 2 with 13 rules applied. Total rules applied 28 place count 783 transition count 1705
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 782 transition count 1704
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 782 transition count 1704
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 58 place count 768 transition count 1690
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 768 transition count 1689
Free-agglomeration rule applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 73 place count 768 transition count 1675
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 87 place count 754 transition count 1675
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 92 place count 754 transition count 1670
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 97 place count 749 transition count 1670
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 749 transition count 1670
Applied a total of 98 rules in 569 ms. Remains 749 /797 variables (removed 48) and now considering 1670/1719 (removed 49) transitions.
// Phase 1: matrix 1670 rows 749 cols
[2024-05-22 04:14:37] [INFO ] Computed 88 invariants in 34 ms
[2024-05-22 04:14:38] [INFO ] Implicit Places using invariants in 853 ms returned [99, 100, 360, 361, 435, 436, 516, 517, 602, 604]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 857 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 739/1292 places, 1670/2078 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 738 transition count 1669
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 738 transition count 1669
Applied a total of 2 rules in 60 ms. Remains 738 /739 variables (removed 1) and now considering 1669/1670 (removed 1) transitions.
// Phase 1: matrix 1669 rows 738 cols
[2024-05-22 04:14:38] [INFO ] Computed 78 invariants in 21 ms
[2024-05-22 04:14:39] [INFO ] Implicit Places using invariants in 900 ms returned []
[2024-05-22 04:14:39] [INFO ] Invariant cache hit.
[2024-05-22 04:14:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 04:14:43] [INFO ] Implicit Places using invariants and state equation in 4032 ms returned []
Implicit Place search using SMT with State Equation took 4941 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 738/1292 places, 1669/2078 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 11221 ms. Remains : 738/1292 places, 1669/2078 transitions.
RANDOM walk for 40000 steps (498 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (72 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (76 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (68 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (70 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 153698 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 4
Probabilistic random walk after 153698 steps, saw 63486 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-22 04:14:46] [INFO ] Invariant cache hit.
[2024-05-22 04:14:46] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 148/194 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/228 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 503/731 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/738 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/738 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1669/2407 variables, 738/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2407 variables, 9/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2407 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2407 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2407/2407 variables, and 825 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2036 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 738/738 constraints, ReadFeed: 9/9 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/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 148/194 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 04:14:48] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
[2024-05-22 04:14:48] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 34/228 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 503/731 variables, 56/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 04:14:50] [INFO ] Deduced a trap composed of 31 places in 858 ms of which 9 ms to minimize.
[2024-05-22 04:14:50] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 3 ms to minimize.
[2024-05-22 04:14:50] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/738 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/738 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1669/2407 variables, 738/821 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2407 variables, 9/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2407 variables, 4/834 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2407 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 04:15:42] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/2407 variables, 1/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2407/2407 variables, and 835 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 738/738 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 77076ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 738 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 738/738 places, 1669/1669 transitions.
Applied a total of 0 rules in 28 ms. Remains 738 /738 variables (removed 0) and now considering 1669/1669 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 738/738 places, 1669/1669 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 738/738 places, 1669/1669 transitions.
Applied a total of 0 rules in 27 ms. Remains 738 /738 variables (removed 0) and now considering 1669/1669 (removed 0) transitions.
[2024-05-22 04:16:03] [INFO ] Invariant cache hit.
[2024-05-22 04:16:04] [INFO ] Implicit Places using invariants in 993 ms returned []
[2024-05-22 04:16:04] [INFO ] Invariant cache hit.
[2024-05-22 04:16:05] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 04:16:08] [INFO ] Implicit Places using invariants and state equation in 3381 ms returned []
Implicit Place search using SMT with State Equation took 4381 ms to find 0 implicit places.
[2024-05-22 04:16:08] [INFO ] Redundant transitions in 226 ms returned []
Running 1668 sub problems to find dead transitions.
[2024-05-22 04:16:08] [INFO ] Invariant cache hit.
[2024-05-22 04:16:08] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/737 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1668 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 737/2407 variables, and 44 constraints, problems are : Problem set: 0 solved, 1668 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 44/60 constraints, State Equation: 0/738 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 1668/1668 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1668 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/737 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1668 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 737/2407 variables, and 44 constraints, problems are : Problem set: 0 solved, 1668 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 44/60 constraints, State Equation: 0/738 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1668 constraints, Known Traps: 0/0 constraints]
After SMT, in 61897ms problems are : Problem set: 0 solved, 1668 unsolved
Search for dead transitions found 0 dead transitions in 61933ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66601 ms. Remains : 738/738 places, 1669/1669 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 738 transition count 1667
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 736 transition count 1667
Applied a total of 4 rules in 52 ms. Remains 736 /738 variables (removed 2) and now considering 1667/1669 (removed 2) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1667 rows 736 cols
[2024-05-22 04:17:10] [INFO ] Computed 78 invariants in 37 ms
[2024-05-22 04:17:10] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 04:17:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-22 04:17:10] [INFO ] [Nat]Absence check using 18 positive and 60 generalized place invariants in 35 ms returned sat
[2024-05-22 04:17:31] [INFO ] After 20522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 04:17:41] [INFO ] After 30181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 04:18:17] [INFO ] After 66405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 66791 ms.
[2024-05-22 04:18:17] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2024-05-22 04:18:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 738 places, 1669 transitions and 6730 arcs took 23 ms.
[2024-05-22 04:18:17] [INFO ] Flatten gal took : 414 ms
Total runtime 302376 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ASLink-PT-08a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 738
TRANSITIONS: 1669
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.049s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.008s, 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: 651
MODEL NAME: /home/mcc/execution/414/model
738 places, 1669 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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="ASLink-PT-08a"
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 ASLink-PT-08a, 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 r003-smll-171620117000126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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