Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r010-oct2-167813598600085.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ASLink-PT-05b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598600085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 795K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-05b-UpperBounds-00
FORMULA_NAME ASLink-PT-05b-UpperBounds-01
FORMULA_NAME ASLink-PT-05b-UpperBounds-02
FORMULA_NAME ASLink-PT-05b-UpperBounds-03
FORMULA_NAME ASLink-PT-05b-UpperBounds-04
FORMULA_NAME ASLink-PT-05b-UpperBounds-05
FORMULA_NAME ASLink-PT-05b-UpperBounds-06
FORMULA_NAME ASLink-PT-05b-UpperBounds-07
FORMULA_NAME ASLink-PT-05b-UpperBounds-08
FORMULA_NAME ASLink-PT-05b-UpperBounds-09
FORMULA_NAME ASLink-PT-05b-UpperBounds-10
FORMULA_NAME ASLink-PT-05b-UpperBounds-11
FORMULA_NAME ASLink-PT-05b-UpperBounds-12
FORMULA_NAME ASLink-PT-05b-UpperBounds-13
FORMULA_NAME ASLink-PT-05b-UpperBounds-14
FORMULA_NAME ASLink-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678662939903

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 23:15:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 23:15:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:15:42] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-12 23:15:42] [INFO ] Transformed 2430 places.
[2023-03-12 23:15:42] [INFO ] Transformed 3040 transitions.
[2023-03-12 23:15:42] [INFO ] Found NUPN structural information;
[2023-03-12 23:15:42] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
// Phase 1: matrix 3040 rows 2430 cols
[2023-03-12 23:15:42] [INFO ] Computed 238 place invariants in 144 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 16) seen :13
FORMULA ASLink-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
[2023-03-12 23:15:42] [INFO ] Invariant cache hit.
[2023-03-12 23:15:43] [INFO ] [Real]Absence check using 56 positive place invariants in 111 ms returned sat
[2023-03-12 23:15:43] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 123 ms returned sat
[2023-03-12 23:15:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:15:45] [INFO ] [Real]Absence check using state equation in 2049 ms returned sat
[2023-03-12 23:15:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:15:46] [INFO ] [Nat]Absence check using 56 positive place invariants in 89 ms returned sat
[2023-03-12 23:15:46] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 115 ms returned sat
[2023-03-12 23:15:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:15:51] [INFO ] [Nat]Absence check using state equation in 4469 ms returned unknown
[2023-03-12 23:15:51] [INFO ] [Real]Absence check using 56 positive place invariants in 44 ms returned sat
[2023-03-12 23:15:51] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 202 ms returned sat
[2023-03-12 23:15:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:15:53] [INFO ] [Real]Absence check using state equation in 1729 ms returned sat
[2023-03-12 23:15:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:15:54] [INFO ] [Nat]Absence check using 56 positive place invariants in 71 ms returned sat
[2023-03-12 23:15:54] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 121 ms returned sat
[2023-03-12 23:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:15:58] [INFO ] [Nat]Absence check using state equation in 4465 ms returned unknown
[2023-03-12 23:15:59] [INFO ] [Real]Absence check using 56 positive place invariants in 41 ms returned sat
[2023-03-12 23:15:59] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 99 ms returned sat
[2023-03-12 23:15:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:16:02] [INFO ] [Real]Absence check using state equation in 2985 ms returned sat
[2023-03-12 23:16:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:16:03] [INFO ] [Nat]Absence check using 56 positive place invariants in 145 ms returned sat
[2023-03-12 23:16:03] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 75 ms returned sat
[2023-03-12 23:16:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:16:07] [INFO ] [Nat]Absence check using state equation in 4358 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 2430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 2430 transition count 2479
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 587 rules applied. Total rules applied 1148 place count 1869 transition count 2453
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1156 place count 1862 transition count 2452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1157 place count 1861 transition count 2452
Performed 562 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 562 Pre rules applied. Total rules applied 1157 place count 1861 transition count 1890
Deduced a syphon composed of 562 places in 12 ms
Ensure Unique test removed 53 places
Reduce places removed 615 places and 0 transitions.
Iterating global reduction 4 with 1177 rules applied. Total rules applied 2334 place count 1246 transition count 1890
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 40 rules applied. Total rules applied 2374 place count 1240 transition count 1856
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 35 rules applied. Total rules applied 2409 place count 1206 transition count 1855
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2410 place count 1205 transition count 1855
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2410 place count 1205 transition count 1835
Deduced a syphon composed of 20 places in 8 ms
Ensure Unique test removed 19 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 59 rules applied. Total rules applied 2469 place count 1166 transition count 1835
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 2469 place count 1166 transition count 1816
Deduced a syphon composed of 19 places in 6 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2507 place count 1147 transition count 1816
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2584 place count 1070 transition count 1739
Iterating global reduction 7 with 77 rules applied. Total rules applied 2661 place count 1070 transition count 1739
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2662 place count 1070 transition count 1738
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 26 Pre rules applied. Total rules applied 2662 place count 1070 transition count 1712
Deduced a syphon composed of 26 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 53 rules applied. Total rules applied 2715 place count 1043 transition count 1712
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2715 place count 1043 transition count 1711
Deduced a syphon composed of 1 places in 19 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2718 place count 1041 transition count 1711
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 2724 place count 1035 transition count 1672
Iterating global reduction 8 with 6 rules applied. Total rules applied 2730 place count 1035 transition count 1672
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 2730 place count 1035 transition count 1667
Deduced a syphon composed of 5 places in 19 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 2740 place count 1030 transition count 1667
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2741 place count 1029 transition count 1659
Iterating global reduction 8 with 1 rules applied. Total rules applied 2742 place count 1029 transition count 1659
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2743 place count 1028 transition count 1651
Iterating global reduction 8 with 1 rules applied. Total rules applied 2744 place count 1028 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2745 place count 1027 transition count 1643
Iterating global reduction 8 with 1 rules applied. Total rules applied 2746 place count 1027 transition count 1643
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2747 place count 1026 transition count 1635
Iterating global reduction 8 with 1 rules applied. Total rules applied 2748 place count 1026 transition count 1635
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2749 place count 1025 transition count 1627
Iterating global reduction 8 with 1 rules applied. Total rules applied 2750 place count 1025 transition count 1627
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2751 place count 1024 transition count 1619
Iterating global reduction 8 with 1 rules applied. Total rules applied 2752 place count 1024 transition count 1619
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2753 place count 1023 transition count 1611
Iterating global reduction 8 with 1 rules applied. Total rules applied 2754 place count 1023 transition count 1611
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2755 place count 1022 transition count 1603
Iterating global reduction 8 with 1 rules applied. Total rules applied 2756 place count 1022 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2757 place count 1021 transition count 1595
Iterating global reduction 8 with 1 rules applied. Total rules applied 2758 place count 1021 transition count 1595
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2759 place count 1020 transition count 1587
Iterating global reduction 8 with 1 rules applied. Total rules applied 2760 place count 1020 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2761 place count 1019 transition count 1579
Iterating global reduction 8 with 1 rules applied. Total rules applied 2762 place count 1019 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2763 place count 1018 transition count 1571
Iterating global reduction 8 with 1 rules applied. Total rules applied 2764 place count 1018 transition count 1571
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2765 place count 1017 transition count 1563
Iterating global reduction 8 with 1 rules applied. Total rules applied 2766 place count 1017 transition count 1563
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2767 place count 1016 transition count 1555
Iterating global reduction 8 with 1 rules applied. Total rules applied 2768 place count 1016 transition count 1555
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2769 place count 1015 transition count 1547
Iterating global reduction 8 with 1 rules applied. Total rules applied 2770 place count 1015 transition count 1547
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2771 place count 1014 transition count 1539
Iterating global reduction 8 with 1 rules applied. Total rules applied 2772 place count 1014 transition count 1539
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 2 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 8 with 276 rules applied. Total rules applied 3048 place count 876 transition count 1401
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3049 place count 875 transition count 1400
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 3051 place count 874 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3052 place count 873 transition count 1399
Iterating global reduction 8 with 1 rules applied. Total rules applied 3053 place count 873 transition count 1399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3055 place count 873 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3056 place count 872 transition count 1397
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3058 place count 871 transition count 1406
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 3064 place count 871 transition count 1400
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3070 place count 865 transition count 1400
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 3074 place count 865 transition count 1396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 3078 place count 861 transition count 1396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3079 place count 860 transition count 1395
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 3094 place count 850 transition count 1390
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 3099 place count 845 transition count 1390
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 14 Pre rules applied. Total rules applied 3099 place count 845 transition count 1376
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 14 with 29 rules applied. Total rules applied 3128 place count 830 transition count 1376
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 3134 place count 824 transition count 1376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3134 place count 824 transition count 1375
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3136 place count 823 transition count 1375
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 3158 place count 812 transition count 1364
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 3163 place count 807 transition count 1359
Iterating global reduction 15 with 5 rules applied. Total rules applied 3168 place count 807 transition count 1359
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 3173 place count 807 transition count 1354
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 3178 place count 802 transition count 1354
Applied a total of 3178 rules in 1935 ms. Remains 802 /2430 variables (removed 1628) and now considering 1354/3040 (removed 1686) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1935 ms. Remains : 802/2430 places, 1354/3040 transitions.
// Phase 1: matrix 1354 rows 802 cols
[2023-03-12 23:16:09] [INFO ] Computed 140 place invariants in 43 ms
Incomplete random walk after 1000000 steps, including 12041 resets, run finished after 2612 ms. (steps per millisecond=382 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2283 resets, run finished after 1112 ms. (steps per millisecond=899 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2307 resets, run finished after 1155 ms. (steps per millisecond=865 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2310 resets, run finished after 1137 ms. (steps per millisecond=879 ) properties (out of 3) seen :0
[2023-03-12 23:16:15] [INFO ] Invariant cache hit.
[2023-03-12 23:16:15] [INFO ] [Real]Absence check using 38 positive place invariants in 66 ms returned sat
[2023-03-12 23:16:15] [INFO ] [Real]Absence check using 38 positive and 102 generalized place invariants in 105 ms returned sat
[2023-03-12 23:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:16:16] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2023-03-12 23:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:16:16] [INFO ] [Nat]Absence check using 38 positive place invariants in 13 ms returned sat
[2023-03-12 23:16:16] [INFO ] [Nat]Absence check using 38 positive and 102 generalized place invariants in 40 ms returned sat
[2023-03-12 23:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:16:16] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2023-03-12 23:16:17] [INFO ] Computed and/alt/rep : 528/2024/528 causal constraints (skipped 797 transitions) in 150 ms.
[2023-03-12 23:16:30] [INFO ] Added : 305 causal constraints over 61 iterations in 13928 ms. Result :unknown
[2023-03-12 23:16:31] [INFO ] [Real]Absence check using 38 positive place invariants in 10 ms returned sat
[2023-03-12 23:16:31] [INFO ] [Real]Absence check using 38 positive and 102 generalized place invariants in 61 ms returned sat
[2023-03-12 23:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:16:31] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2023-03-12 23:16:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:16:32] [INFO ] [Nat]Absence check using 38 positive place invariants in 11 ms returned sat
[2023-03-12 23:16:32] [INFO ] [Nat]Absence check using 38 positive and 102 generalized place invariants in 17 ms returned sat
[2023-03-12 23:16:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:16:32] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2023-03-12 23:16:32] [INFO ] Computed and/alt/rep : 528/2024/528 causal constraints (skipped 797 transitions) in 120 ms.
[2023-03-12 23:16:41] [INFO ] Added : 437 causal constraints over 88 iterations in 8792 ms. Result :sat
Minimization took 375 ms.
[2023-03-12 23:16:42] [INFO ] [Real]Absence check using 38 positive place invariants in 12 ms returned sat
[2023-03-12 23:16:42] [INFO ] [Real]Absence check using 38 positive and 102 generalized place invariants in 32 ms returned sat
[2023-03-12 23:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:16:42] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2023-03-12 23:16:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:16:42] [INFO ] [Nat]Absence check using 38 positive place invariants in 11 ms returned sat
[2023-03-12 23:16:42] [INFO ] [Nat]Absence check using 38 positive and 102 generalized place invariants in 29 ms returned sat
[2023-03-12 23:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:16:43] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2023-03-12 23:16:43] [INFO ] Deduced a trap composed of 106 places in 291 ms of which 3 ms to minimize.
[2023-03-12 23:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2023-03-12 23:16:43] [INFO ] Computed and/alt/rep : 528/2024/528 causal constraints (skipped 797 transitions) in 88 ms.
[2023-03-12 23:16:51] [INFO ] Added : 337 causal constraints over 68 iterations in 7884 ms. Result :sat
Minimization took 428 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1354/1354 transitions.
Applied a total of 0 rules in 34 ms. Remains 802 /802 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 802/802 places, 1354/1354 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1354/1354 transitions.
Applied a total of 0 rules in 30 ms. Remains 802 /802 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
[2023-03-12 23:16:55] [INFO ] Invariant cache hit.
[2023-03-12 23:16:56] [INFO ] Implicit Places using invariants in 710 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 256, 260, 261, 272, 273, 275, 292, 310, 385, 386, 397, 398, 400, 417, 435, 505, 509, 510, 521, 522, 524, 541, 559, 628, 632, 633, 636, 647, 648, 649, 667, 669, 673, 691, 692, 693, 694, 706, 712, 718, 724, 730, 736, 742, 748, 754, 760, 766]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 727 ms to find 61 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 741/802 places, 1354/1354 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 741 transition count 1246
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 114 rules applied. Total rules applied 222 place count 633 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 632 transition count 1240
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 223 place count 632 transition count 1213
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 278 place count 604 transition count 1213
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 290 place count 600 transition count 1205
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 298 place count 592 transition count 1205
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 313 place count 577 transition count 1190
Iterating global reduction 5 with 15 rules applied. Total rules applied 328 place count 577 transition count 1190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 331 place count 577 transition count 1187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 331 place count 577 transition count 1186
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 333 place count 576 transition count 1186
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 336 place count 573 transition count 1180
Iterating global reduction 6 with 3 rules applied. Total rules applied 339 place count 573 transition count 1180
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 340 place count 572 transition count 1179
Iterating global reduction 6 with 1 rules applied. Total rules applied 341 place count 572 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 342 place count 571 transition count 1177
Iterating global reduction 6 with 1 rules applied. Total rules applied 343 place count 571 transition count 1177
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 423 place count 531 transition count 1137
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 427 place count 527 transition count 1133
Iterating global reduction 6 with 4 rules applied. Total rules applied 431 place count 527 transition count 1133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 435 place count 527 transition count 1129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 439 place count 525 transition count 1130
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 7 with 12 rules applied. Total rules applied 451 place count 525 transition count 1118
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 464 place count 512 transition count 1118
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 479 place count 512 transition count 1118
Applied a total of 479 rules in 297 ms. Remains 512 /741 variables (removed 229) and now considering 1118/1354 (removed 236) transitions.
// Phase 1: matrix 1118 rows 512 cols
[2023-03-12 23:16:56] [INFO ] Computed 73 place invariants in 8 ms
[2023-03-12 23:16:56] [INFO ] Implicit Places using invariants in 369 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 175, 181, 184, 186, 191, 192, 261, 267, 270, 272, 275, 280, 281, 333, 351, 357, 360, 362, 367, 368, 420, 437, 443, 446, 448]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 371 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 479/802 places, 1118/1354 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 463 transition count 1102
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 463 transition count 1102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 458 transition count 1097
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 458 transition count 1097
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 60 place count 449 transition count 1088
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 449 transition count 1087
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 76 place count 449 transition count 1072
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 91 place count 434 transition count 1072
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 434 transition count 1068
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 99 place count 430 transition count 1068
Applied a total of 99 rules in 80 ms. Remains 430 /479 variables (removed 49) and now considering 1068/1118 (removed 50) transitions.
// Phase 1: matrix 1068 rows 430 cols
[2023-03-12 23:16:57] [INFO ] Computed 40 place invariants in 8 ms
[2023-03-12 23:16:57] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-12 23:16:57] [INFO ] Invariant cache hit.
[2023-03-12 23:16:58] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 430/802 places, 1068/1354 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2727 ms. Remains : 430/802 places, 1068/1354 transitions.
Successfully produced net in file /tmp/petri1000_6021965471750705436.dot
Successfully produced net in file /tmp/petri1001_17988684539385845191.dot
Successfully produced net in file /tmp/petri1002_12839937691769365491.dot
Successfully produced net in file /tmp/petri1003_6916315544096512969.dot
Successfully produced net in file /tmp/petri1004_3274386065213678719.dot
Drop transitions removed 5 transitions
Dominated transitions for bounds rules discarded 5 transitions
// Phase 1: matrix 1063 rows 430 cols
[2023-03-12 23:16:58] [INFO ] Computed 40 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 18401 resets, run finished after 1806 ms. (steps per millisecond=553 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4466 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4448 resets, run finished after 675 ms. (steps per millisecond=1481 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4471 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties (out of 3) seen :0
[2023-03-12 23:17:02] [INFO ] Invariant cache hit.
[2023-03-12 23:17:02] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:02] [INFO ] [Real]Absence check using 10 positive and 30 generalized place invariants in 20 ms returned sat
[2023-03-12 23:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:02] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2023-03-12 23:17:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:17:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 23:17:02] [INFO ] [Nat]Absence check using 10 positive and 30 generalized place invariants in 17 ms returned sat
[2023-03-12 23:17:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:03] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2023-03-12 23:17:03] [INFO ] Computed and/alt/rep : 237/1130/237 causal constraints (skipped 797 transitions) in 83 ms.
[2023-03-12 23:17:03] [INFO ] Added : 7 causal constraints over 2 iterations in 295 ms. Result :sat
Minimization took 155 ms.
[2023-03-12 23:17:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:03] [INFO ] [Real]Absence check using 10 positive and 30 generalized place invariants in 20 ms returned sat
[2023-03-12 23:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:03] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-12 23:17:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:17:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:04] [INFO ] [Nat]Absence check using 10 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-12 23:17:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:04] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2023-03-12 23:17:04] [INFO ] Computed and/alt/rep : 237/1130/237 causal constraints (skipped 797 transitions) in 89 ms.
[2023-03-12 23:17:05] [INFO ] Added : 33 causal constraints over 7 iterations in 1272 ms. Result :sat
Minimization took 158 ms.
[2023-03-12 23:17:06] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:06] [INFO ] [Real]Absence check using 10 positive and 30 generalized place invariants in 23 ms returned sat
[2023-03-12 23:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:06] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2023-03-12 23:17:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:17:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:06] [INFO ] [Nat]Absence check using 10 positive and 30 generalized place invariants in 7 ms returned sat
[2023-03-12 23:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:07] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2023-03-12 23:17:07] [INFO ] Computed and/alt/rep : 237/1130/237 causal constraints (skipped 797 transitions) in 92 ms.
[2023-03-12 23:17:07] [INFO ] Added : 28 causal constraints over 6 iterations in 660 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA ASLink-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1063/1063 transitions.
Graph (complete) has 2612 edges and 430 vertex of which 425 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 425 transition count 1062
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 424 transition count 1062
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 424 transition count 1062
Applied a total of 8 rules in 46 ms. Remains 424 /430 variables (removed 6) and now considering 1062/1063 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 424/430 places, 1062/1063 transitions.
// Phase 1: matrix 1062 rows 424 cols
[2023-03-12 23:17:08] [INFO ] Computed 40 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 18437 resets, run finished after 1771 ms. (steps per millisecond=564 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4470 resets, run finished after 694 ms. (steps per millisecond=1440 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4464 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 2) seen :0
[2023-03-12 23:17:11] [INFO ] Invariant cache hit.
[2023-03-12 23:17:11] [INFO ] [Real]Absence check using 10 positive place invariants in 37 ms returned sat
[2023-03-12 23:17:11] [INFO ] [Real]Absence check using 10 positive and 30 generalized place invariants in 11 ms returned sat
[2023-03-12 23:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:11] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2023-03-12 23:17:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:17:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-12 23:17:12] [INFO ] [Nat]Absence check using 10 positive and 30 generalized place invariants in 17 ms returned sat
[2023-03-12 23:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:12] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-12 23:17:12] [INFO ] Computed and/alt/rep : 236/1127/236 causal constraints (skipped 797 transitions) in 71 ms.
[2023-03-12 23:17:13] [INFO ] Added : 25 causal constraints over 6 iterations in 618 ms. Result :sat
Minimization took 156 ms.
[2023-03-12 23:17:13] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:13] [INFO ] [Real]Absence check using 10 positive and 30 generalized place invariants in 54 ms returned sat
[2023-03-12 23:17:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:13] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-12 23:17:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:17:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-12 23:17:13] [INFO ] [Nat]Absence check using 10 positive and 30 generalized place invariants in 14 ms returned sat
[2023-03-12 23:17:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:14] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2023-03-12 23:17:14] [INFO ] Computed and/alt/rep : 236/1127/236 causal constraints (skipped 797 transitions) in 74 ms.
[2023-03-12 23:17:14] [INFO ] Added : 18 causal constraints over 4 iterations in 497 ms. Result :sat
Minimization took 155 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1062/1062 transitions.
Applied a total of 0 rules in 16 ms. Remains 424 /424 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 424/424 places, 1062/1062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1062/1062 transitions.
Applied a total of 0 rules in 12 ms. Remains 424 /424 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
[2023-03-12 23:17:15] [INFO ] Invariant cache hit.
[2023-03-12 23:17:15] [INFO ] Implicit Places using invariants in 324 ms returned [223]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 337 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 423/424 places, 1062/1062 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 1061
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 422 transition count 1060
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 421 transition count 1060
Applied a total of 4 rules in 57 ms. Remains 421 /423 variables (removed 2) and now considering 1060/1062 (removed 2) transitions.
// Phase 1: matrix 1060 rows 421 cols
[2023-03-12 23:17:15] [INFO ] Computed 39 place invariants in 7 ms
[2023-03-12 23:17:15] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-12 23:17:15] [INFO ] Invariant cache hit.
[2023-03-12 23:17:16] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 421/424 places, 1060/1062 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1534 ms. Remains : 421/424 places, 1060/1062 transitions.
[2023-03-12 23:17:16] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 18417 resets, run finished after 1715 ms. (steps per millisecond=583 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4486 resets, run finished after 723 ms. (steps per millisecond=1383 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4446 resets, run finished after 714 ms. (steps per millisecond=1400 ) properties (out of 2) seen :0
[2023-03-12 23:17:19] [INFO ] Invariant cache hit.
[2023-03-12 23:17:20] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-12 23:17:20] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 44 ms returned sat
[2023-03-12 23:17:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:20] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2023-03-12 23:17:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:17:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:20] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 18 ms returned sat
[2023-03-12 23:17:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:20] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2023-03-12 23:17:21] [INFO ] Computed and/alt/rep : 227/1054/227 causal constraints (skipped 804 transitions) in 75 ms.
[2023-03-12 23:17:21] [INFO ] Added : 37 causal constraints over 10 iterations in 869 ms. Result :sat
Minimization took 275 ms.
[2023-03-12 23:17:22] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:22] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-12 23:17:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:22] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-12 23:17:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:17:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:22] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-12 23:17:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:22] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2023-03-12 23:17:23] [INFO ] Computed and/alt/rep : 227/1054/227 causal constraints (skipped 804 transitions) in 61 ms.
[2023-03-12 23:17:23] [INFO ] Added : 30 causal constraints over 7 iterations in 809 ms. Result :sat
Minimization took 131 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1060/1060 transitions.
Applied a total of 0 rules in 14 ms. Remains 421 /421 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 421/421 places, 1060/1060 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1060/1060 transitions.
Applied a total of 0 rules in 12 ms. Remains 421 /421 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
[2023-03-12 23:17:24] [INFO ] Invariant cache hit.
[2023-03-12 23:17:24] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-12 23:17:24] [INFO ] Invariant cache hit.
[2023-03-12 23:17:25] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
[2023-03-12 23:17:25] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-12 23:17:25] [INFO ] Invariant cache hit.
[2023-03-12 23:17:25] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1596 ms. Remains : 421/421 places, 1060/1060 transitions.
Starting property specific reduction for ASLink-PT-05b-UpperBounds-01
[2023-03-12 23:17:25] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 181 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-12 23:17:25] [INFO ] Invariant cache hit.
[2023-03-12 23:17:25] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:25] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-12 23:17:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:26] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2023-03-12 23:17:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:17:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-12 23:17:26] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 21 ms returned sat
[2023-03-12 23:17:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:26] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2023-03-12 23:17:26] [INFO ] Computed and/alt/rep : 227/1054/227 causal constraints (skipped 804 transitions) in 77 ms.
[2023-03-12 23:17:27] [INFO ] Added : 37 causal constraints over 10 iterations in 856 ms. Result :sat
Minimization took 257 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1060/1060 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 421 transition count 1059
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 420 transition count 1059
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 420 transition count 1058
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 419 transition count 1058
Applied a total of 4 rules in 18 ms. Remains 419 /421 variables (removed 2) and now considering 1058/1060 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 419/421 places, 1058/1060 transitions.
// Phase 1: matrix 1058 rows 419 cols
[2023-03-12 23:17:28] [INFO ] Computed 39 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 18426 resets, run finished after 1809 ms. (steps per millisecond=552 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4506 resets, run finished after 728 ms. (steps per millisecond=1373 ) properties (out of 1) seen :0
[2023-03-12 23:17:30] [INFO ] Invariant cache hit.
[2023-03-12 23:17:30] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-12 23:17:30] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 22 ms returned sat
[2023-03-12 23:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:31] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2023-03-12 23:17:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:17:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:31] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-12 23:17:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:31] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2023-03-12 23:17:31] [INFO ] Computed and/alt/rep : 225/1052/225 causal constraints (skipped 804 transitions) in 75 ms.
[2023-03-12 23:17:32] [INFO ] Added : 22 causal constraints over 5 iterations in 659 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1058/1058 transitions.
Applied a total of 0 rules in 14 ms. Remains 419 /419 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 419/419 places, 1058/1058 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1058/1058 transitions.
Applied a total of 0 rules in 14 ms. Remains 419 /419 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
[2023-03-12 23:17:32] [INFO ] Invariant cache hit.
[2023-03-12 23:17:32] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-12 23:17:32] [INFO ] Invariant cache hit.
[2023-03-12 23:17:33] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
[2023-03-12 23:17:33] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-12 23:17:33] [INFO ] Invariant cache hit.
[2023-03-12 23:17:34] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1496 ms. Remains : 419/419 places, 1058/1058 transitions.
Ending property specific reduction for ASLink-PT-05b-UpperBounds-01 in 8296 ms.
Starting property specific reduction for ASLink-PT-05b-UpperBounds-14
// Phase 1: matrix 1060 rows 421 cols
[2023-03-12 23:17:34] [INFO ] Computed 39 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 189 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-12 23:17:34] [INFO ] Invariant cache hit.
[2023-03-12 23:17:34] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:34] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 16 ms returned sat
[2023-03-12 23:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:34] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2023-03-12 23:17:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:17:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:34] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-12 23:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:34] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2023-03-12 23:17:34] [INFO ] Computed and/alt/rep : 227/1054/227 causal constraints (skipped 804 transitions) in 66 ms.
[2023-03-12 23:17:35] [INFO ] Added : 30 causal constraints over 7 iterations in 815 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1060/1060 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 421 transition count 1059
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 420 transition count 1059
Applied a total of 2 rules in 14 ms. Remains 420 /421 variables (removed 1) and now considering 1059/1060 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 420/421 places, 1059/1060 transitions.
// Phase 1: matrix 1059 rows 420 cols
[2023-03-12 23:17:36] [INFO ] Computed 39 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 18493 resets, run finished after 1779 ms. (steps per millisecond=562 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4494 resets, run finished after 660 ms. (steps per millisecond=1515 ) properties (out of 1) seen :0
[2023-03-12 23:17:38] [INFO ] Invariant cache hit.
[2023-03-12 23:17:38] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-12 23:17:38] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 16 ms returned sat
[2023-03-12 23:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:38] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2023-03-12 23:17:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:17:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 23:17:39] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 17 ms returned sat
[2023-03-12 23:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:17:39] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2023-03-12 23:17:39] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 1 ms to minimize.
[2023-03-12 23:17:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2023-03-12 23:17:39] [INFO ] Computed and/alt/rep : 226/1053/226 causal constraints (skipped 804 transitions) in 72 ms.
[2023-03-12 23:17:40] [INFO ] Added : 19 causal constraints over 4 iterations in 509 ms. Result :sat
Minimization took 121 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1059/1059 transitions.
Applied a total of 0 rules in 27 ms. Remains 420 /420 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 420/420 places, 1059/1059 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1059/1059 transitions.
Applied a total of 0 rules in 25 ms. Remains 420 /420 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2023-03-12 23:17:40] [INFO ] Invariant cache hit.
[2023-03-12 23:17:41] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-12 23:17:41] [INFO ] Invariant cache hit.
[2023-03-12 23:17:41] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
[2023-03-12 23:17:41] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-12 23:17:41] [INFO ] Invariant cache hit.
[2023-03-12 23:17:42] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1618 ms. Remains : 420/420 places, 1059/1059 transitions.
Ending property specific reduction for ASLink-PT-05b-UpperBounds-14 in 8167 ms.
[2023-03-12 23:17:42] [INFO ] Flatten gal took : 116 ms
[2023-03-12 23:17:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-12 23:17:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 421 places, 1060 transitions and 4335 arcs took 4 ms.
Total runtime 120826 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ASLink_PT_05b
(NrP: 421 NrTr: 1060 NrArc: 4335)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.036sec

net check time: 0m 0.000sec

init dd package: 0m 2.797sec


before gc: list nodes free: 1139026

after gc: idd nodes used:4383, unused:63995617; list nodes free:276781153
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6387860 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16095972 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.005sec

4090 3079 3020 3419 3418 3351 2880 3268 3515 3550 3290 2999 3484 3540 3491 3020 3382 3601 3636 3447 3222 3644 3689 3733 3066 3550 3744 3800 3960 3360 3825 3874 3867 3386 3662 3936 3989 4189 3503 4065 4027 4067 3881 3881 4192 4142 3978 3520 4182 4279 4314 4165 3781 4359 4413 4239 3626 4302 4457 4490 4430 3869 4527 4573 4437 3713 4419 4645 4670 4412 4017 4690 4728 4768 3859 4574 4807 4842 4433 4153 4892 4939 4938 4229 4608 4929 5054 5210 4261 4928 5025 5060 4484 4369 5093 5140 4780 4283 5084 5185 5228 4687 4504 5282 5279 4998 4426

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-05b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is ASLink-PT-05b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813598600085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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