About the Execution of LTSMin+red for ASLink-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1725.932 | 431506.00 | 554370.00 | 1149.00 | F?FFTFTTFTFFT?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.r464-smll-171620117900135.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 ltsminxred
Input is ASLink-PT-08b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117900135
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 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 1.2M 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-08b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2023-03
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2023-08
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2023-11
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-08b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717229616698
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:13:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:13:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:13:40] [INFO ] Load time of PNML (sax parser for PT used): 653 ms
[2024-06-01 08:13:40] [INFO ] Transformed 3618 places.
[2024-06-01 08:13:40] [INFO ] Transformed 4459 transitions.
[2024-06-01 08:13:40] [INFO ] Found NUPN structural information;
[2024-06-01 08:13:40] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 1050 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (56 resets) in 3218 ms. (12 steps per ms) remains 10/16 properties
FORMULA ASLink-PT-08b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1315 ms. (30 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 733 ms. (54 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 598 ms. (66 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 347 ms. (114 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
// Phase 1: matrix 4459 rows 3618 cols
[2024-06-01 08:13:43] [INFO ] Computed 355 invariants in 289 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 353/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 649/1002 variables, 61/414 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 649/1063 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1002 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 150/1152 variables, 22/1085 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1152 variables, 150/1235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1152 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2439/3591 variables, 267/1502 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3591 variables, 2439/3941 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3591/8077 variables, and 3941 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5067 ms.
Refiners :[Domain max(s): 3591/3618 constraints, Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 267/272 constraints, State Equation: 0/3618 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 353/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 649/1002 variables, 61/414 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 649/1063 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1002 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 150/1152 variables, 22/1085 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1152 variables, 150/1235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1152 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2439/3591 variables, 267/1502 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3591 variables, 2439/3941 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 08:13:56] [INFO ] Deduced a trap composed of 28 places in 3702 ms of which 269 ms to minimize.
SMT process timed out in 13539ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 353 out of 3618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 648 transitions
Trivial Post-agglo rules discarded 648 transitions
Performed 648 trivial Post agglomeration. Transition count delta: 648
Iterating post reduction 0 with 648 rules applied. Total rules applied 648 place count 3618 transition count 3811
Reduce places removed 648 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 1 with 666 rules applied. Total rules applied 1314 place count 2970 transition count 3793
Reduce places removed 4 places and 0 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Iterating post reduction 2 with 63 rules applied. Total rules applied 1377 place count 2966 transition count 3734
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 69 rules applied. Total rules applied 1446 place count 2907 transition count 3724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1448 place count 2905 transition count 3724
Performed 735 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 735 Pre rules applied. Total rules applied 1448 place count 2905 transition count 2989
Deduced a syphon composed of 735 places in 14 ms
Ensure Unique test removed 55 places
Reduce places removed 790 places and 0 transitions.
Iterating global reduction 5 with 1525 rules applied. Total rules applied 2973 place count 2115 transition count 2989
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 5 with 32 rules applied. Total rules applied 3005 place count 2103 transition count 2969
Reduce places removed 20 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 6 with 31 rules applied. Total rules applied 3036 place count 2083 transition count 2958
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 3047 place count 2072 transition count 2958
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 16 Pre rules applied. Total rules applied 3047 place count 2072 transition count 2942
Deduced a syphon composed of 16 places in 16 ms
Ensure Unique test removed 11 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 43 rules applied. Total rules applied 3090 place count 2045 transition count 2942
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 3090 place count 2045 transition count 2932
Deduced a syphon composed of 10 places in 48 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 3110 place count 2035 transition count 2932
Discarding 102 places :
Symmetric choice reduction at 8 with 102 rule applications. Total rules 3212 place count 1933 transition count 2830
Iterating global reduction 8 with 102 rules applied. Total rules applied 3314 place count 1933 transition count 2830
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 23 Pre rules applied. Total rules applied 3314 place count 1933 transition count 2807
Deduced a syphon composed of 23 places in 9 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 3360 place count 1910 transition count 2807
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3362 place count 1908 transition count 2795
Iterating global reduction 8 with 2 rules applied. Total rules applied 3364 place count 1908 transition count 2795
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 8 ms
Ensure Unique test removed 7 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 397 rules applied. Total rules applied 3761 place count 1706 transition count 2600
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3765 place count 1704 transition count 2609
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 3767 place count 1704 transition count 2607
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3769 place count 1703 transition count 2606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3770 place count 1702 transition count 2606
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 3780 place count 1702 transition count 2596
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 3790 place count 1692 transition count 2596
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 11 with 14 rules applied. Total rules applied 3804 place count 1692 transition count 2582
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 3818 place count 1678 transition count 2582
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 12 with 7 rules applied. Total rules applied 3825 place count 1678 transition count 2582
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 3826 place count 1678 transition count 2582
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3827 place count 1677 transition count 2581
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 3 rules applied. Total rules applied 3830 place count 1675 transition count 2580
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3831 place count 1674 transition count 2580
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 3 Pre rules applied. Total rules applied 3831 place count 1674 transition count 2577
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3837 place count 1671 transition count 2577
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 14 with 2 rules applied. Total rules applied 3839 place count 1669 transition count 2577
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3841 place count 1668 transition count 2576
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 3842 place count 1667 transition count 2575
Iterating global reduction 15 with 1 rules applied. Total rules applied 3843 place count 1667 transition count 2575
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 3844 place count 1666 transition count 2574
Iterating global reduction 15 with 1 rules applied. Total rules applied 3845 place count 1666 transition count 2574
Applied a total of 3845 rules in 2696 ms. Remains 1666 /3618 variables (removed 1952) and now considering 2574/4459 (removed 1885) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2712 ms. Remains : 1666/3618 places, 2574/4459 transitions.
RANDOM walk for 40000 steps (161 resets) in 764 ms. (52 steps per ms) remains 9/10 properties
FORMULA ASLink-PT-08b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (21 resets) in 677 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (19 resets) in 297 ms. (134 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (18 resets) in 485 ms. (82 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (16 resets) in 469 ms. (85 steps per ms) remains 8/9 properties
FORMULA ASLink-PT-08b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (16 resets) in 426 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (17 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (18 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (17 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
// Phase 1: matrix 2574 rows 1666 cols
[2024-06-01 08:14:00] [INFO ] Computed 265 invariants in 78 ms
[2024-06-01 08:14:00] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 410/663 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 36/699 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 941/1640 variables, 196/255 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1640 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 3/1643 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1643 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 21/1664 variables, 7/264 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1664 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2573/4237 variables, 1664/1928 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4237 variables, 8/1936 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4237 variables, 0/1936 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 3/4240 variables, 2/1938 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4240 variables, 1/1939 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4240 variables, 0/1939 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/4240 variables, 0/1939 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4240/4240 variables, and 1939 constraints, problems are : Problem set: 0 solved, 8 unsolved in 10197 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 203/203 constraints, State Equation: 1666/1666 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 410/663 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:14:11] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 4 ms to minimize.
[2024-06-01 08:14:11] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/663 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 36/699 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 941/1640 variables, 196/257 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:14:13] [INFO ] Deduced a trap composed of 32 places in 698 ms of which 9 ms to minimize.
[2024-06-01 08:14:13] [INFO ] Deduced a trap composed of 64 places in 459 ms of which 6 ms to minimize.
[2024-06-01 08:14:14] [INFO ] Deduced a trap composed of 30 places in 482 ms of which 20 ms to minimize.
[2024-06-01 08:14:14] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 4 ms to minimize.
[2024-06-01 08:14:15] [INFO ] Deduced a trap composed of 35 places in 738 ms of which 8 ms to minimize.
[2024-06-01 08:14:16] [INFO ] Deduced a trap composed of 79 places in 734 ms of which 9 ms to minimize.
[2024-06-01 08:14:17] [INFO ] Deduced a trap composed of 43 places in 742 ms of which 9 ms to minimize.
[2024-06-01 08:14:17] [INFO ] Deduced a trap composed of 40 places in 722 ms of which 9 ms to minimize.
[2024-06-01 08:14:18] [INFO ] Deduced a trap composed of 45 places in 629 ms of which 9 ms to minimize.
[2024-06-01 08:14:19] [INFO ] Deduced a trap composed of 32 places in 855 ms of which 9 ms to minimize.
[2024-06-01 08:14:20] [INFO ] Deduced a trap composed of 38 places in 838 ms of which 11 ms to minimize.
[2024-06-01 08:14:21] [INFO ] Deduced a trap composed of 33 places in 802 ms of which 9 ms to minimize.
[2024-06-01 08:14:21] [INFO ] Deduced a trap composed of 25 places in 571 ms of which 7 ms to minimize.
[2024-06-01 08:14:22] [INFO ] Deduced a trap composed of 30 places in 579 ms of which 6 ms to minimize.
[2024-06-01 08:14:23] [INFO ] Deduced a trap composed of 58 places in 543 ms of which 6 ms to minimize.
[2024-06-01 08:14:23] [INFO ] Deduced a trap composed of 46 places in 324 ms of which 4 ms to minimize.
[2024-06-01 08:14:24] [INFO ] Deduced a trap composed of 31 places in 536 ms of which 7 ms to minimize.
[2024-06-01 08:14:25] [INFO ] Deduced a trap composed of 79 places in 1173 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1640 variables, 18/275 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:14:27] [INFO ] Deduced a trap composed of 55 places in 436 ms of which 7 ms to minimize.
[2024-06-01 08:14:27] [INFO ] Deduced a trap composed of 29 places in 495 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1640 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1640 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 3/1643 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:14:30] [INFO ] Deduced a trap composed of 58 places in 792 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1643 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:14:31] [INFO ] Deduced a trap composed of 28 places in 339 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1643 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1643 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 21/1664 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1664 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem ASLink-PT-08b-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-08b-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-08b-ReachabilityFireability-2023-08 is UNSAT
FORMULA ASLink-PT-08b-ReachabilityFireability-2023-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-08b-ReachabilityFireability-2023-11 is UNSAT
FORMULA ASLink-PT-08b-ReachabilityFireability-2023-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-08b-ReachabilityFireability-2024-14 is UNSAT
FORMULA ASLink-PT-08b-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 16 (OVERLAPS) 2573/4237 variables, 1664/1952 constraints. Problems are: Problem set: 4 solved, 4 unsolved
SMT process timed out in 55480ms, After SMT, problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 165 out of 1666 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1666/1666 places, 2574/2574 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1666 transition count 2545
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 35 rules applied. Total rules applied 64 place count 1637 transition count 2539
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 69 place count 1632 transition count 2539
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 69 place count 1632 transition count 2443
Deduced a syphon composed of 96 places in 7 ms
Ensure Unique test removed 14 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 275 place count 1522 transition count 2443
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 277 place count 1521 transition count 2442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 278 place count 1520 transition count 2442
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 278 place count 1520 transition count 2436
Deduced a syphon composed of 6 places in 10 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 293 place count 1511 transition count 2436
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 299 place count 1505 transition count 2410
Iterating global reduction 5 with 6 rules applied. Total rules applied 305 place count 1505 transition count 2410
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 306 place count 1504 transition count 2410
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 306 place count 1504 transition count 2409
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 308 place count 1503 transition count 2409
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 386 place count 1463 transition count 2370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 6 with 2 rules applied. Total rules applied 388 place count 1463 transition count 2368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 389 place count 1462 transition count 2368
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 389 place count 1462 transition count 2366
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 393 place count 1460 transition count 2366
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 394 place count 1459 transition count 2366
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 396 place count 1457 transition count 2359
Iterating global reduction 9 with 2 rules applied. Total rules applied 398 place count 1457 transition count 2359
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 402 place count 1455 transition count 2357
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 403 place count 1454 transition count 2356
Iterating global reduction 9 with 1 rules applied. Total rules applied 404 place count 1454 transition count 2356
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 405 place count 1453 transition count 2355
Iterating global reduction 9 with 1 rules applied. Total rules applied 406 place count 1453 transition count 2355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 407 place count 1453 transition count 2354
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 409 place count 1452 transition count 2356
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 410 place count 1452 transition count 2355
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 412 place count 1451 transition count 2354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 413 place count 1450 transition count 2354
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 417 place count 1450 transition count 2350
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 421 place count 1446 transition count 2350
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 424 place count 1446 transition count 2347
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 428 place count 1442 transition count 2347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 428 place count 1442 transition count 2346
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 430 place count 1441 transition count 2346
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 14 with 1 rules applied. Total rules applied 431 place count 1440 transition count 2346
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 15 with 4 rules applied. Total rules applied 435 place count 1438 transition count 2344
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 439 place count 1438 transition count 2344
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 445 place count 1432 transition count 2338
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 447 place count 1430 transition count 2338
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 2 Pre rules applied. Total rules applied 447 place count 1430 transition count 2336
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 451 place count 1428 transition count 2336
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 16 with 1 rules applied. Total rules applied 452 place count 1427 transition count 2336
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 17 with 6 rules applied. Total rules applied 458 place count 1424 transition count 2333
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 459 place count 1423 transition count 2332
Iterating global reduction 17 with 1 rules applied. Total rules applied 460 place count 1423 transition count 2332
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 461 place count 1423 transition count 2331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 462 place count 1422 transition count 2331
Applied a total of 462 rules in 1339 ms. Remains 1422 /1666 variables (removed 244) and now considering 2331/2574 (removed 243) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1339 ms. Remains : 1422/1666 places, 2331/2574 transitions.
RANDOM walk for 40000 steps (208 resets) in 456 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (23 resets) in 707 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (28 resets) in 442 ms. (90 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (27 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (28 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 79518 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 4
Probabilistic random walk after 79518 steps, saw 38157 distinct states, run finished after 3007 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 2331 rows 1422 cols
[2024-06-01 08:15:01] [INFO ] Computed 237 invariants in 39 ms
[2024-06-01 08:15:01] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 326/491 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/504 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 879/1383 variables, 171/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1383 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 16/1399 variables, 9/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1399 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 23/1422 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1422 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2331/3753 variables, 1422/1659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3753 variables, 2/1661 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3753 variables, 0/1661 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3753 variables, 0/1661 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3753/3753 variables, and 1661 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4235 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 180/180 constraints, State Equation: 1422/1422 constraints, ReadFeed: 2/2 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/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 326/491 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/504 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:15:05] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 879/1383 variables, 171/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:15:07] [INFO ] Deduced a trap composed of 38 places in 1246 ms of which 9 ms to minimize.
[2024-06-01 08:15:08] [INFO ] Deduced a trap composed of 56 places in 324 ms of which 5 ms to minimize.
[2024-06-01 08:15:08] [INFO ] Deduced a trap composed of 27 places in 481 ms of which 6 ms to minimize.
[2024-06-01 08:15:08] [INFO ] Deduced a trap composed of 48 places in 266 ms of which 4 ms to minimize.
[2024-06-01 08:15:09] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1383 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1383 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 16/1399 variables, 9/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:15:10] [INFO ] Deduced a trap composed of 50 places in 797 ms of which 8 ms to minimize.
[2024-06-01 08:15:11] [INFO ] Deduced a trap composed of 31 places in 774 ms of which 9 ms to minimize.
[2024-06-01 08:15:12] [INFO ] Deduced a trap composed of 25 places in 839 ms of which 10 ms to minimize.
[2024-06-01 08:15:13] [INFO ] Deduced a trap composed of 36 places in 746 ms of which 8 ms to minimize.
[2024-06-01 08:15:13] [INFO ] Deduced a trap composed of 41 places in 733 ms of which 9 ms to minimize.
[2024-06-01 08:15:14] [INFO ] Deduced a trap composed of 66 places in 703 ms of which 8 ms to minimize.
[2024-06-01 08:15:15] [INFO ] Deduced a trap composed of 45 places in 428 ms of which 5 ms to minimize.
[2024-06-01 08:15:15] [INFO ] Deduced a trap composed of 49 places in 474 ms of which 5 ms to minimize.
[2024-06-01 08:15:16] [INFO ] Deduced a trap composed of 40 places in 601 ms of which 7 ms to minimize.
[2024-06-01 08:15:16] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1399 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:15:17] [INFO ] Deduced a trap composed of 21 places in 676 ms of which 7 ms to minimize.
[2024-06-01 08:15:18] [INFO ] Deduced a trap composed of 36 places in 442 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1399 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1399 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 23/1422 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1422 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ASLink-PT-08b-ReachabilityFireability-2023-03 is UNSAT
FORMULA ASLink-PT-08b-ReachabilityFireability-2023-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 2331/3753 variables, 1422/1677 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3753 variables, 2/1679 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3753 variables, 3/1682 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3753 variables, 0/1682 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/3753 variables, 0/1682 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3753/3753 variables, and 1682 constraints, problems are : Problem set: 1 solved, 3 unsolved in 39229 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 180/180 constraints, State Equation: 1422/1422 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 43597ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8905 ms.
Support contains 121 out of 1422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1422/1422 places, 2331/2331 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1422 transition count 2325
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1416 transition count 2325
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 12 place count 1416 transition count 2305
Deduced a syphon composed of 20 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 54 place count 1394 transition count 2305
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 2 rules applied. Total rules applied 56 place count 1393 transition count 2304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 1392 transition count 2304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 57 place count 1392 transition count 2302
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 61 place count 1390 transition count 2302
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 62 place count 1389 transition count 2302
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 63 place count 1388 transition count 2293
Iterating global reduction 5 with 1 rules applied. Total rules applied 64 place count 1388 transition count 2293
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 65 place count 1387 transition count 2285
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 1387 transition count 2285
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 1386 transition count 2277
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 1386 transition count 2277
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 85 place count 1377 transition count 2269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 87 place count 1377 transition count 2267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 89 place count 1375 transition count 2267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 89 place count 1375 transition count 2266
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 91 place count 1374 transition count 2266
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 92 place count 1373 transition count 2266
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 94 place count 1371 transition count 2264
Ensure Unique test removed 1 places
Iterating global reduction 8 with 3 rules applied. Total rules applied 97 place count 1370 transition count 2264
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 99 place count 1368 transition count 2262
Iterating global reduction 8 with 2 rules applied. Total rules applied 101 place count 1368 transition count 2262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 104 place count 1368 transition count 2259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 105 place count 1367 transition count 2259
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 109 place count 1365 transition count 2257
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 110 place count 1364 transition count 2256
Iterating global reduction 10 with 1 rules applied. Total rules applied 111 place count 1364 transition count 2256
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 114 place count 1364 transition count 2253
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 117 place count 1361 transition count 2253
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 118 place count 1361 transition count 2252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 119 place count 1360 transition count 2252
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 121 place count 1358 transition count 2250
Applied a total of 121 rules in 631 ms. Remains 1358 /1422 variables (removed 64) and now considering 2250/2331 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 631 ms. Remains : 1358/1422 places, 2250/2331 transitions.
RANDOM walk for 40000 steps (270 resets) in 408 ms. (97 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (36 resets) in 503 ms. (79 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (36 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (37 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 109379 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 3
Probabilistic random walk after 109379 steps, saw 36496 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
// Phase 1: matrix 2250 rows 1358 cols
[2024-06-01 08:15:57] [INFO ] Computed 229 invariants in 61 ms
[2024-06-01 08:15:57] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 278/399 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/413 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 855/1268 variables, 157/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1268 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 19/1287 variables, 12/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1287 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 71/1358 variables, 18/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1358 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2250/3608 variables, 1358/1587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3608 variables, 1/1588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3608 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3608 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3608/3608 variables, and 1588 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3625 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 175/175 constraints, State Equation: 1358/1358 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 278/399 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:16:01] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 14/413 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 855/1268 variables, 157/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:16:02] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1268 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1268 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 19/1287 variables, 12/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:16:04] [INFO ] Deduced a trap composed of 21 places in 1330 ms of which 15 ms to minimize.
[2024-06-01 08:16:05] [INFO ] Deduced a trap composed of 33 places in 920 ms of which 10 ms to minimize.
[2024-06-01 08:16:06] [INFO ] Deduced a trap composed of 84 places in 899 ms of which 10 ms to minimize.
[2024-06-01 08:16:06] [INFO ] Deduced a trap composed of 45 places in 635 ms of which 7 ms to minimize.
[2024-06-01 08:16:07] [INFO ] Deduced a trap composed of 53 places in 649 ms of which 7 ms to minimize.
[2024-06-01 08:16:07] [INFO ] Deduced a trap composed of 34 places in 336 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1287 variables, 6/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1287 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 71/1358 variables, 18/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:16:09] [INFO ] Deduced a trap composed of 42 places in 674 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1358 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1358 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2250/3608 variables, 1358/1596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3608 variables, 1/1597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3608 variables, 3/1600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3608 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/3608 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3608/3608 variables, and 1600 constraints, problems are : Problem set: 0 solved, 3 unsolved in 48704 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 175/175 constraints, State Equation: 1358/1358 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 52477ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30003 ms.
Support contains 121 out of 1358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1358/1358 places, 2250/2250 transitions.
Applied a total of 0 rules in 53 ms. Remains 1358 /1358 variables (removed 0) and now considering 2250/2250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1358/1358 places, 2250/2250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1358/1358 places, 2250/2250 transitions.
Applied a total of 0 rules in 50 ms. Remains 1358 /1358 variables (removed 0) and now considering 2250/2250 (removed 0) transitions.
[2024-06-01 08:17:20] [INFO ] Invariant cache hit.
[2024-06-01 08:17:22] [INFO ] Implicit Places using invariants in 1861 ms returned [1, 21, 22, 25, 56, 75, 149, 153, 178, 179, 181, 198, 216, 302, 322, 326, 345, 364, 400, 431, 446, 462, 463, 464, 483, 502, 586, 602, 603, 604, 606, 624, 642, 727, 741, 743, 744, 750, 792, 814, 833, 885, 886, 888, 905, 924, 946, 966, 985, 1018, 1019, 1032, 1033, 1034, 1036, 1054, 1073, 1093, 1112, 1142, 1143, 1152, 1155, 1157, 1159, 1162, 1174, 1175, 1213, 1218, 1237, 1238, 1239, 1254, 1260, 1266, 1272, 1278, 1284, 1290, 1296, 1302, 1308, 1315]
[2024-06-01 08:17:22] [INFO ] Actually due to overlaps returned [56, 181, 198, 345, 483, 624, 905, 1054, 1218, 326, 464, 606, 888, 178, 322, 462, 604, 743, 750, 886, 1033, 1036, 1174, 179, 463, 603, 744, 885, 1034, 1175, 1213, 1237, 1, 21, 302, 446, 586, 727, 1018, 1019, 1157, 75, 216, 364, 502, 602, 642, 741, 1032, 1238, 1284, 1302, 1315, 22, 25, 153, 792, 814, 924, 946, 1073, 1093, 1159, 1162, 1239, 1254, 1260, 1266, 1272, 1278, 1290, 1296, 1308]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 1877 ms to find 73 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1285/1358 places, 2250/2250 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1278 transition count 2156
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 122 rules applied. Total rules applied 223 place count 1184 transition count 2128
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 249 place count 1158 transition count 2128
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 249 place count 1158 transition count 2099
Deduced a syphon composed of 29 places in 6 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 307 place count 1129 transition count 2099
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 318 place count 1118 transition count 2088
Iterating global reduction 3 with 11 rules applied. Total rules applied 329 place count 1118 transition count 2088
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 329 place count 1118 transition count 2087
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 331 place count 1117 transition count 2087
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 334 place count 1114 transition count 2084
Iterating global reduction 3 with 3 rules applied. Total rules applied 337 place count 1114 transition count 2084
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 340 place count 1111 transition count 2078
Iterating global reduction 3 with 3 rules applied. Total rules applied 343 place count 1111 transition count 2078
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 6 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 467 place count 1049 transition count 2016
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 468 place count 1048 transition count 2014
Iterating global reduction 3 with 1 rules applied. Total rules applied 469 place count 1048 transition count 2014
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 470 place count 1048 transition count 2013
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 471 place count 1047 transition count 2013
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 4 with 23 rules applied. Total rules applied 494 place count 1047 transition count 1990
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 517 place count 1024 transition count 1990
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 518 place count 1024 transition count 1989
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 530 place count 1024 transition count 1989
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 534 place count 1024 transition count 1989
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 536 place count 1022 transition count 1987
Iterating global reduction 5 with 2 rules applied. Total rules applied 538 place count 1022 transition count 1987
Applied a total of 538 rules in 842 ms. Remains 1022 /1285 variables (removed 263) and now considering 1987/2250 (removed 263) transitions.
// Phase 1: matrix 1987 rows 1022 cols
[2024-06-01 08:17:22] [INFO ] Computed 149 invariants in 29 ms
[2024-06-01 08:17:24] [INFO ] Implicit Places using invariants in 1499 ms returned [110, 116, 119, 135, 225, 235, 244, 245, 327, 340, 343, 432, 443, 445, 460, 461, 533, 540, 543, 545, 553, 655, 665, 671, 680, 681, 770, 773, 865, 874, 875, 881, 884, 990]
[2024-06-01 08:17:24] [INFO ] Actually due to overlaps returned [135, 244, 460, 680, 461, 245, 681, 110, 116, 432, 445, 533, 540, 545, 665, 773, 119, 225, 235, 327, 340, 343, 553, 655, 671, 865, 874, 881, 990]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 1503 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 993/1358 places, 1987/2250 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 980 transition count 1974
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 980 transition count 1974
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 975 transition count 1969
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 975 transition count 1969
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 973 transition count 1967
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 973 transition count 1967
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 972 transition count 1966
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 972 transition count 1966
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 971 transition count 1965
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 971 transition count 1965
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 965 transition count 1959
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 965 transition count 1958
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 69 place count 965 transition count 1946
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 81 place count 953 transition count 1946
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 953 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 952 transition count 1945
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 952 transition count 1945
Applied a total of 85 rules in 439 ms. Remains 952 /993 variables (removed 41) and now considering 1945/1987 (removed 42) transitions.
// Phase 1: matrix 1945 rows 952 cols
[2024-06-01 08:17:24] [INFO ] Computed 120 invariants in 27 ms
[2024-06-01 08:17:25] [INFO ] Implicit Places using invariants in 1158 ms returned [807, 815]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1160 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 950/1358 places, 1945/2250 transitions.
Applied a total of 0 rules in 40 ms. Remains 950 /950 variables (removed 0) and now considering 1945/1945 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 5912 ms. Remains : 950/1358 places, 1945/2250 transitions.
RANDOM walk for 40000 steps (334 resets) in 300 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (49 resets) in 460 ms. (86 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (50 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (54 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 192028 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 3
Probabilistic random walk after 192028 steps, saw 35305 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 1945 rows 950 cols
[2024-06-01 08:17:29] [INFO ] Computed 118 invariants in 22 ms
[2024-06-01 08:17:29] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 220/341 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/342 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 593/935 variables, 86/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/943 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/943 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/950 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/950 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1945/2895 variables, 950/1068 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2895 variables, 6/1074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2895 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/2895 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2895/2895 variables, and 1074 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2717 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 950/950 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 220/341 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/342 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 593/935 variables, 86/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:17:33] [INFO ] Deduced a trap composed of 25 places in 1171 ms of which 13 ms to minimize.
[2024-06-01 08:17:34] [INFO ] Deduced a trap composed of 52 places in 654 ms of which 7 ms to minimize.
[2024-06-01 08:17:34] [INFO ] Deduced a trap composed of 42 places in 267 ms of which 4 ms to minimize.
[2024-06-01 08:17:35] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 8/943 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/943 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 7/950 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:17:35] [INFO ] Deduced a trap composed of 34 places in 489 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/950 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/950 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1945/2895 variables, 950/1073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2895 variables, 6/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2895 variables, 3/1082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:17:55] [INFO ] Deduced a trap composed of 46 places in 402 ms of which 4 ms to minimize.
[2024-06-01 08:17:55] [INFO ] Deduced a trap composed of 27 places in 327 ms of which 4 ms to minimize.
[2024-06-01 08:17:56] [INFO ] Deduced a trap composed of 29 places in 448 ms of which 5 ms to minimize.
[2024-06-01 08:17:56] [INFO ] Deduced a trap composed of 26 places in 397 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2895 variables, 4/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2895 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/2895 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2895/2895 variables, and 1086 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27964 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 950/950 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 30767ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 20126 ms.
Support contains 121 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 1945/1945 transitions.
Applied a total of 0 rules in 35 ms. Remains 950 /950 variables (removed 0) and now considering 1945/1945 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 950/950 places, 1945/1945 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 1945/1945 transitions.
Applied a total of 0 rules in 34 ms. Remains 950 /950 variables (removed 0) and now considering 1945/1945 (removed 0) transitions.
[2024-06-01 08:18:20] [INFO ] Invariant cache hit.
[2024-06-01 08:18:21] [INFO ] Implicit Places using invariants in 1453 ms returned []
[2024-06-01 08:18:21] [INFO ] Invariant cache hit.
[2024-06-01 08:18:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 08:18:26] [INFO ] Implicit Places using invariants and state equation in 4889 ms returned []
Implicit Place search using SMT with State Equation took 6349 ms to find 0 implicit places.
[2024-06-01 08:18:26] [INFO ] Redundant transitions in 202 ms returned []
Running 1921 sub problems to find dead transitions.
[2024-06-01 08:18:26] [INFO ] Invariant cache hit.
[2024-06-01 08:18:27] [INFO ] State equation strengthened by 6 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.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 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.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 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.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 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 1.0)
(s619 0.0)
(s620 1.0)
(s621 1.0)
(s622 0.0)
(s623 1.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 1.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 0.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/944 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1921 unsolved
SMT process timed out in 31619ms, After SMT, problems are : Problem set: 0 solved, 1921 unsolved
Search for dead transitions found 0 dead transitions in 31666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38284 ms. Remains : 950/950 places, 1945/1945 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 4719 edges and 950 vertex of which 949 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 949 transition count 1935
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 939 transition count 1935
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 23 place count 937 transition count 1935
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 23 place count 937 transition count 1934
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 936 transition count 1934
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 934 transition count 1932
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 934 transition count 1931
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 933 transition count 1931
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 933 transition count 1930
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 932 transition count 1930
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 932 transition count 1930
Applied a total of 34 rules in 187 ms. Remains 932 /950 variables (removed 18) and now considering 1930/1945 (removed 15) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1930 rows 932 cols
[2024-06-01 08:18:58] [INFO ] Computed 115 invariants in 41 ms
[2024-06-01 08:18:59] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 08:18:59] [INFO ] [Nat]Absence check using 28 positive place invariants in 20 ms returned sat
[2024-06-01 08:18:59] [INFO ] [Nat]Absence check using 28 positive and 87 generalized place invariants in 72 ms returned sat
[2024-06-01 08:19:10] [INFO ] After 10835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-01 08:19:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 08:19:16] [INFO ] After 5823ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 08:19:23] [INFO ] Deduced a trap composed of 28 places in 387 ms of which 5 ms to minimize.
[2024-06-01 08:19:24] [INFO ] Deduced a trap composed of 33 places in 363 ms of which 5 ms to minimize.
[2024-06-01 08:19:38] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 4 ms to minimize.
[2024-06-01 08:19:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 15271 ms
[2024-06-01 08:19:39] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-06-01 08:19:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
TRAPS : Iteration 1
[2024-06-01 08:19:47] [INFO ] Deduced a trap composed of 26 places in 1036 ms of which 11 ms to minimize.
[2024-06-01 08:19:49] [INFO ] Deduced a trap composed of 29 places in 951 ms of which 10 ms to minimize.
[2024-06-01 08:19:49] [INFO ] Deduced a trap composed of 34 places in 568 ms of which 7 ms to minimize.
[2024-06-01 08:19:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3094 ms
[2024-06-01 08:19:54] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2024-06-01 08:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
TRAPS : Iteration 2
[2024-06-01 08:20:25] [INFO ] After 74665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 08:20:46] [INFO ] After 107683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 108236 ms.
[2024-06-01 08:20:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-06-01 08:20:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 950 places, 1945 transitions and 7709 arcs took 26 ms.
[2024-06-01 08:20:47] [INFO ] Flatten gal took : 419 ms
Total runtime 428473 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ASLink-PT-08b-ReachabilityFireability-2024-01
Could not compute solution for formula : ASLink-PT-08b-ReachabilityFireability-2024-13
Could not compute solution for formula : ASLink-PT-08b-ReachabilityFireability-2024-15
BK_STOP 1717230048204
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ASLink-PT-08b-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/843/inv_0_
rfs formula name ASLink-PT-08b-ReachabilityFireability-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/843/inv_1_
rfs formula name ASLink-PT-08b-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/843/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-08b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-08b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117900135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08b.tgz
mv ASLink-PT-08b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;