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.r245-tall-171654350300631.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 NoC3x3-PT-5B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350300631
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 525K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716691907201

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 02:51:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 02:51:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:51:48] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2024-05-26 02:51:48] [INFO ] Transformed 1571 places.
[2024-05-26 02:51:48] [INFO ] Transformed 2173 transitions.
[2024-05-26 02:51:48] [INFO ] Found NUPN structural information;
[2024-05-26 02:51:48] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (60 resets) in 1759 ms. (22 steps per ms) remains 6/16 properties
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1220 ms. (32 steps per ms) remains 5/6 properties
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 714 ms. (55 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/5 properties
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2173 rows 1571 cols
[2024-05-26 02:51:50] [INFO ] Computed 66 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1430/1540 variables, 64/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1540 variables, 1430/1604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1540 variables, 0/1604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 31/1571 variables, 2/1606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1571 variables, 31/1637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1571 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2173/3744 variables, 1571/3208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3744 variables, 0/3208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3744 variables, 0/3208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3744/3744 variables, and 3208 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1894 ms.
Refiners :[Domain max(s): 1571/1571 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1571/1571 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/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1430/1540 variables, 64/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1540 variables, 1430/1604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 02:51:52] [INFO ] Deduced a trap composed of 117 places in 237 ms of which 41 ms to minimize.
[2024-05-26 02:51:53] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 4 ms to minimize.
Problem NoC3x3-PT-5B-ReachabilityFireability-2023-13 is UNSAT
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2023-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/1540 variables, 2/1606 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1540 variables, 0/1606 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 31/1571 variables, 2/1608 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1571 variables, 31/1639 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1571 variables, 0/1639 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2173/3744 variables, 1571/3210 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3744 variables, 3/3213 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3744 variables, 0/3213 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3744/3744 variables, and 3213 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5017 ms.
Refiners :[Domain max(s): 1571/1571 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1571/1571 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 7088ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 1571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1571 transition count 1893
Reduce places removed 280 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 306 rules applied. Total rules applied 586 place count 1291 transition count 1867
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 612 place count 1265 transition count 1867
Discarding 266 places :
Symmetric choice reduction at 3 with 266 rule applications. Total rules 878 place count 999 transition count 1601
Iterating global reduction 3 with 266 rules applied. Total rules applied 1144 place count 999 transition count 1601
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 1144 place count 999 transition count 1576
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1194 place count 974 transition count 1576
Discarding 94 places :
Symmetric choice reduction at 3 with 94 rule applications. Total rules 1288 place count 880 transition count 1425
Iterating global reduction 3 with 94 rules applied. Total rules applied 1382 place count 880 transition count 1425
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1422 place count 840 transition count 1344
Iterating global reduction 3 with 40 rules applied. Total rules applied 1462 place count 840 transition count 1344
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1471 place count 831 transition count 1326
Iterating global reduction 3 with 9 rules applied. Total rules applied 1480 place count 831 transition count 1326
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1481 place count 830 transition count 1324
Iterating global reduction 3 with 1 rules applied. Total rules applied 1482 place count 830 transition count 1324
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 2 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 1760 place count 691 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1761 place count 690 transition count 1182
Iterating global reduction 3 with 1 rules applied. Total rules applied 1762 place count 690 transition count 1182
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 1964 place count 589 transition count 1204
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1974 place count 589 transition count 1194
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 2016 place count 568 transition count 1195
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 4 with 43 rules applied. Total rules applied 2059 place count 568 transition count 1152
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2065 place count 562 transition count 1152
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 2065 place count 562 transition count 1148
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 2073 place count 558 transition count 1148
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 2081 place count 554 transition count 1144
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 2095 place count 547 transition count 1158
Free-agglomeration rule applied 26 times with reduction of 1 identical transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 2121 place count 547 transition count 1131
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 38 rules applied. Total rules applied 2159 place count 521 transition count 1119
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 2165 place count 521 transition count 1113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2166 place count 520 transition count 1113
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 2194 place count 520 transition count 1113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2195 place count 519 transition count 1112
Applied a total of 2195 rules in 583 ms. Remains 519 /1571 variables (removed 1052) and now considering 1112/2173 (removed 1061) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 596 ms. Remains : 519/1571 places, 1112/2173 transitions.
RANDOM walk for 40000 steps (145 resets) in 604 ms. (66 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 168 ms. (236 steps per ms) remains 2/3 properties
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
[2024-05-26 02:51:58] [INFO ] Flow matrix only has 1108 transitions (discarded 4 similar events)
// Phase 1: matrix 1108 rows 519 cols
[2024-05-26 02:51:58] [INFO ] Computed 59 invariants in 6 ms
[2024-05-26 02:51:58] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 428/505 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/513 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1106/1619 variables, 513/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1619 variables, 39/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1619 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/1626 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1626 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1627 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1627 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1627 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1627 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1627/1627 variables, and 617 constraints, problems are : Problem set: 0 solved, 2 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 519/519 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 428/505 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 02:51:58] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/513 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1106/1619 variables, 513/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1619 variables, 39/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1619 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1619 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/1626 variables, 5/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1626 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1626 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/1627 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1627 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1627 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1627 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1627/1627 variables, and 620 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2082 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 519/519 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2724ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 213 ms.
Support contains 5 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 1112/1112 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 519 transition count 1098
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 505 transition count 1098
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 28 place count 505 transition count 1086
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 52 place count 493 transition count 1086
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 70 place count 475 transition count 1035
Iterating global reduction 2 with 18 rules applied. Total rules applied 88 place count 475 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 475 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 474 transition count 1033
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 474 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 473 transition count 1031
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 473 transition count 1031
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 175 place count 432 transition count 990
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 184 place count 423 transition count 963
Iterating global reduction 3 with 9 rules applied. Total rules applied 193 place count 423 transition count 963
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 195 place count 423 transition count 961
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 196 place count 422 transition count 957
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 422 transition count 957
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 241 place count 400 transition count 962
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 248 place count 393 transition count 933
Iterating global reduction 4 with 7 rules applied. Total rules applied 255 place count 393 transition count 933
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 257 place count 393 transition count 931
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 259 place count 391 transition count 921
Iterating global reduction 5 with 2 rules applied. Total rules applied 261 place count 391 transition count 921
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 263 place count 391 transition count 919
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 280 place count 391 transition count 902
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 282 place count 389 transition count 886
Iterating global reduction 6 with 2 rules applied. Total rules applied 284 place count 389 transition count 886
Free-agglomeration rule applied 17 times.
Iterating global reduction 6 with 17 rules applied. Total rules applied 301 place count 389 transition count 869
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 333 place count 372 transition count 854
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 339 place count 372 transition count 848
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 340 place count 372 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 341 place count 371 transition count 847
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 342 place count 371 transition count 848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 343 place count 370 transition count 848
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 348 place count 370 transition count 848
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 349 place count 370 transition count 847
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 350 place count 369 transition count 846
Applied a total of 350 rules in 181 ms. Remains 369 /519 variables (removed 150) and now considering 846/1112 (removed 266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 369/519 places, 846/1112 transitions.
RANDOM walk for 40000 steps (181 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 455697 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 1
Probabilistic random walk after 455697 steps, saw 122491 distinct states, run finished after 3004 ms. (steps per millisecond=151 ) properties seen :0
// Phase 1: matrix 846 rows 369 cols
[2024-05-26 02:52:04] [INFO ] Computed 59 invariants in 11 ms
[2024-05-26 02:52:04] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/255 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 674/929 variables, 255/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/929 variables, 32/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/929 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/1099 variables, 43/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1099 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1099 variables, 6/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1099 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/1121 variables, 8/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1121 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1121 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 86/1207 variables, 43/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1207 variables, 4/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1207 variables, 5/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1207 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1215 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1215 variables, 8/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1215 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1215 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1215/1215 variables, and 471 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 369/369 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/255 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 02:52:04] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 674/929 variables, 255/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/929 variables, 32/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/929 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 170/1099 variables, 43/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1099 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1099 variables, 6/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1099 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1099 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/1121 variables, 8/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1121 variables, 20/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1121 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 86/1207 variables, 43/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1207 variables, 4/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1207 variables, 5/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1207 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/1215 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1215 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1215 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1215 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1215/1215 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 369/369 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 875ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 5 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 846/846 transitions.
Applied a total of 0 rules in 16 ms. Remains 369 /369 variables (removed 0) and now considering 846/846 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 369/369 places, 846/846 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 846/846 transitions.
Applied a total of 0 rules in 9 ms. Remains 369 /369 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2024-05-26 02:52:05] [INFO ] Invariant cache hit.
[2024-05-26 02:52:05] [INFO ] Implicit Places using invariants in 206 ms returned [169]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 368/369 places, 846/846 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 368 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 368 transition count 845
Applied a total of 2 rules in 22 ms. Remains 368 /368 variables (removed 0) and now considering 845/846 (removed 1) transitions.
// Phase 1: matrix 845 rows 368 cols
[2024-05-26 02:52:05] [INFO ] Computed 58 invariants in 3 ms
[2024-05-26 02:52:05] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-26 02:52:05] [INFO ] Invariant cache hit.
[2024-05-26 02:52:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-26 02:52:06] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 368/369 places, 845/846 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 898 ms. Remains : 368/369 places, 845/846 transitions.
RANDOM walk for 40000 steps (181 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (10 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 519995 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 519995 steps, saw 119374 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-26 02:52:09] [INFO ] Invariant cache hit.
[2024-05-26 02:52:09] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 216/254 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 673/927 variables, 254/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 31/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/1097 variables, 43/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1097 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1097 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/1119 variables, 8/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1119 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1119 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 86/1205 variables, 43/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1205 variables, 4/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1205 variables, 5/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1205 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1213 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1213 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1213 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1213 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1213/1213 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 368/368 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 216/254 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 673/927 variables, 254/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 31/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/1097 variables, 43/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1097 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1097 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1097 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/1119 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1119 variables, 20/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1119 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 86/1205 variables, 43/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1205 variables, 4/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1205 variables, 5/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1205 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1213 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1213 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1213 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1213 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1213/1213 variables, and 469 constraints, problems are : Problem set: 0 solved, 1 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 368/368 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 753ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 5 out of 368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 845/845 transitions.
Applied a total of 0 rules in 9 ms. Remains 368 /368 variables (removed 0) and now considering 845/845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 368/368 places, 845/845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 845/845 transitions.
Applied a total of 0 rules in 10 ms. Remains 368 /368 variables (removed 0) and now considering 845/845 (removed 0) transitions.
[2024-05-26 02:52:10] [INFO ] Invariant cache hit.
[2024-05-26 02:52:10] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-26 02:52:10] [INFO ] Invariant cache hit.
[2024-05-26 02:52:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-26 02:52:10] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-26 02:52:10] [INFO ] Redundant transitions in 45 ms returned []
Running 830 sub problems to find dead transitions.
[2024-05-26 02:52:10] [INFO ] Invariant cache hit.
[2024-05-26 02:52:10] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-05-26 02:52:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-05-26 02:52:26] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 4 (OVERLAPS) 1/368 variables, 37/60 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-05-26 02:52:37] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-26 02:52:37] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-26 02:52:37] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 2 ms to minimize.
[2024-05-26 02:52:37] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-26 02:52:38] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-05-26 02:52:38] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-26 02:52:38] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-26 02:52:38] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-26 02:52:39] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-26 02:52:40] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-26 02:52:40] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-26 02:52:40] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2024-05-26 02:52:40] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-26 02:52:41] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/1213 variables, and 74 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/368 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (OVERLAPS) 1/368 variables, 37/69 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-05-26 02:52:51] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-05-26 02:52:51] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-05-26 02:52:52] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-26 02:52:52] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-26 02:52:53] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-26 02:52:53] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 7 (OVERLAPS) 845/1213 variables, 368/448 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1213 variables, 42/490 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1213 variables, 830/1320 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1213/1213 variables, and 1320 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 368/368 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 22/22 constraints]
After SMT, in 60446ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60456ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61171 ms. Remains : 368/368 places, 845/845 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 368 transition count 830
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 367 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 367 transition count 827
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 23 place count 367 transition count 827
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 367 transition count 826
Applied a total of 24 rules in 28 ms. Remains 367 /368 variables (removed 1) and now considering 826/845 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 826 rows 367 cols
[2024-05-26 02:53:11] [INFO ] Computed 58 invariants in 9 ms
[2024-05-26 02:53:11] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:53:11] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2024-05-26 02:53:11] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 02:53:11] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:53:11] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 444 ms.
[2024-05-26 02:53:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-26 02:53:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 368 places, 845 transitions and 3342 arcs took 11 ms.
[2024-05-26 02:53:12] [INFO ] Flatten gal took : 112 ms
Total runtime 83711 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NoC3x3-PT-5B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 368
TRANSITIONS: 845
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.004s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 683
MODEL NAME: /home/mcc/execution/411/model
368 places, 845 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 1716692807150

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

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
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="NoC3x3-PT-5B"
export BK_EXAMINATION="ReachabilityFireability"
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 NoC3x3-PT-5B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654350300631"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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