About the Execution of ITS-Tools for ASLink-PT-04b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5108.268 | 3600000.00 | 8523411.00 | 7567.30 | FFTTTTTFTFFFFT?T | normal |
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.r004-smll-171620117800070.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 itstools
Input is ASLink-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117800070
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 669K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2023-14
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716264322361
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 04:05:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 04:05:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 04:05:24] [INFO ] Load time of PNML (sax parser for PT used): 402 ms
[2024-05-21 04:05:24] [INFO ] Transformed 2034 places.
[2024-05-21 04:05:24] [INFO ] Transformed 2567 transitions.
[2024-05-21 04:05:24] [INFO ] Found NUPN structural information;
[2024-05-21 04:05:24] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 641 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (97 resets) in 2514 ms. (15 steps per ms) remains 7/15 properties
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (11 resets) in 815 ms. (49 steps per ms) remains 6/7 properties
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (12 resets) in 373 ms. (106 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 220 ms. (181 steps per ms) remains 6/6 properties
[2024-05-21 04:05:26] [INFO ] Flatten gal took : 660 ms
BEST_FIRST walk for 40003 steps (13 resets) in 1245 ms. (32 steps per ms) remains 6/6 properties
// Phase 1: matrix 2567 rows 2034 cols
[2024-05-21 04:05:26] [INFO ] Flatten gal took : 264 ms
[2024-05-21 04:05:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9635575056844181522.gal : 100 ms
[2024-05-21 04:05:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12346704142296464338.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9635575056844181522.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12346704142296464338.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-21 04:05:27] [INFO ] Computed 199 invariants in 388 ms
Loading property file /tmp/ReachabilityCardinality12346704142296464338.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 389/484 variables, 35/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 389/519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 124/608 variables, 13/532 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 124/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1393/2001 variables, 144/800 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2001 variables, 1393/2193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2001 variables, 0/2193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 33/2034 variables, 7/2200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2034 variables, 33/2233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2034 variables, 0/2233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2567/4601 variables, 2034/4267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :16 after 49
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :49 after 196
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :196 after 416
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :416 after 569
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :569 after 15361
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4601/4601 variables, and 4267 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5114 ms.
Refiners :[Domain max(s): 2034/2034 constraints, Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 151/151 constraints, State Equation: 2034/2034 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :15361 after 618139
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :618139 after 5.45975e+08
At refinement iteration 2 (OVERLAPS) 389/484 variables, 35/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 389/519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 124/608 variables, 13/532 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 124/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :5.45975e+08 after 3.89853e+11
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1393/2001 variables, 144/800 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2001 variables, 1393/2193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :3.89853e+11 after 3.51941e+17
[2024-05-21 04:05:35] [INFO ] Deduced a trap composed of 39 places in 1079 ms of which 149 ms to minimize.
[2024-05-21 04:05:36] [INFO ] Deduced a trap composed of 21 places in 928 ms of which 13 ms to minimize.
[2024-05-21 04:05:36] [INFO ] Deduced a trap composed of 23 places in 674 ms of which 9 ms to minimize.
[2024-05-21 04:05:37] [INFO ] Deduced a trap composed of 68 places in 784 ms of which 14 ms to minimize.
SMT process timed out in 10809ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 95 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 2034 transition count 2167
Reduce places removed 400 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 420 rules applied. Total rules applied 820 place count 1634 transition count 2147
Reduce places removed 5 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 32 rules applied. Total rules applied 852 place count 1629 transition count 2120
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 879 place count 1602 transition count 2120
Performed 432 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 432 Pre rules applied. Total rules applied 879 place count 1602 transition count 1688
Deduced a syphon composed of 432 places in 6 ms
Ensure Unique test removed 31 places
Reduce places removed 463 places and 0 transitions.
Iterating global reduction 4 with 895 rules applied. Total rules applied 1774 place count 1139 transition count 1688
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 4 with 26 rules applied. Total rules applied 1800 place count 1131 transition count 1670
Reduce places removed 18 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 23 rules applied. Total rules applied 1823 place count 1113 transition count 1665
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1828 place count 1108 transition count 1665
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1828 place count 1108 transition count 1656
Deduced a syphon composed of 9 places in 11 ms
Ensure Unique test removed 7 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 1853 place count 1092 transition count 1656
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 1854 place count 1091 transition count 1656
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 1854 place count 1091 transition count 1648
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1870 place count 1083 transition count 1648
Discarding 56 places :
Symmetric choice reduction at 8 with 56 rule applications. Total rules 1926 place count 1027 transition count 1592
Iterating global reduction 8 with 56 rules applied. Total rules applied 1982 place count 1027 transition count 1592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1983 place count 1027 transition count 1591
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 1983 place count 1027 transition count 1575
Deduced a syphon composed of 16 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 33 rules applied. Total rules applied 2016 place count 1010 transition count 1575
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2016 place count 1010 transition count 1574
Deduced a syphon composed of 1 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2019 place count 1008 transition count 1574
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2024 place count 1003 transition count 1541
Iterating global reduction 9 with 5 rules applied. Total rules applied 2029 place count 1003 transition count 1541
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 2029 place count 1003 transition count 1538
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 2035 place count 1000 transition count 1538
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2036 place count 999 transition count 1530
Iterating global reduction 9 with 1 rules applied. Total rules applied 2037 place count 999 transition count 1530
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2038 place count 998 transition count 1522
Iterating global reduction 9 with 1 rules applied. Total rules applied 2039 place count 998 transition count 1522
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2040 place count 997 transition count 1514
Iterating global reduction 9 with 1 rules applied. Total rules applied 2041 place count 997 transition count 1514
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2042 place count 996 transition count 1506
Iterating global reduction 9 with 1 rules applied. Total rules applied 2043 place count 996 transition count 1506
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2044 place count 995 transition count 1498
Iterating global reduction 9 with 1 rules applied. Total rules applied 2045 place count 995 transition count 1498
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2046 place count 994 transition count 1490
Iterating global reduction 9 with 1 rules applied. Total rules applied 2047 place count 994 transition count 1490
SDD proceeding with computation,6 properties remain. new max is 16384
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2048 place count 993 transition count 1482
Iterating global reduction 9 with 1 rules applied. Total rules applied 2049 place count 993 transition count 1482
SDD size :3.51941e+17 after 5.54986e+23
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2050 place count 992 transition count 1474
Iterating global reduction 9 with 1 rules applied. Total rules applied 2051 place count 992 transition count 1474
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2052 place count 991 transition count 1466
Iterating global reduction 9 with 1 rules applied. Total rules applied 2053 place count 991 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2054 place count 990 transition count 1458
Iterating global reduction 9 with 1 rules applied. Total rules applied 2055 place count 990 transition count 1458
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2056 place count 989 transition count 1450
Iterating global reduction 9 with 1 rules applied. Total rules applied 2057 place count 989 transition count 1450
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2058 place count 988 transition count 1442
Iterating global reduction 9 with 1 rules applied. Total rules applied 2059 place count 988 transition count 1442
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2060 place count 987 transition count 1434
Iterating global reduction 9 with 1 rules applied. Total rules applied 2061 place count 987 transition count 1434
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2062 place count 986 transition count 1426
Iterating global reduction 9 with 1 rules applied. Total rules applied 2063 place count 986 transition count 1426
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2064 place count 985 transition count 1418
Iterating global reduction 9 with 1 rules applied. Total rules applied 2065 place count 985 transition count 1418
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2066 place count 984 transition count 1410
Iterating global reduction 9 with 1 rules applied. Total rules applied 2067 place count 984 transition count 1410
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 9 with 236 rules applied. Total rules applied 2303 place count 864 transition count 1294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2305 place count 863 transition count 1303
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2306 place count 863 transition count 1302
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 2308 place count 862 transition count 1301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2309 place count 861 transition count 1301
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 2316 place count 861 transition count 1294
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 2323 place count 854 transition count 1294
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 12 with 9 rules applied. Total rules applied 2332 place count 854 transition count 1285
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 2341 place count 845 transition count 1285
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 2343 place count 845 transition count 1285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2344 place count 844 transition count 1284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2345 place count 843 transition count 1284
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 2 Pre rules applied. Total rules applied 2345 place count 843 transition count 1282
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2349 place count 841 transition count 1282
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 14 with 1 rules applied. Total rules applied 2350 place count 840 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2351 place count 839 transition count 1281
Iterating global reduction 15 with 1 rules applied. Total rules applied 2352 place count 839 transition count 1281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2354 place count 838 transition count 1280
Applied a total of 2354 rules in 2192 ms. Remains 838 /2034 variables (removed 1196) and now considering 1280/2567 (removed 1287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2209 ms. Remains : 838/2034 places, 1280/2567 transitions.
RANDOM walk for 40000 steps (356 resets) in 371 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (76 resets) in 272 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (75 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (67 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (59 resets) in 121 ms. (327 steps per ms) remains 5/6 properties
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (70 resets) in 359 ms. (111 steps per ms) remains 5/5 properties
// Phase 1: matrix 1280 rows 838 cols
[2024-05-21 04:05:40] [INFO ] Computed 143 invariants in 87 ms
[2024-05-21 04:05:40] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 231/324 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 22/346 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 483/829 variables, 109/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/829 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9/838 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1280/2118 variables, 838/981 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 32768
At refinement iteration 10 (INCLUDED_ONLY) 0/2118 variables, 19/1000 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD size :5.54986e+23 after 5.70061e+25
At refinement iteration 11 (INCLUDED_ONLY) 0/2118 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2118 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2118/2118 variables, and 1000 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2084 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 838/838 constraints, ReadFeed: 19/19 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/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 231/324 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 04:05:42] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 22/346 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 483/829 variables, 109/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 04:05:43] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
[2024-05-21 04:05:43] [INFO ] Deduced a trap composed of 119 places in 256 ms of which 4 ms to minimize.
[2024-05-21 04:05:44] [INFO ] Deduced a trap composed of 12 places in 486 ms of which 7 ms to minimize.
[2024-05-21 04:05:44] [INFO ] Deduced a trap composed of 46 places in 315 ms of which 5 ms to minimize.
[2024-05-21 04:05:45] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/829 variables, 5/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 04:05:45] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/829 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/829 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 9/838 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/838 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1280/2118 variables, 838/988 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2118 variables, 19/1007 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :5.70061e+25 after 6.37066e+25
At refinement iteration 14 (INCLUDED_ONLY) 0/2118 variables, 5/1012 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :6.37066e+25 after 7.19464e+25
[2024-05-21 04:06:14] [INFO ] Deduced a trap composed of 37 places in 619 ms of which 11 ms to minimize.
[2024-05-21 04:06:15] [INFO ] Deduced a trap composed of 67 places in 534 ms of which 6 ms to minimize.
[2024-05-21 04:06:16] [INFO ] Deduced a trap composed of 46 places in 376 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2118 variables, 3/1015 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2118 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2118/2118 variables, and 1015 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45019 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 838/838 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 47329ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 838 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 838/838 places, 1280/1280 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 838 transition count 1278
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 836 transition count 1278
Applied a total of 4 rules in 64 ms. Remains 836 /838 variables (removed 2) and now considering 1278/1280 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 836/838 places, 1278/1280 transitions.
RANDOM walk for 40000 steps (367 resets) in 646 ms. (61 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (78 resets) in 330 ms. (120 steps per ms) remains 4/5 properties
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (86 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (74 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 299 ms. (133 steps per ms) remains 4/4 properties
// Phase 1: matrix 1278 rows 836 cols
[2024-05-21 04:06:28] [INFO ] Computed 143 invariants in 32 ms
[2024-05-21 04:06:28] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 220/287 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 36/323 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 502/825 variables, 108/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/825 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 11/836 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/836 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1278/2114 variables, 836/979 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2114 variables, 19/998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2114 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2114 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2114/2114 variables, and 998 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1895 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 836/836 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 220/287 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 36/323 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 502/825 variables, 108/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:06:31] [INFO ] Deduced a trap composed of 17 places in 374 ms of which 5 ms to minimize.
[2024-05-21 04:06:31] [INFO ] Deduced a trap composed of 28 places in 297 ms of which 2 ms to minimize.
[2024-05-21 04:06:31] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 2 ms to minimize.
[2024-05-21 04:06:32] [INFO ] Deduced a trap composed of 50 places in 293 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/825 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/825 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 11/836 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/836 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1278/2114 variables, 836/983 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2114 variables, 19/1002 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :7.19464e+25 after 1.05181e+26
At refinement iteration 12 (INCLUDED_ONLY) 0/2114 variables, 4/1006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2114 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:07:04] [INFO ] Deduced a trap composed of 24 places in 547 ms of which 7 ms to minimize.
[2024-05-21 04:07:05] [INFO ] Deduced a trap composed of 37 places in 515 ms of which 7 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/2114 variables, 2/1008 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2114 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:07:36] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 4 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 524288
SDD size :1.05181e+26 after 6.41877e+26
At refinement iteration 16 (OVERLAPS) 0/2114 variables, 1/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2114/2114 variables, and 1009 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75015 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 836/836 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 76994ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 836 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 836/836 places, 1278/1278 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 836 transition count 1274
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 832 transition count 1273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 831 transition count 1273
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 10 place count 831 transition count 1260
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 39 place count 815 transition count 1260
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 814 transition count 1260
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 52 place count 808 transition count 1254
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 808 transition count 1254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 807 transition count 1253
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 58 place count 804 transition count 1252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 59 place count 803 transition count 1252
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 59 place count 803 transition count 1247
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 69 place count 798 transition count 1247
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 70 place count 797 transition count 1247
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 76 place count 794 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 77 place count 793 transition count 1243
Iterating global reduction 7 with 1 rules applied. Total rules applied 78 place count 793 transition count 1243
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 79 place count 793 transition count 1242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 80 place count 792 transition count 1242
Applied a total of 80 rules in 219 ms. Remains 792 /836 variables (removed 44) and now considering 1242/1278 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 792/836 places, 1242/1278 transitions.
RANDOM walk for 40000 steps (390 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (80 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (83 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (66 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 237341 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :2 out of 4
Probabilistic random walk after 237341 steps, saw 48076 distinct states, run finished after 3009 ms. (steps per millisecond=78 ) properties seen :2
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1242 rows 792 cols
[2024-05-21 04:07:49] [INFO ] Computed 135 invariants in 18 ms
[2024-05-21 04:07:49] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 224/286 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/314 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/319 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 463/782 variables, 100/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/783 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/783 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/792 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/792 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1242/2034 variables, 792/927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2034 variables, 6/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2034 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2034 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2034/2034 variables, and 933 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1479 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 792/792 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 224/286 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/314 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/319 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 463/782 variables, 100/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 04:07:51] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/782 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/783 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/783 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 9/792 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/792 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1242/2034 variables, 792/928 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2034 variables, 6/934 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2034 variables, 2/936 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2034 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2034 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2034/2034 variables, and 936 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8599 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 792/792 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 10127ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 10051 ms.
Support contains 62 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 792 transition count 1241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 791 transition count 1241
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 791 transition count 1238
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 788 transition count 1238
Applied a total of 8 rules in 39 ms. Remains 788 /792 variables (removed 4) and now considering 1238/1242 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 788/792 places, 1238/1242 transitions.
RANDOM walk for 40000 steps (395 resets) in 258 ms. (154 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (86 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (72 resets) in 318 ms. (125 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 251378 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 2
Probabilistic random walk after 251378 steps, saw 51346 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 1238 rows 788 cols
[2024-05-21 04:08:12] [INFO ] Computed 135 invariants in 45 ms
[2024-05-21 04:08:12] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 208/270 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/298 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/303 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 475/778 variables, 101/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/778 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/779 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/779 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/788 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/788 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1238/2026 variables, 788/923 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2026 variables, 6/929 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2026 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2026 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2026/2026 variables, and 929 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1510 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 103/103 constraints, State Equation: 788/788 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 208/270 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/298 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/303 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 475/778 variables, 101/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 04:08:14] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 2 ms to minimize.
[2024-05-21 04:08:14] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-21 04:08:14] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 2 ms to minimize.
[2024-05-21 04:08:15] [INFO ] Deduced a trap composed of 87 places in 187 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/778 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/778 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/779 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/779 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 9/788 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/788 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1238/2026 variables, 788/927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2026 variables, 6/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2026 variables, 2/935 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2026 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2026 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2026/2026 variables, and 935 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3985 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 103/103 constraints, State Equation: 788/788 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 5574ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1264 ms.
Support contains 62 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 1238/1238 transitions.
Applied a total of 0 rules in 26 ms. Remains 788 /788 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 788/788 places, 1238/1238 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 1238/1238 transitions.
Applied a total of 0 rules in 25 ms. Remains 788 /788 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
[2024-05-21 04:08:19] [INFO ] Invariant cache hit.
[2024-05-21 04:08:20] [INFO ] Implicit Places using invariants in 895 ms returned [1, 20, 21, 22, 26, 41, 58, 77, 117, 188, 189, 193, 210, 228, 285, 308, 314, 325, 326, 328, 349, 367, 438, 455, 460, 461, 472, 473, 474, 477, 495, 515, 584, 597, 610, 613, 626, 627, 628, 646, 648, 652, 671, 672, 674, 675, 698, 704, 710, 716, 722, 728, 734, 740, 746, 752]
[2024-05-21 04:08:20] [INFO ] Actually due to overlaps returned [646, 628, 41, 58, 210, 328, 349, 495, 652, 193, 477, 188, 325, 473, 626, 671, 20, 189, 326, 474, 627, 648, 672, 1, 314, 460, 461, 21, 77, 228, 367, 472, 515, 674, 722, 740, 752, 22, 26, 597, 610, 613, 675, 698, 704, 710, 716, 728, 734, 746]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 912 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 738/788 places, 1238/1238 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 733 transition count 1157
Reduce places removed 81 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 90 rules applied. Total rules applied 176 place count 652 transition count 1148
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 185 place count 643 transition count 1148
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 185 place count 643 transition count 1127
Deduced a syphon composed of 21 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 228 place count 621 transition count 1127
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 9 rules applied. Total rules applied 237 place count 616 transition count 1123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 241 place count 612 transition count 1123
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 254 place count 599 transition count 1110
Iterating global reduction 5 with 13 rules applied. Total rules applied 267 place count 599 transition count 1110
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 272 place count 594 transition count 1103
Iterating global reduction 5 with 5 rules applied. Total rules applied 277 place count 594 transition count 1103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 280 place count 594 transition count 1100
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 281 place count 593 transition count 1099
Iterating global reduction 6 with 1 rules applied. Total rules applied 282 place count 593 transition count 1099
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 283 place count 592 transition count 1097
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 592 transition count 1097
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 340 place count 564 transition count 1069
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 342 place count 562 transition count 1067
Iterating global reduction 6 with 2 rules applied. Total rules applied 344 place count 562 transition count 1067
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 345 place count 562 transition count 1066
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 349 place count 560 transition count 1066
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 350 place count 560 transition count 1065
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 351 place count 560 transition count 1064
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 352 place count 559 transition count 1064
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 373 place count 559 transition count 1043
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 394 place count 538 transition count 1043
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 397 place count 538 transition count 1040
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 405 place count 538 transition count 1040
Applied a total of 405 rules in 302 ms. Remains 538 /738 variables (removed 200) and now considering 1040/1238 (removed 198) transitions.
// Phase 1: matrix 1040 rows 538 cols
[2024-05-21 04:08:20] [INFO ] Computed 74 invariants in 10 ms
[2024-05-21 04:08:21] [INFO ] Implicit Places using invariants in 474 ms returned [101, 108, 114, 199, 224, 233, 236, 238, 246, 247, 305, 327, 337, 341, 428, 522, 537]
[2024-05-21 04:08:21] [INFO ] Actually due to overlaps returned [246, 247, 101, 108, 224, 233, 238, 341, 428, 114, 199, 305, 327, 522, 537]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 483 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 523/788 places, 1040/1238 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 523 transition count 1039
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 522 transition count 1039
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 7 place count 517 transition count 1034
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 517 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 516 transition count 1033
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 516 transition count 1033
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 511 transition count 1028
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 511 transition count 1020
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 503 transition count 1020
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 503 transition count 1019
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 502 transition count 1019
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 502 transition count 1019
Applied a total of 43 rules in 158 ms. Remains 502 /523 variables (removed 21) and now considering 1019/1040 (removed 21) transitions.
// Phase 1: matrix 1019 rows 502 cols
[2024-05-21 04:08:21] [INFO ] Computed 59 invariants in 10 ms
[2024-05-21 04:08:21] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-21 04:08:21] [INFO ] Invariant cache hit.
[2024-05-21 04:08:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 04:08:23] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 502/788 places, 1019/1238 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3629 ms. Remains : 502/788 places, 1019/1238 transitions.
RANDOM walk for 40000 steps (418 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (105 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (94 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 310045 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 310045 steps, saw 96664 distinct states, run finished after 3005 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-21 04:08:26] [INFO ] Invariant cache hit.
[2024-05-21 04:08:26] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/213 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/217 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 285/502 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1019/1521 variables, 502/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1521 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1521 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1521 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1521/1521 variables, and 567 constraints, problems are : Problem set: 0 solved, 2 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 502/502 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/213 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/217 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 285/502 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 04:08:27] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 4 ms to minimize.
[2024-05-21 04:08:27] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-05-21 04:08:27] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-05-21 04:08:27] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-05-21 04:08:28] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1019/1521 variables, 502/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1521 variables, 6/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1521 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1521 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1521 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1521/1521 variables, and 574 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6169 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 502/502 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 7055ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1022 ms.
Support contains 62 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 1019/1019 transitions.
Applied a total of 0 rules in 18 ms. Remains 502 /502 variables (removed 0) and now considering 1019/1019 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 502/502 places, 1019/1019 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 1019/1019 transitions.
Applied a total of 0 rules in 26 ms. Remains 502 /502 variables (removed 0) and now considering 1019/1019 (removed 0) transitions.
[2024-05-21 04:08:34] [INFO ] Invariant cache hit.
[2024-05-21 04:08:34] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-21 04:08:34] [INFO ] Invariant cache hit.
[2024-05-21 04:08:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 04:08:36] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
[2024-05-21 04:08:36] [INFO ] Redundant transitions in 89 ms returned []
Running 1003 sub problems to find dead transitions.
[2024-05-21 04:08:36] [INFO ] Invariant cache hit.
[2024-05-21 04:08:36] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1003 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/497 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1003 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1003 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 8.0)
(s82 1.0)
(s83 7.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 2.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 4/501 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1003 unsolved
SMT process timed out in 30831ms, After SMT, problems are : Problem set: 0 solved, 1003 unsolved
Search for dead transitions found 0 dead transitions in 30853ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32789 ms. Remains : 502/502 places, 1019/1019 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 2407 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 501 transition count 1017
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 499 transition count 1017
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 7 place count 497 transition count 1017
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 7 place count 497 transition count 1016
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 496 transition count 1016
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 494 transition count 1014
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 494 transition count 1013
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 493 transition count 1013
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 493 transition count 1012
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 493 transition count 1011
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 492 transition count 1011
Applied a total of 18 rules in 154 ms. Remains 492 /502 variables (removed 10) and now considering 1011/1019 (removed 8) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1011 rows 492 cols
[2024-05-21 04:09:07] [INFO ] Computed 56 invariants in 10 ms
[2024-05-21 04:09:07] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-21 04:09:07] [INFO ] [Real]Absence check using 13 positive and 43 generalized place invariants in 20 ms returned sat
[2024-05-21 04:09:07] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 04:09:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-21 04:09:07] [INFO ] [Nat]Absence check using 13 positive and 43 generalized place invariants in 20 ms returned sat
[2024-05-21 04:09:09] [INFO ] After 1955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 04:09:19] [INFO ] After 12200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 04:09:22] [INFO ] After 15349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-21 04:09:23] [INFO ] Flatten gal took : 108 ms
[2024-05-21 04:09:23] [INFO ] Flatten gal took : 89 ms
[2024-05-21 04:09:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8865287545075999197.gal : 13 ms
[2024-05-21 04:09:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2566200303362449044.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8865287545075999197.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2566200303362449044.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2566200303362449044.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 39
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :39 after 98
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :98 after 908
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :908 after 84825
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :84825 after 1.93778e+08
Reachability property ASLink-PT-04b-ReachabilityCardinality-2024-08 is true.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.93778e+08 after 1.93812e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.93812e+08 after 1.95109e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.95109e+08 after 2.87003e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.87003e+08 after 1.16465e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.16465e+09 after 5.25345e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.25345e+09 after 4.49286e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.49286e+10 after 3.5644e+11
SDD proceeding with computation,6 properties remain. new max is 1048576
SDD size :6.41877e+26 after 2.82867e+27
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.5644e+11 after 8.5116e+11
Detected timeout of ITS tools.
[2024-05-21 04:09:38] [INFO ] Flatten gal took : 51 ms
[2024-05-21 04:09:38] [INFO ] Applying decomposition
[2024-05-21 04:09:38] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9172095329437527949.txt' '-o' '/tmp/graph9172095329437527949.bin' '-w' '/tmp/graph9172095329437527949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9172095329437527949.bin' '-l' '-1' '-v' '-w' '/tmp/graph9172095329437527949.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:09:38] [INFO ] Decomposing Gal with order
[2024-05-21 04:09:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:09:38] [INFO ] Removed a total of 1862 redundant transitions.
[2024-05-21 04:09:39] [INFO ] Flatten gal took : 222 ms
[2024-05-21 04:09:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 46 ms.
[2024-05-21 04:09:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13229171673145075216.gal : 32 ms
[2024-05-21 04:09:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2378209899011834956.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13229171673145075216.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2378209899011834956.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality2378209899011834956.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :11 after 78
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :78 after 84825
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :84825 after 1.78549e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.78549e+08 after 5.85024e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5.85024e+08 after 6.62293e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.62293e+08 after 1.26255e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.26255e+09 after 4.10982e+09
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 47123 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 04:09:54] [INFO ] Flatten gal took : 100 ms
[2024-05-21 04:09:54] [INFO ] Applying decomposition
[2024-05-21 04:09:54] [INFO ] Flatten gal took : 119 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2100745891557940075.txt' '-o' '/tmp/graph2100745891557940075.bin' '-w' '/tmp/graph2100745891557940075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2100745891557940075.bin' '-l' '-1' '-v' '-w' '/tmp/graph2100745891557940075.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:09:55] [INFO ] Decomposing Gal with order
[2024-05-21 04:09:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:09:55] [INFO ] Removed a total of 1942 redundant transitions.
[2024-05-21 04:09:55] [INFO ] Flatten gal took : 216 ms
[2024-05-21 04:09:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 32 ms.
[2024-05-21 04:09:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13139205651579319407.gal : 29 ms
[2024-05-21 04:09:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12447912248272258817.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13139205651579319407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12447912248272258817.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12447912248272258817.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 3.63942e+07
Detected timeout of ITS tools.
[2024-05-21 04:39:55] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5964190573960946004
[2024-05-21 04:39:55] [INFO ] Applying decomposition
[2024-05-21 04:39:55] [INFO ] Computing symmetric may disable matrix : 1019 transitions.
[2024-05-21 04:39:55] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 04:39:55] [INFO ] Computing symmetric may enable matrix : 1019 transitions.
[2024-05-21 04:39:55] [INFO ] Flatten gal took : 57 ms
[2024-05-21 04:39:56] [INFO ] Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18092234494799534073.txt' '-o' '/tmp/graph18092234494799534073.bin' '-w' '/tmp/graph18092234494799534073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18092234494799534073.bin' '-l' '-1' '-v' '-w' '/tmp/graph18092234494799534073.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:39:56] [INFO ] Decomposing Gal with order
[2024-05-21 04:39:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:39:56] [INFO ] Computing Do-Not-Accords matrix : 1019 transitions.
[2024-05-21 04:39:56] [INFO ] Removed a total of 1849 redundant transitions.
[2024-05-21 04:39:56] [INFO ] Computation of Completed DNA matrix. took 106 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 04:39:56] [INFO ] Flatten gal took : 205 ms
[2024-05-21 04:39:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 35 ms.
[2024-05-21 04:39:56] [INFO ] Built C files in 703ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5964190573960946004
[2024-05-21 04:39:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12425114029192304503.gal : 19 ms
[2024-05-21 04:39:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2859448002228473930.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12425114029192304503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2859448002228473930.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Running compilation step : cd /tmp/ltsmin5964190573960946004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityCardinality2859448002228473930.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 31
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 39
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :39 after 7.09703e+07
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.72265e+08 after 2.75582e+08
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.75582e+08 after 7.6778e+08
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :7.6778e+08 after 1.47746e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.47746e+09 after 2.3867e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.3867e+09 after 1.48819e+11
Compilation finished in 6756 ms.
Running link step : cd /tmp/ltsmin5964190573960946004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 345 ms.
Running LTSmin : cd /tmp/ltsmin5964190573960946004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT04bReachabilityCardinality202408==true'
Reachability property ASLink-PT-04b-ReachabilityCardinality-2024-08 is true.
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.69515e+12 after 3.51803e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.40122e+13 after 2.81553e+13
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5964190573960946004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT04bReachabilityCardinality202408==true'
Running LTSmin : cd /tmp/ltsmin5964190573960946004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT04bReachabilityCardinality202314==true'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-04b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ASLink-PT-04b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r004-smll-171620117800070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04b.tgz
mv ASLink-PT-04b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;