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.r333-tall-171679078800593.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 SemanticWebServices-PT-S256P15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078800593
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 32M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 02:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 02:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 02:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 02:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32M 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 SemanticWebServices-PT-S256P15-CTLCardinality-2024-00
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-01
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-02
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-03
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-04
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-05
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-06
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-07
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-08
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-09
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-10
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-11
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2023-12
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2023-13
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2023-14
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716875471310

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S256P15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:51:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 05:51:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:51:13] [INFO ] Load time of PNML (sax parser for PT used): 1158 ms
[2024-05-28 05:51:13] [INFO ] Transformed 329 places.
[2024-05-28 05:51:13] [INFO ] Transformed 29492 transitions.
[2024-05-28 05:51:13] [INFO ] Parsed PT model containing 329 places and 29492 transitions and 267319 arcs in 1439 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 5 places in 38 ms
Reduce places removed 5 places and 2050 transitions.
Ensure Unique test removed 6828 transitions
Reduce redundant transitions removed 6828 transitions.
Support contains 89 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 20614/20614 transitions.
Ensure Unique test removed 32 places
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 320 transitions.
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 282 transition count 20294
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 378 place count 266 transition count 15653
Iterating global reduction 1 with 16 rules applied. Total rules applied 394 place count 266 transition count 15653
Ensure Unique test removed 861 transitions
Reduce isomorphic transitions removed 861 transitions.
Iterating post reduction 1 with 861 rules applied. Total rules applied 1255 place count 266 transition count 14792
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1256 place count 265 transition count 14791
Iterating global reduction 2 with 1 rules applied. Total rules applied 1257 place count 265 transition count 14791
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1258 place count 264 transition count 14790
Iterating global reduction 2 with 1 rules applied. Total rules applied 1259 place count 264 transition count 14790
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1260 place count 263 transition count 14789
Iterating global reduction 2 with 1 rules applied. Total rules applied 1261 place count 263 transition count 14789
Drop transitions (Redundant composition of simpler transitions.) removed 2861 transitions
Redundant transition composition rules discarded 2861 transitions
Iterating global reduction 2 with 2861 rules applied. Total rules applied 4122 place count 263 transition count 11928
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 344 transitions
Reduce isomorphic transitions removed 344 transitions.
Iterating post reduction 2 with 350 rules applied. Total rules applied 4472 place count 257 transition count 11584
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 4481 place count 248 transition count 9928
Iterating global reduction 3 with 9 rules applied. Total rules applied 4490 place count 248 transition count 9928
Ensure Unique test removed 931 transitions
Reduce isomorphic transitions removed 931 transitions.
Iterating post reduction 3 with 931 rules applied. Total rules applied 5421 place count 248 transition count 8997
Drop transitions (Redundant composition of simpler transitions.) removed 399 transitions
Redundant transition composition rules discarded 399 transitions
Iterating global reduction 4 with 399 rules applied. Total rules applied 5820 place count 248 transition count 8598
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Iterating post reduction 4 with 141 rules applied. Total rules applied 5961 place count 246 transition count 8459
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 5 with 52 rules applied. Total rules applied 6013 place count 246 transition count 8407
Applied a total of 6013 rules in 591 ms. Remains 246 /324 variables (removed 78) and now considering 8407/20614 (removed 12207) transitions.
Running 7770 sub problems to find dead transitions.
[2024-05-28 05:51:15] [INFO ] Flow matrix only has 1382 transitions (discarded 7025 similar events)
Normalized transition count is 1380 out of 1382 initially.
// Phase 1: matrix 1380 rows 246 cols
[2024-05-28 05:51:15] [INFO ] Computed 3 invariants in 24 ms
[2024-05-28 05:51:15] [INFO ] State equation strengthened by 740 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/1628 variables, and 2 constraints, problems are : Problem set: 0 solved, 7770 unsolved in 20203 ms.
Refiners :[Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/246 constraints, ReadFeed: 0/740 constraints, PredecessorRefiner: 7770/7770 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7770 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7770 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/1628 variables, and 2 constraints, problems are : Problem set: 0 solved, 7770 unsolved in 20115 ms.
Refiners :[Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/246 constraints, ReadFeed: 0/740 constraints, PredecessorRefiner: 0/7770 constraints, Known Traps: 0/0 constraints]
After SMT, in 70547ms problems are : Problem set: 0 solved, 7770 unsolved
Search for dead transitions found 0 dead transitions in 70681ms
[2024-05-28 05:52:25] [INFO ] Flow matrix only has 1382 transitions (discarded 7025 similar events)
[2024-05-28 05:52:25] [INFO ] Invariant cache hit.
[2024-05-28 05:52:26] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-28 05:52:26] [INFO ] Flow matrix only has 1382 transitions (discarded 7025 similar events)
[2024-05-28 05:52:26] [INFO ] Invariant cache hit.
[2024-05-28 05:52:26] [INFO ] State equation strengthened by 740 read => feed constraints.
[2024-05-28 05:52:27] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 2122 ms to find 0 implicit places.
Running 7770 sub problems to find dead transitions.
[2024-05-28 05:52:27] [INFO ] Flow matrix only has 1382 transitions (discarded 7025 similar events)
[2024-05-28 05:52:27] [INFO ] Invariant cache hit.
[2024-05-28 05:52:28] [INFO ] State equation strengthened by 740 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/1628 variables, and 2 constraints, problems are : Problem set: 0 solved, 7770 unsolved in 30120 ms.
Refiners :[Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/246 constraints, ReadFeed: 0/740 constraints, PredecessorRefiner: 7770/7770 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7770 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/1628 variables, and 2 constraints, problems are : Problem set: 0 solved, 7770 unsolved in 30091 ms.
Refiners :[Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/246 constraints, ReadFeed: 0/740 constraints, PredecessorRefiner: 0/7770 constraints, Known Traps: 0/0 constraints]
After SMT, in 92014ms problems are : Problem set: 0 solved, 7770 unsolved
Search for dead transitions found 0 dead transitions in 92105ms
Starting structural reductions in LTL mode, iteration 1 : 246/324 places, 8407/20614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165620 ms. Remains : 246/324 places, 8407/20614 transitions.
Support contains 89 out of 246 places after structural reductions.
[2024-05-28 05:54:00] [INFO ] Flatten gal took : 427 ms
[2024-05-28 05:54:00] [INFO ] Flatten gal took : 259 ms
[2024-05-28 05:54:01] [INFO ] Input system was already deterministic with 8407 transitions.
Support contains 87 out of 246 places (down from 89) after GAL structural reductions.
RANDOM walk for 40003 steps (8 resets) in 4266 ms. (9 steps per ms) remains 9/59 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
[2024-05-28 05:54:02] [INFO ] Flow matrix only has 1382 transitions (discarded 7025 similar events)
[2024-05-28 05:54:02] [INFO ] Invariant cache hit.
[2024-05-28 05:54:03] [INFO ] State equation strengthened by 740 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 134/151 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 768/919 variables, 71/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/919 variables, 25/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/919 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 5/924 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/924 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 570/1494 variables, 92/207 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1494 variables, 547/754 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1494 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 13/1507 variables, 7/761 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1507 variables, 74/835 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1507 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 30/1537 variables, 54/889 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1537 variables, 2/891 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1537 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 32/1569 variables, 30/921 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1569 variables, 1/922 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1569 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 19/1588 variables, 20/942 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1588 variables, 1/943 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1588 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 19/1607 variables, 19/962 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1607 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 10/1617 variables, 14/976 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1617 variables, 3/979 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1617 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 10/1627 variables, 10/989 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1627 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 0/1627 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1627/1628 variables, and 989 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3242 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 246/246 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 134/151 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 768/919 variables, 71/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/919 variables, 25/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/919 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 5/924 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/924 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 570/1494 variables, 92/207 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1494 variables, 547/754 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1494 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1494 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 13/1507 variables, 7/762 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1507 variables, 74/836 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1507 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 30/1537 variables, 54/890 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1537 variables, 2/892 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1537 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 32/1569 variables, 30/922 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1569 variables, 1/923 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1569 variables, 8/931 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1569 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 19/1588 variables, 20/951 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1588 variables, 1/952 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1588 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 19/1607 variables, 19/971 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1607 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 10/1617 variables, 14/985 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1617 variables, 3/988 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1617 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 10/1627 variables, 10/998 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1627/1628 variables, and 998 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 246/246 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 8569ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 8407/8407 transitions.
Graph (complete) has 2087 edges and 246 vertex of which 240 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.24 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 188 transitions
Ensure Unique test removed 339 transitions
Reduce isomorphic transitions removed 527 transitions.
Iterating post reduction 0 with 529 rules applied. Total rules applied 530 place count 238 transition count 7880
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 530 place count 238 transition count 7879
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 532 place count 237 transition count 7879
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 548 place count 221 transition count 6518
Iterating global reduction 1 with 16 rules applied. Total rules applied 564 place count 221 transition count 6518
Ensure Unique test removed 483 transitions
Reduce isomorphic transitions removed 483 transitions.
Iterating post reduction 1 with 483 rules applied. Total rules applied 1047 place count 221 transition count 6035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1049 place count 219 transition count 6033
Iterating global reduction 2 with 2 rules applied. Total rules applied 1051 place count 219 transition count 6033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1052 place count 218 transition count 6032
Iterating global reduction 2 with 1 rules applied. Total rules applied 1053 place count 218 transition count 6032
Drop transitions (Redundant composition of simpler transitions.) removed 382 transitions
Redundant transition composition rules discarded 382 transitions
Iterating global reduction 2 with 382 rules applied. Total rules applied 1435 place count 218 transition count 5650
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 1462 place count 217 transition count 5624
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 3 with 192 rules applied. Total rules applied 1654 place count 217 transition count 5432
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 1657 place count 217 transition count 5429
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1660 place count 214 transition count 5429
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1661 place count 213 transition count 5428
Applied a total of 1661 rules in 2822 ms. Remains 213 /246 variables (removed 33) and now considering 5428/8407 (removed 2979) transitions.
Running 4879 sub problems to find dead transitions.
[2024-05-28 05:54:14] [INFO ] Flow matrix only has 1151 transitions (discarded 4277 similar events)
Normalized transition count is 1150 out of 1151 initially.
// Phase 1: matrix 1150 rows 213 cols
[2024-05-28 05:54:14] [INFO ] Computed 1 invariants in 6 ms
[2024-05-28 05:54:14] [INFO ] State equation strengthened by 600 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4879 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 213/1364 variables, and 1 constraints, problems are : Problem set: 0 solved, 4879 unsolved in 20076 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/213 constraints, ReadFeed: 0/600 constraints, PredecessorRefiner: 4879/4879 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4879 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4879 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 213/1364 variables, and 1 constraints, problems are : Problem set: 0 solved, 4879 unsolved in 20060 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/213 constraints, ReadFeed: 0/600 constraints, PredecessorRefiner: 0/4879 constraints, Known Traps: 0/0 constraints]
After SMT, in 56124ms problems are : Problem set: 0 solved, 4879 unsolved
Search for dead transitions found 0 dead transitions in 56176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59017 ms. Remains : 213/246 places, 5428/8407 transitions.
RANDOM walk for 40005 steps (8 resets) in 1957 ms. (20 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
[2024-05-28 05:55:11] [INFO ] Flow matrix only has 1151 transitions (discarded 4277 similar events)
[2024-05-28 05:55:11] [INFO ] Invariant cache hit.
[2024-05-28 05:55:11] [INFO ] State equation strengthened by 600 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 36/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 338/381 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/382 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 702/1084 variables, 73/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1084 variables, 189/296 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1084 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 142/1226 variables, 40/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1226 variables, 203/539 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1226 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 15/1241 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1241 variables, 8/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1241 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 6/1247 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1247 variables, 46/602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1247 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 18/1265 variables, 115/717 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1265 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1265 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 17/1282 variables, 17/735 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1282 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 10/1292 variables, 8/743 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1292 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 10/1302 variables, 10/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1302 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 10/1312 variables, 10/763 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1312 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 10/1322 variables, 10/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1322 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 9/1331 variables, 9/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1331 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 9/1340 variables, 9/791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1340 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 7/1347 variables, 6/797 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1347 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 7/1354 variables, 7/804 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1354 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (OVERLAPS) 4/1358 variables, 4/808 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1358 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 4/1362 variables, 4/812 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1362 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 1/1363 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1363 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (OVERLAPS) 1/1364 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1364 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (OVERLAPS) 0/1364 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1364/1364 variables, and 814 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2909 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, ReadFeed: 600/600 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 36/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 338/381 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/382 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 702/1084 variables, 73/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1084 variables, 189/296 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1084 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 142/1226 variables, 40/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1226 variables, 203/539 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1226 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 15/1241 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1241 variables, 8/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1241 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 6/1247 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1247 variables, 46/602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1247 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 18/1265 variables, 115/717 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1265 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1265 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 17/1282 variables, 17/735 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1282 variables, 5/740 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1282 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 10/1292 variables, 8/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1292 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 10/1302 variables, 10/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1302 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 10/1312 variables, 10/768 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1312 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 10/1322 variables, 10/778 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1322 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 9/1331 variables, 9/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1331 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 9/1340 variables, 9/796 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1340 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (OVERLAPS) 7/1347 variables, 6/802 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1347 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 7/1354 variables, 7/809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1354 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 4/1358 variables, 4/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1358 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (OVERLAPS) 4/1362 variables, 4/817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1362 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 1/1363 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1363 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 1/1364 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1364 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (OVERLAPS) 0/1364 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1364/1364 variables, and 819 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3820 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, ReadFeed: 600/600 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 6853ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 113 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=18 )
Parikh walk visited 5 properties in 16 ms.
[2024-05-28 05:55:18] [INFO ] Flatten gal took : 170 ms
[2024-05-28 05:55:18] [INFO ] Flatten gal took : 194 ms
[2024-05-28 05:55:18] [INFO ] Input system was already deterministic with 8407 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 8407/8407 transitions.
Graph (complete) has 3858 edges and 246 vertex of which 234 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.38 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 347 transitions
Reduce isomorphic transitions removed 347 transitions.
Iterating post reduction 0 with 347 rules applied. Total rules applied 348 place count 231 transition count 8056
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 368 place count 211 transition count 6606
Iterating global reduction 1 with 20 rules applied. Total rules applied 388 place count 211 transition count 6606
Ensure Unique test removed 701 transitions
Reduce isomorphic transitions removed 701 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1089 place count 211 transition count 5905
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1097 place count 203 transition count 5897
Iterating global reduction 2 with 8 rules applied. Total rules applied 1105 place count 203 transition count 5897
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1112 place count 196 transition count 5890
Iterating global reduction 2 with 7 rules applied. Total rules applied 1119 place count 196 transition count 5890
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1124 place count 191 transition count 5885
Iterating global reduction 2 with 5 rules applied. Total rules applied 1129 place count 191 transition count 5885
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1134 place count 186 transition count 5880
Iterating global reduction 2 with 5 rules applied. Total rules applied 1139 place count 186 transition count 5880
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1143 place count 182 transition count 5876
Iterating global reduction 2 with 4 rules applied. Total rules applied 1147 place count 182 transition count 5876
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1151 place count 182 transition count 5872
Drop transitions (Redundant composition of simpler transitions.) removed 481 transitions
Redundant transition composition rules discarded 481 transitions
Iterating global reduction 3 with 481 rules applied. Total rules applied 1632 place count 182 transition count 5391
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 3175 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 1634 place count 180 transition count 5390
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1635 place count 180 transition count 5389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1636 place count 179 transition count 5389
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1637 place count 178 transition count 5388
Iterating global reduction 5 with 1 rules applied. Total rules applied 1638 place count 178 transition count 5388
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1639 place count 177 transition count 5387
Iterating global reduction 5 with 1 rules applied. Total rules applied 1640 place count 177 transition count 5387
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1641 place count 176 transition count 5386
Iterating global reduction 5 with 1 rules applied. Total rules applied 1642 place count 176 transition count 5386
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1643 place count 175 transition count 5385
Iterating global reduction 5 with 1 rules applied. Total rules applied 1644 place count 175 transition count 5385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1645 place count 175 transition count 5384
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1646 place count 175 transition count 5383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1647 place count 174 transition count 5383
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1648 place count 173 transition count 5382
Iterating global reduction 7 with 1 rules applied. Total rules applied 1649 place count 173 transition count 5382
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1651 place count 171 transition count 5380
Iterating global reduction 7 with 2 rules applied. Total rules applied 1653 place count 171 transition count 5380
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1655 place count 169 transition count 5378
Iterating global reduction 7 with 2 rules applied. Total rules applied 1657 place count 169 transition count 5378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1659 place count 169 transition count 5376
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1660 place count 169 transition count 5375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1661 place count 168 transition count 5375
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1662 place count 167 transition count 5374
Iterating global reduction 9 with 1 rules applied. Total rules applied 1663 place count 167 transition count 5374
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1665 place count 165 transition count 5372
Iterating global reduction 9 with 2 rules applied. Total rules applied 1667 place count 165 transition count 5372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1669 place count 165 transition count 5370
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1670 place count 165 transition count 5369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1671 place count 164 transition count 5369
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1672 place count 164 transition count 5368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1673 place count 163 transition count 5368
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1674 place count 163 transition count 5367
Applied a total of 1674 rules in 4501 ms. Remains 163 /246 variables (removed 83) and now considering 5367/8407 (removed 3040) transitions.
Running 4815 sub problems to find dead transitions.
[2024-05-28 05:55:23] [INFO ] Flow matrix only has 1098 transitions (discarded 4269 similar events)
Normalized transition count is 1097 out of 1098 initially.
// Phase 1: matrix 1097 rows 163 cols
[2024-05-28 05:55:23] [INFO ] Computed 0 invariants in 3 ms
[2024-05-28 05:55:23] [INFO ] State equation strengthened by 546 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 161/1261 variables, and 0 constraints, problems are : Problem set: 0 solved, 4815 unsolved in 20065 ms.
Refiners :[State Equation: 0/163 constraints, ReadFeed: 0/546 constraints, PredecessorRefiner: 4815/4815 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4815 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 161/1261 variables, and 0 constraints, problems are : Problem set: 0 solved, 4815 unsolved in 20057 ms.
Refiners :[State Equation: 0/163 constraints, ReadFeed: 0/546 constraints, PredecessorRefiner: 0/4815 constraints, Known Traps: 0/0 constraints]
After SMT, in 56349ms problems are : Problem set: 0 solved, 4815 unsolved
Search for dead transitions found 0 dead transitions in 56398ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60921 ms. Remains : 163/246 places, 5367/8407 transitions.
[2024-05-28 05:56:20] [INFO ] Flatten gal took : 95 ms
[2024-05-28 05:56:20] [INFO ] Flatten gal took : 112 ms
[2024-05-28 05:56:20] [INFO ] Input system was already deterministic with 5367 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 8407/8407 transitions.
Graph (complete) has 3858 edges and 246 vertex of which 234 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.6 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 347 transitions
Reduce isomorphic transitions removed 347 transitions.
Iterating post reduction 0 with 347 rules applied. Total rules applied 348 place count 231 transition count 8056
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 371 place count 208 transition count 6438
Iterating global reduction 1 with 23 rules applied. Total rules applied 394 place count 208 transition count 6438
Ensure Unique test removed 731 transitions
Reduce isomorphic transitions removed 731 transitions.
Iterating post reduction 1 with 731 rules applied. Total rules applied 1125 place count 208 transition count 5707
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1133 place count 200 transition count 5699
Iterating global reduction 2 with 8 rules applied. Total rules applied 1141 place count 200 transition count 5699
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1148 place count 193 transition count 5692
Iterating global reduction 2 with 7 rules applied. Total rules applied 1155 place count 193 transition count 5692
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1160 place count 188 transition count 5687
Iterating global reduction 2 with 5 rules applied. Total rules applied 1165 place count 188 transition count 5687
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1170 place count 183 transition count 5682
Iterating global reduction 2 with 5 rules applied. Total rules applied 1175 place count 183 transition count 5682
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1179 place count 179 transition count 5678
Iterating global reduction 2 with 4 rules applied. Total rules applied 1183 place count 179 transition count 5678
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1187 place count 179 transition count 5674
Drop transitions (Redundant composition of simpler transitions.) removed 483 transitions
Redundant transition composition rules discarded 483 transitions
Iterating global reduction 3 with 483 rules applied. Total rules applied 1670 place count 179 transition count 5191
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 3066 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 5 rules applied. Total rules applied 1675 place count 176 transition count 5188
Drop transitions (Redundant composition of simpler transitions.) removed 185 transitions
Redundant transition composition rules discarded 185 transitions
Iterating global reduction 4 with 185 rules applied. Total rules applied 1860 place count 176 transition count 5003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1861 place count 175 transition count 5003
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1862 place count 174 transition count 5002
Iterating global reduction 5 with 1 rules applied. Total rules applied 1863 place count 174 transition count 5002
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1864 place count 173 transition count 5001
Iterating global reduction 5 with 1 rules applied. Total rules applied 1865 place count 173 transition count 5001
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1866 place count 172 transition count 5000
Iterating global reduction 5 with 1 rules applied. Total rules applied 1867 place count 172 transition count 5000
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1868 place count 171 transition count 4999
Iterating global reduction 5 with 1 rules applied. Total rules applied 1869 place count 171 transition count 4999
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1870 place count 171 transition count 4998
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1871 place count 171 transition count 4997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1872 place count 170 transition count 4997
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1873 place count 169 transition count 4996
Iterating global reduction 7 with 1 rules applied. Total rules applied 1874 place count 169 transition count 4996
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1876 place count 167 transition count 4994
Iterating global reduction 7 with 2 rules applied. Total rules applied 1878 place count 167 transition count 4994
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1880 place count 165 transition count 4992
Iterating global reduction 7 with 2 rules applied. Total rules applied 1882 place count 165 transition count 4992
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1884 place count 165 transition count 4990
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1885 place count 165 transition count 4989
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1886 place count 164 transition count 4989
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1887 place count 163 transition count 4988
Iterating global reduction 9 with 1 rules applied. Total rules applied 1888 place count 163 transition count 4988
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1890 place count 161 transition count 4986
Iterating global reduction 9 with 2 rules applied. Total rules applied 1892 place count 161 transition count 4986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1894 place count 161 transition count 4984
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1895 place count 161 transition count 4983
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1896 place count 160 transition count 4983
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1897 place count 160 transition count 4982
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1898 place count 159 transition count 4982
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1899 place count 159 transition count 4981
Applied a total of 1899 rules in 3613 ms. Remains 159 /246 variables (removed 87) and now considering 4981/8407 (removed 3426) transitions.
Running 4449 sub problems to find dead transitions.
[2024-05-28 05:56:24] [INFO ] Flow matrix only has 1064 transitions (discarded 3917 similar events)
Normalized transition count is 1063 out of 1064 initially.
// Phase 1: matrix 1063 rows 159 cols
[2024-05-28 05:56:24] [INFO ] Computed 0 invariants in 2 ms
[2024-05-28 05:56:24] [INFO ] State equation strengthened by 532 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4449 unsolved
SMT process timed out in 34695ms, After SMT, problems are : Problem set: 0 solved, 4449 unsolved
Search for dead transitions found 0 dead transitions in 34736ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 38359 ms. Remains : 159/246 places, 4981/8407 transitions.
[2024-05-28 05:56:58] [INFO ] Flatten gal took : 90 ms
[2024-05-28 05:56:58] [INFO ] Flatten gal took : 105 ms
[2024-05-28 05:56:59] [INFO ] Input system was already deterministic with 4981 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 8407/8407 transitions.
Graph (complete) has 3858 edges and 246 vertex of which 234 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.7 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 347 transitions
Reduce isomorphic transitions removed 347 transitions.
Iterating post reduction 0 with 347 rules applied. Total rules applied 348 place count 231 transition count 8056
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 370 place count 209 transition count 6486
Iterating global reduction 1 with 22 rules applied. Total rules applied 392 place count 209 transition count 6486
Ensure Unique test removed 667 transitions
Reduce isomorphic transitions removed 667 transitions.
Iterating post reduction 1 with 667 rules applied. Total rules applied 1059 place count 209 transition count 5819
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1067 place count 201 transition count 5811
Iterating global reduction 2 with 8 rules applied. Total rules applied 1075 place count 201 transition count 5811
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1082 place count 194 transition count 5804
Iterating global reduction 2 with 7 rules applied. Total rules applied 1089 place count 194 transition count 5804
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1094 place count 189 transition count 5799
Iterating global reduction 2 with 5 rules applied. Total rules applied 1099 place count 189 transition count 5799
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1104 place count 184 transition count 5794
Iterating global reduction 2 with 5 rules applied. Total rules applied 1109 place count 184 transition count 5794
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1113 place count 180 transition count 5790
Iterating global reduction 2 with 4 rules applied. Total rules applied 1117 place count 180 transition count 5790
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1121 place count 180 transition count 5786
Drop transitions (Redundant composition of simpler transitions.) removed 499 transitions
Redundant transition composition rules discarded 499 transitions
Iterating global reduction 3 with 499 rules applied. Total rules applied 1620 place count 180 transition count 5287
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 3096 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 5 rules applied. Total rules applied 1625 place count 177 transition count 5284
Drop transitions (Redundant composition of simpler transitions.) removed 185 transitions
Redundant transition composition rules discarded 185 transitions
Iterating global reduction 4 with 185 rules applied. Total rules applied 1810 place count 177 transition count 5099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1811 place count 176 transition count 5099
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1812 place count 175 transition count 5098
Iterating global reduction 5 with 1 rules applied. Total rules applied 1813 place count 175 transition count 5098
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1814 place count 174 transition count 5097
Iterating global reduction 5 with 1 rules applied. Total rules applied 1815 place count 174 transition count 5097
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1816 place count 173 transition count 5096
Iterating global reduction 5 with 1 rules applied. Total rules applied 1817 place count 173 transition count 5096
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1818 place count 172 transition count 5095
Iterating global reduction 5 with 1 rules applied. Total rules applied 1819 place count 172 transition count 5095
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1820 place count 172 transition count 5094
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1821 place count 172 transition count 5093
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1822 place count 171 transition count 5093
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1823 place count 170 transition count 5092
Iterating global reduction 7 with 1 rules applied. Total rules applied 1824 place count 170 transition count 5092
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1826 place count 168 transition count 5090
Iterating global reduction 7 with 2 rules applied. Total rules applied 1828 place count 168 transition count 5090
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1830 place count 166 transition count 5088
Iterating global reduction 7 with 2 rules applied. Total rules applied 1832 place count 166 transition count 5088
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1834 place count 166 transition count 5086
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1835 place count 166 transition count 5085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1836 place count 165 transition count 5085
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1837 place count 164 transition count 5084
Iterating global reduction 9 with 1 rules applied. Total rules applied 1838 place count 164 transition count 5084
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1840 place count 162 transition count 5082
Iterating global reduction 9 with 2 rules applied. Total rules applied 1842 place count 162 transition count 5082
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1844 place count 162 transition count 5080
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1845 place count 162 transition count 5079
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1846 place count 161 transition count 5079
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1847 place count 161 transition count 5078
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1848 place count 160 transition count 5078
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1849 place count 160 transition count 5077
Applied a total of 1849 rules in 3599 ms. Remains 160 /246 variables (removed 86) and now considering 5077/8407 (removed 3330) transitions.
Running 4545 sub problems to find dead transitions.
[2024-05-28 05:57:02] [INFO ] Flow matrix only has 1068 transitions (discarded 4009 similar events)
Normalized transition count is 1067 out of 1068 initially.
// Phase 1: matrix 1067 rows 160 cols
[2024-05-28 05:57:02] [INFO ] Computed 0 invariants in 7 ms
[2024-05-28 05:57:02] [INFO ] State equation strengthened by 536 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4545 unsolved
SMT process timed out in 34174ms, After SMT, problems are : Problem set: 0 solved, 4545 unsolved
Search for dead transitions found 0 dead transitions in 34215ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 37824 ms. Remains : 160/246 places, 5077/8407 transitions.
[2024-05-28 05:57:37] [INFO ] Flatten gal took : 97 ms
[2024-05-28 05:57:37] [INFO ] Flatten gal took : 119 ms
[2024-05-28 05:57:37] [INFO ] Input system was already deterministic with 5077 transitions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 8407/8407 transitions.
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 310 transitions
Reduce isomorphic transitions removed 310 transitions.
Iterating post reduction 0 with 317 rules applied. Total rules applied 317 place count 239 transition count 8097
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 334 place count 222 transition count 7294
Iterating global reduction 1 with 17 rules applied. Total rules applied 351 place count 222 transition count 7294
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 222 transition count 6942
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 709 place count 216 transition count 6936
Iterating global reduction 2 with 6 rules applied. Total rules applied 715 place count 216 transition count 6936
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 720 place count 211 transition count 6931
Iterating global reduction 2 with 5 rules applied. Total rules applied 725 place count 211 transition count 6931
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 728 place count 208 transition count 6928
Iterating global reduction 2 with 3 rules applied. Total rules applied 731 place count 208 transition count 6928
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 733 place count 206 transition count 6926
Iterating global reduction 2 with 2 rules applied. Total rules applied 735 place count 206 transition count 6926
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 736 place count 205 transition count 6925
Iterating global reduction 2 with 1 rules applied. Total rules applied 737 place count 205 transition count 6925
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 738 place count 205 transition count 6924
Drop transitions (Redundant composition of simpler transitions.) removed 316 transitions
Redundant transition composition rules discarded 316 transitions
Iterating global reduction 3 with 316 rules applied. Total rules applied 1054 place count 205 transition count 6608
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1057 place count 204 transition count 6606
Drop transitions (Redundant composition of simpler transitions.) removed 144 transitions
Redundant transition composition rules discarded 144 transitions
Iterating global reduction 4 with 144 rules applied. Total rules applied 1201 place count 204 transition count 6462
Applied a total of 1201 rules in 134 ms. Remains 204 /246 variables (removed 42) and now considering 6462/8407 (removed 1945) transitions.
Running 5910 sub problems to find dead transitions.
[2024-05-28 05:57:37] [INFO ] Flow matrix only has 1175 transitions (discarded 5287 similar events)
Normalized transition count is 1174 out of 1175 initially.
// Phase 1: matrix 1174 rows 204 cols
[2024-05-28 05:57:37] [INFO ] Computed 1 invariants in 10 ms
[2024-05-28 05:57:37] [INFO ] State equation strengthened by 618 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/1379 variables, and 0 constraints, problems are : Problem set: 0 solved, 5910 unsolved in 20263 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/204 constraints, ReadFeed: 0/618 constraints, PredecessorRefiner: 5910/5910 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5910 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 201/1379 variables, and 0 constraints, problems are : Problem set: 0 solved, 5910 unsolved in 20448 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/204 constraints, ReadFeed: 0/618 constraints, PredecessorRefiner: 0/5910 constraints, Known Traps: 0/0 constraints]
After SMT, in 63505ms problems are : Problem set: 0 solved, 5910 unsolved
Search for dead transitions found 0 dead transitions in 63560ms
Finished structural reductions in LTL mode , in 1 iterations and 63709 ms. Remains : 204/246 places, 6462/8407 transitions.
[2024-05-28 05:58:41] [INFO ] Flatten gal took : 146 ms
[2024-05-28 05:58:41] [INFO ] Flatten gal took : 130 ms
[2024-05-28 05:58:42] [INFO ] Input system was already deterministic with 6462 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 8407/8407 transitions.
Graph (complete) has 3858 edges and 246 vertex of which 234 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.6 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 347 transitions
Reduce isomorphic transitions removed 347 transitions.
Iterating post reduction 0 with 347 rules applied. Total rules applied 348 place count 231 transition count 8056
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 370 place count 209 transition count 6478
Iterating global reduction 1 with 22 rules applied. Total rules applied 392 place count 209 transition count 6478
Ensure Unique test removed 730 transitions
Reduce isomorphic transitions removed 730 transitions.
Iterating post reduction 1 with 730 rules applied. Total rules applied 1122 place count 209 transition count 5748
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1130 place count 201 transition count 5740
Iterating global reduction 2 with 8 rules applied. Total rules applied 1138 place count 201 transition count 5740
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1145 place count 194 transition count 5733
Iterating global reduction 2 with 7 rules applied. Total rules applied 1152 place count 194 transition count 5733
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1157 place count 189 transition count 5728
Iterating global reduction 2 with 5 rules applied. Total rules applied 1162 place count 189 transition count 5728
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1167 place count 184 transition count 5723
Iterating global reduction 2 with 5 rules applied. Total rules applied 1172 place count 184 transition count 5723
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1176 place count 180 transition count 5719
Iterating global reduction 2 with 4 rules applied. Total rules applied 1180 place count 180 transition count 5719
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1184 place count 180 transition count 5715
Drop transitions (Redundant composition of simpler transitions.) removed 483 transitions
Redundant transition composition rules discarded 483 transitions
Iterating global reduction 3 with 483 rules applied. Total rules applied 1667 place count 180 transition count 5232
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 3096 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 5 rules applied. Total rules applied 1672 place count 177 transition count 5229
Drop transitions (Redundant composition of simpler transitions.) removed 185 transitions
Redundant transition composition rules discarded 185 transitions
Iterating global reduction 4 with 185 rules applied. Total rules applied 1857 place count 177 transition count 5044
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1858 place count 176 transition count 5044
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1859 place count 175 transition count 5043
Iterating global reduction 5 with 1 rules applied. Total rules applied 1860 place count 175 transition count 5043
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1861 place count 174 transition count 5042
Iterating global reduction 5 with 1 rules applied. Total rules applied 1862 place count 174 transition count 5042
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1863 place count 173 transition count 5041
Iterating global reduction 5 with 1 rules applied. Total rules applied 1864 place count 173 transition count 5041
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1865 place count 172 transition count 5040
Iterating global reduction 5 with 1 rules applied. Total rules applied 1866 place count 172 transition count 5040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1867 place count 172 transition count 5039
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1868 place count 172 transition count 5038
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1869 place count 171 transition count 5038
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1870 place count 170 transition count 5037
Iterating global reduction 7 with 1 rules applied. Total rules applied 1871 place count 170 transition count 5037
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1873 place count 168 transition count 5035
Iterating global reduction 7 with 2 rules applied. Total rules applied 1875 place count 168 transition count 5035
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1877 place count 166 transition count 5033
Iterating global reduction 7 with 2 rules applied. Total rules applied 1879 place count 166 transition count 5033
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1881 place count 166 transition count 5031
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1882 place count 166 transition count 5030
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1883 place count 165 transition count 5030
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1884 place count 164 transition count 5029
Iterating global reduction 9 with 1 rules applied. Total rules applied 1885 place count 164 transition count 5029
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1887 place count 162 transition count 5027
Iterating global reduction 9 with 2 rules applied. Total rules applied 1889 place count 162 transition count 5027
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1891 place count 162 transition count 5025
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1892 place count 162 transition count 5024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1893 place count 161 transition count 5024
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1894 place count 161 transition count 5023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1895 place count 160 transition count 5023
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1896 place count 160 transition count 5022
Applied a total of 1896 rules in 3452 ms. Remains 160 /246 variables (removed 86) and now considering 5022/8407 (removed 3385) transitions.
Running 4489 sub problems to find dead transitions.
[2024-05-28 05:58:45] [INFO ] Flow matrix only has 1065 transitions (discarded 3957 similar events)
Normalized transition count is 1064 out of 1065 initially.
// Phase 1: matrix 1064 rows 160 cols
[2024-05-28 05:58:45] [INFO ] Computed 0 invariants in 6 ms
[2024-05-28 05:58:45] [INFO ] State equation strengthened by 532 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SemanticWebServices-PT-S256P15

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 329
TRANSITIONS: 29492
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 1.423s, Sys 0.081s]


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


----------------------------------------------------------------------
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: 619
MODEL NAME: /home/mcc/execution/model
329 places, 29492 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.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

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 CTLCardinality -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="SemanticWebServices-PT-S256P15"
export BK_EXAMINATION="CTLCardinality"
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 SemanticWebServices-PT-S256P15, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r333-tall-171679078800593"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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