fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r010-oct2-167813598600093
Last Updated
May 14, 2023

About the Execution of Marcie+red for ASLink-PT-06a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9497.703 3600000.00 3690030.00 118.70 1 1 1 1 1 1 1 1 1 1 1 1 1 ? 1 1 normal

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-167813598600093.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-06a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598600093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.7K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:09 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 597K 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-06a-UpperBounds-00
FORMULA_NAME ASLink-PT-06a-UpperBounds-01
FORMULA_NAME ASLink-PT-06a-UpperBounds-02
FORMULA_NAME ASLink-PT-06a-UpperBounds-03
FORMULA_NAME ASLink-PT-06a-UpperBounds-04
FORMULA_NAME ASLink-PT-06a-UpperBounds-05
FORMULA_NAME ASLink-PT-06a-UpperBounds-06
FORMULA_NAME ASLink-PT-06a-UpperBounds-07
FORMULA_NAME ASLink-PT-06a-UpperBounds-08
FORMULA_NAME ASLink-PT-06a-UpperBounds-09
FORMULA_NAME ASLink-PT-06a-UpperBounds-10
FORMULA_NAME ASLink-PT-06a-UpperBounds-11
FORMULA_NAME ASLink-PT-06a-UpperBounds-12
FORMULA_NAME ASLink-PT-06a-UpperBounds-13
FORMULA_NAME ASLink-PT-06a-UpperBounds-14
FORMULA_NAME ASLink-PT-06a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678663556913

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-06a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 23:25:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 23:25:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:25:59] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-12 23:25:59] [INFO ] Transformed 1406 places.
[2023-03-12 23:25:59] [INFO ] Transformed 2100 transitions.
[2023-03-12 23:25:59] [INFO ] Found NUPN structural information;
[2023-03-12 23:25:59] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
// Phase 1: matrix 2078 rows 1406 cols
[2023-03-12 23:25:59] [INFO ] Computed 270 place invariants in 100 ms
Incomplete random walk after 10000 steps, including 64 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 16) seen :9
FORMULA ASLink-PT-06a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
[2023-03-12 23:26:00] [INFO ] Invariant cache hit.
[2023-03-12 23:26:00] [INFO ] [Real]Absence check using 66 positive place invariants in 38 ms returned sat
[2023-03-12 23:26:01] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 136 ms returned sat
[2023-03-12 23:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:02] [INFO ] [Real]Absence check using state equation in 1312 ms returned sat
[2023-03-12 23:26:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:26:02] [INFO ] [Nat]Absence check using 66 positive place invariants in 28 ms returned sat
[2023-03-12 23:26:02] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 72 ms returned sat
[2023-03-12 23:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:07] [INFO ] [Nat]Absence check using state equation in 4687 ms returned unknown
[2023-03-12 23:26:07] [INFO ] [Real]Absence check using 66 positive place invariants in 43 ms returned sat
[2023-03-12 23:26:08] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 95 ms returned sat
[2023-03-12 23:26:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:09] [INFO ] [Real]Absence check using state equation in 1033 ms returned sat
[2023-03-12 23:26:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:26:09] [INFO ] [Nat]Absence check using 66 positive place invariants in 74 ms returned sat
[2023-03-12 23:26:09] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 89 ms returned sat
[2023-03-12 23:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:14] [INFO ] [Nat]Absence check using state equation in 4460 ms returned unknown
[2023-03-12 23:26:14] [INFO ] [Real]Absence check using 66 positive place invariants in 45 ms returned sat
[2023-03-12 23:26:14] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 60 ms returned sat
[2023-03-12 23:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:15] [INFO ] [Real]Absence check using state equation in 1005 ms returned sat
[2023-03-12 23:26:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:26:16] [INFO ] [Nat]Absence check using 66 positive place invariants in 27 ms returned sat
[2023-03-12 23:26:16] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 58 ms returned sat
[2023-03-12 23:26:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:20] [INFO ] [Nat]Absence check using state equation in 4630 ms returned unknown
[2023-03-12 23:26:21] [INFO ] [Real]Absence check using 66 positive place invariants in 24 ms returned sat
[2023-03-12 23:26:21] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 53 ms returned sat
[2023-03-12 23:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:22] [INFO ] [Real]Absence check using state equation in 1083 ms returned sat
[2023-03-12 23:26:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:26:22] [INFO ] [Nat]Absence check using 66 positive place invariants in 28 ms returned sat
[2023-03-12 23:26:22] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 94 ms returned sat
[2023-03-12 23:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:23] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2023-03-12 23:26:24] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 198 ms.
[2023-03-12 23:26:27] [INFO ] Added : 20 causal constraints over 4 iterations in 3558 ms. Result :unknown
[2023-03-12 23:26:27] [INFO ] [Real]Absence check using 66 positive place invariants in 71 ms returned sat
[2023-03-12 23:26:27] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 90 ms returned sat
[2023-03-12 23:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:29] [INFO ] [Real]Absence check using state equation in 1237 ms returned sat
[2023-03-12 23:26:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:26:29] [INFO ] [Nat]Absence check using 66 positive place invariants in 40 ms returned sat
[2023-03-12 23:26:29] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 79 ms returned sat
[2023-03-12 23:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:34] [INFO ] [Nat]Absence check using state equation in 4636 ms returned unknown
[2023-03-12 23:26:34] [INFO ] [Real]Absence check using 66 positive place invariants in 26 ms returned sat
[2023-03-12 23:26:34] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 117 ms returned sat
[2023-03-12 23:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:35] [INFO ] [Real]Absence check using state equation in 1048 ms returned sat
[2023-03-12 23:26:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:26:36] [INFO ] [Nat]Absence check using 66 positive place invariants in 31 ms returned sat
[2023-03-12 23:26:36] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 84 ms returned sat
[2023-03-12 23:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:37] [INFO ] [Nat]Absence check using state equation in 1370 ms returned sat
[2023-03-12 23:26:38] [INFO ] Deduced a trap composed of 51 places in 484 ms of which 4 ms to minimize.
[2023-03-12 23:26:40] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3240 ms
[2023-03-12 23:26:41] [INFO ] [Real]Absence check using 66 positive place invariants in 30 ms returned sat
[2023-03-12 23:26:41] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 68 ms returned sat
[2023-03-12 23:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:42] [INFO ] [Real]Absence check using state equation in 1011 ms returned sat
[2023-03-12 23:26:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:26:42] [INFO ] [Nat]Absence check using 66 positive place invariants in 29 ms returned sat
[2023-03-12 23:26:42] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 50 ms returned sat
[2023-03-12 23:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:26:47] [INFO ] [Nat]Absence check using state equation in 4671 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-06a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1370 transition count 1953
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 286 place count 1245 transition count 1953
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 286 place count 1245 transition count 1825
Deduced a syphon composed of 128 places in 11 ms
Ensure Unique test removed 50 places
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 592 place count 1067 transition count 1825
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 593 place count 1067 transition count 1824
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 594 place count 1066 transition count 1824
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 602 place count 1058 transition count 1783
Ensure Unique test removed 1 places
Iterating global reduction 4 with 9 rules applied. Total rules applied 611 place count 1057 transition count 1783
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 617 place count 1056 transition count 1778
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 620 place count 1053 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 621 place count 1052 transition count 1770
Iterating global reduction 6 with 1 rules applied. Total rules applied 622 place count 1052 transition count 1770
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 623 place count 1051 transition count 1762
Iterating global reduction 6 with 1 rules applied. Total rules applied 624 place count 1051 transition count 1762
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 625 place count 1050 transition count 1754
Iterating global reduction 6 with 1 rules applied. Total rules applied 626 place count 1050 transition count 1754
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 627 place count 1049 transition count 1746
Iterating global reduction 6 with 1 rules applied. Total rules applied 628 place count 1049 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 629 place count 1048 transition count 1738
Iterating global reduction 6 with 1 rules applied. Total rules applied 630 place count 1048 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 631 place count 1047 transition count 1730
Iterating global reduction 6 with 1 rules applied. Total rules applied 632 place count 1047 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 633 place count 1046 transition count 1722
Iterating global reduction 6 with 1 rules applied. Total rules applied 634 place count 1046 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 635 place count 1045 transition count 1714
Iterating global reduction 6 with 1 rules applied. Total rules applied 636 place count 1045 transition count 1714
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 637 place count 1044 transition count 1706
Iterating global reduction 6 with 1 rules applied. Total rules applied 638 place count 1044 transition count 1706
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 639 place count 1043 transition count 1698
Iterating global reduction 6 with 1 rules applied. Total rules applied 640 place count 1043 transition count 1698
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 641 place count 1042 transition count 1690
Iterating global reduction 6 with 1 rules applied. Total rules applied 642 place count 1042 transition count 1690
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 643 place count 1041 transition count 1682
Iterating global reduction 6 with 1 rules applied. Total rules applied 644 place count 1041 transition count 1682
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 645 place count 1040 transition count 1674
Iterating global reduction 6 with 1 rules applied. Total rules applied 646 place count 1040 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 647 place count 1039 transition count 1666
Iterating global reduction 6 with 1 rules applied. Total rules applied 648 place count 1039 transition count 1666
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 649 place count 1038 transition count 1658
Iterating global reduction 6 with 1 rules applied. Total rules applied 650 place count 1038 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 651 place count 1037 transition count 1650
Iterating global reduction 6 with 1 rules applied. Total rules applied 652 place count 1037 transition count 1650
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 736 place count 995 transition count 1608
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 741 place count 995 transition count 1603
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 746 place count 990 transition count 1603
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 752 place count 990 transition count 1603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 753 place count 989 transition count 1602
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 764 place count 978 transition count 1602
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 21 Pre rules applied. Total rules applied 764 place count 978 transition count 1581
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 806 place count 957 transition count 1581
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 8 with 6 rules applied. Total rules applied 812 place count 951 transition count 1581
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 824 place count 945 transition count 1575
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 830 place count 939 transition count 1569
Iterating global reduction 9 with 6 rules applied. Total rules applied 836 place count 939 transition count 1569
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 842 place count 939 transition count 1563
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 849 place count 933 transition count 1562
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 854 place count 933 transition count 1562
Applied a total of 854 rules in 1480 ms. Remains 933 /1406 variables (removed 473) and now considering 1562/2078 (removed 516) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1480 ms. Remains : 933/1406 places, 1562/2078 transitions.
// Phase 1: matrix 1562 rows 933 cols
[2023-03-12 23:26:50] [INFO ] Computed 165 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 11411 resets, run finished after 3394 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1895 resets, run finished after 1504 ms. (steps per millisecond=664 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1879 resets, run finished after 1498 ms. (steps per millisecond=667 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1889 resets, run finished after 1258 ms. (steps per millisecond=794 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1888 resets, run finished after 1254 ms. (steps per millisecond=797 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1895 resets, run finished after 1472 ms. (steps per millisecond=679 ) properties (out of 5) seen :0
[2023-03-12 23:27:01] [INFO ] Invariant cache hit.
[2023-03-12 23:27:01] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-12 23:27:01] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 97 ms returned sat
[2023-03-12 23:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:27:01] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2023-03-12 23:27:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:27:02] [INFO ] [Nat]Absence check using 42 positive place invariants in 28 ms returned sat
[2023-03-12 23:27:02] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 48 ms returned sat
[2023-03-12 23:27:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:27:02] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2023-03-12 23:27:02] [INFO ] Computed and/alt/rep : 625/2366/625 causal constraints (skipped 903 transitions) in 115 ms.
[2023-03-12 23:27:15] [INFO ] Deduced a trap composed of 94 places in 514 ms of which 2 ms to minimize.
[2023-03-12 23:27:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 673 ms
[2023-03-12 23:27:16] [INFO ] Added : 459 causal constraints over 92 iterations in 13399 ms. Result :sat
Minimization took 540 ms.
[2023-03-12 23:27:17] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2023-03-12 23:27:17] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 32 ms returned sat
[2023-03-12 23:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:27:17] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2023-03-12 23:27:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:27:17] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-12 23:27:17] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 70 ms returned sat
[2023-03-12 23:27:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:27:25] [INFO ] [Nat]Absence check using state equation in 7132 ms returned unknown
[2023-03-12 23:27:25] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2023-03-12 23:27:25] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 41 ms returned sat
[2023-03-12 23:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:27:25] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2023-03-12 23:27:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:27:26] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2023-03-12 23:27:26] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 35 ms returned sat
[2023-03-12 23:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:27:26] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2023-03-12 23:27:26] [INFO ] Computed and/alt/rep : 625/2366/625 causal constraints (skipped 903 transitions) in 104 ms.
[2023-03-12 23:27:38] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 1 ms to minimize.
[2023-03-12 23:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2023-03-12 23:27:38] [INFO ] Added : 470 causal constraints over 94 iterations in 11908 ms. Result :sat
Minimization took 637 ms.
[2023-03-12 23:27:39] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-12 23:27:39] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 40 ms returned sat
[2023-03-12 23:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:27:39] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2023-03-12 23:27:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:27:40] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2023-03-12 23:27:40] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 54 ms returned sat
[2023-03-12 23:27:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:27:40] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2023-03-12 23:27:40] [INFO ] Computed and/alt/rep : 625/2366/625 causal constraints (skipped 903 transitions) in 127 ms.
[2023-03-12 23:27:57] [INFO ] Added : 410 causal constraints over 82 iterations in 16443 ms. Result :unknown
[2023-03-12 23:27:57] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-12 23:27:57] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 70 ms returned sat
[2023-03-12 23:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:27:57] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2023-03-12 23:27:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:27:58] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-12 23:27:58] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 28 ms returned sat
[2023-03-12 23:27:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:27:59] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2023-03-12 23:27:59] [INFO ] Computed and/alt/rep : 625/2366/625 causal constraints (skipped 903 transitions) in 142 ms.
[2023-03-12 23:28:11] [INFO ] Added : 486 causal constraints over 98 iterations in 12407 ms. Result :sat
Minimization took 497 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 1562/1562 transitions.
Applied a total of 0 rules in 32 ms. Remains 933 /933 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 933/933 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 1562/1562 transitions.
Applied a total of 0 rules in 31 ms. Remains 933 /933 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2023-03-12 23:28:16] [INFO ] Invariant cache hit.
[2023-03-12 23:28:17] [INFO ] Implicit Places using invariants in 930 ms returned [0, 18, 19, 21, 31, 49, 67, 143, 157, 158, 178, 196, 215, 264, 269, 270, 281, 282, 283, 301, 319, 388, 392, 393, 404, 405, 406, 424, 442, 511, 515, 516, 527, 528, 529, 547, 565, 600, 637, 641, 642, 653, 654, 655, 673, 691, 760, 764, 765, 768, 779, 780, 781, 799, 801, 804, 822, 823, 824, 825, 837, 843, 849, 855, 861, 867, 873, 879, 885, 891, 897]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 946 ms to find 71 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 862/933 places, 1562/1562 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 862 transition count 1452
Reduce places removed 110 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 112 rules applied. Total rules applied 222 place count 752 transition count 1450
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 224 place count 750 transition count 1450
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 224 place count 750 transition count 1418
Deduced a syphon composed of 32 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 65 rules applied. Total rules applied 289 place count 717 transition count 1418
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 301 place count 713 transition count 1410
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 309 place count 705 transition count 1410
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 324 place count 690 transition count 1395
Iterating global reduction 5 with 15 rules applied. Total rules applied 339 place count 690 transition count 1395
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 342 place count 690 transition count 1392
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 342 place count 690 transition count 1391
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 344 place count 689 transition count 1391
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 347 place count 686 transition count 1388
Iterating global reduction 6 with 3 rules applied. Total rules applied 350 place count 686 transition count 1388
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 351 place count 685 transition count 1387
Iterating global reduction 6 with 1 rules applied. Total rules applied 352 place count 685 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 353 place count 684 transition count 1386
Iterating global reduction 6 with 1 rules applied. Total rules applied 354 place count 684 transition count 1386
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 466 place count 628 transition count 1330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 470 place count 628 transition count 1326
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 474 place count 624 transition count 1321
Iterating global reduction 7 with 4 rules applied. Total rules applied 478 place count 624 transition count 1321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 481 place count 624 transition count 1318
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 482 place count 624 transition count 1317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 483 place count 623 transition count 1317
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 9 with 15 rules applied. Total rules applied 498 place count 623 transition count 1302
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 514 place count 607 transition count 1302
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 515 place count 607 transition count 1301
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 10 with 18 rules applied. Total rules applied 533 place count 607 transition count 1301
Applied a total of 533 rules in 522 ms. Remains 607 /862 variables (removed 255) and now considering 1301/1562 (removed 261) transitions.
// Phase 1: matrix 1301 rows 607 cols
[2023-03-12 23:28:18] [INFO ] Computed 88 place invariants in 11 ms
[2023-03-12 23:28:18] [INFO ] Implicit Places using invariants in 489 ms returned [88, 94, 97, 99, 103, 110, 111, 186, 192, 195, 197, 202, 203, 272, 278, 281, 283, 289, 290, 342, 359, 365, 368, 370, 375, 376, 428, 447, 453, 456, 458, 463, 464, 516, 533, 539, 542, 544]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 492 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 569/933 places, 1301/1562 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 550 transition count 1282
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 550 transition count 1282
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 544 transition count 1276
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 544 transition count 1276
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 68 place count 535 transition count 1267
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 86 place count 535 transition count 1249
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 104 place count 517 transition count 1249
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 517 transition count 1246
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 514 transition count 1246
Applied a total of 110 rules in 88 ms. Remains 514 /569 variables (removed 55) and now considering 1246/1301 (removed 55) transitions.
// Phase 1: matrix 1246 rows 514 cols
[2023-03-12 23:28:18] [INFO ] Computed 50 place invariants in 9 ms
[2023-03-12 23:28:19] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 23:28:19] [INFO ] Invariant cache hit.
[2023-03-12 23:28:20] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 514/933 places, 1246/1562 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3632 ms. Remains : 514/933 places, 1246/1562 transitions.
Successfully produced net in file /tmp/petri1000_3989724238095848787.dot
Successfully produced net in file /tmp/petri1001_6109211288226003939.dot
Successfully produced net in file /tmp/petri1002_15717719179567907187.dot
Successfully produced net in file /tmp/petri1003_1836305493956865897.dot
Successfully produced net in file /tmp/petri1004_5219463946364387287.dot
Successfully produced net in file /tmp/petri1005_11351952154020890176.dot
Drop transitions removed 6 transitions
Dominated transitions for bounds rules discarded 6 transitions
// Phase 1: matrix 1240 rows 514 cols
[2023-03-12 23:28:20] [INFO ] Computed 50 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 17774 resets, run finished after 2356 ms. (steps per millisecond=424 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3957 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4037 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3985 resets, run finished after 755 ms. (steps per millisecond=1324 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3992 resets, run finished after 735 ms. (steps per millisecond=1360 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4005 resets, run finished after 733 ms. (steps per millisecond=1364 ) properties (out of 5) seen :0
[2023-03-12 23:28:26] [INFO ] Invariant cache hit.
[2023-03-12 23:28:26] [INFO ] [Real]Absence check using 13 positive place invariants in 54 ms returned sat
[2023-03-12 23:28:26] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 18 ms returned sat
[2023-03-12 23:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:27] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-12 23:28:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:28:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-12 23:28:27] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 20 ms returned sat
[2023-03-12 23:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:27] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2023-03-12 23:28:27] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 91 ms.
[2023-03-12 23:28:28] [INFO ] Added : 23 causal constraints over 5 iterations in 803 ms. Result :sat
Minimization took 326 ms.
[2023-03-12 23:28:29] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-12 23:28:29] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 17 ms returned sat
[2023-03-12 23:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:29] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2023-03-12 23:28:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:28:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 23:28:29] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 13 ms returned sat
[2023-03-12 23:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:30] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2023-03-12 23:28:30] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 96 ms.
[2023-03-12 23:28:31] [INFO ] Added : 60 causal constraints over 12 iterations in 1309 ms. Result :sat
Minimization took 235 ms.
[2023-03-12 23:28:31] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 23:28:31] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 10 ms returned sat
[2023-03-12 23:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:32] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2023-03-12 23:28:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:28:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-12 23:28:32] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 23 ms returned sat
[2023-03-12 23:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:32] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2023-03-12 23:28:32] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 94 ms.
[2023-03-12 23:28:35] [INFO ] Deduced a trap composed of 33 places in 295 ms of which 26 ms to minimize.
[2023-03-12 23:28:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 639 ms
[2023-03-12 23:28:35] [INFO ] Added : 75 causal constraints over 15 iterations in 2822 ms. Result :sat
Minimization took 303 ms.
[2023-03-12 23:28:36] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-12 23:28:36] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 12 ms returned sat
[2023-03-12 23:28:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:36] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2023-03-12 23:28:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:28:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 23:28:36] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 18 ms returned sat
[2023-03-12 23:28:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:36] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2023-03-12 23:28:36] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2023-03-12 23:28:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-12 23:28:37] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 118 ms.
[2023-03-12 23:28:37] [INFO ] Added : 31 causal constraints over 7 iterations in 1056 ms. Result :sat
Minimization took 128 ms.
[2023-03-12 23:28:38] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 23:28:38] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 69 ms returned sat
[2023-03-12 23:28:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:38] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2023-03-12 23:28:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:28:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 23:28:38] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 12 ms returned sat
[2023-03-12 23:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:39] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2023-03-12 23:28:39] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 81 ms.
[2023-03-12 23:28:41] [INFO ] Added : 57 causal constraints over 12 iterations in 1776 ms. Result :sat
Minimization took 279 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA ASLink-PT-06a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 1240/1240 transitions.
Graph (complete) has 3034 edges and 514 vertex of which 508 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output 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 2 place count 508 transition count 1239
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 506 transition count 1239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 506 transition count 1238
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 6 place count 505 transition count 1238
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 503 transition count 1232
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 503 transition count 1232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 503 transition count 1230
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 502 transition count 1229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 502 transition count 1228
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 21 place count 502 transition count 1228
Applied a total of 21 rules in 69 ms. Remains 502 /514 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 502/514 places, 1228/1240 transitions.
// Phase 1: matrix 1228 rows 502 cols
[2023-03-12 23:28:42] [INFO ] Computed 49 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 17816 resets, run finished after 2025 ms. (steps per millisecond=493 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4037 resets, run finished after 722 ms. (steps per millisecond=1385 ) properties (out of 1) seen :0
[2023-03-12 23:28:45] [INFO ] Invariant cache hit.
[2023-03-12 23:28:45] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-12 23:28:45] [INFO ] [Real]Absence check using 14 positive and 35 generalized place invariants in 109 ms returned sat
[2023-03-12 23:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:46] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2023-03-12 23:28:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:28:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-12 23:28:46] [INFO ] [Nat]Absence check using 14 positive and 35 generalized place invariants in 10 ms returned sat
[2023-03-12 23:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:46] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2023-03-12 23:28:46] [INFO ] Computed and/alt/rep : 295/1409/295 causal constraints (skipped 903 transitions) in 103 ms.
[2023-03-12 23:28:48] [INFO ] Added : 63 causal constraints over 13 iterations in 1444 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 1228/1228 transitions.
Applied a total of 0 rules in 17 ms. Remains 502 /502 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 502/502 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 1228/1228 transitions.
Applied a total of 0 rules in 17 ms. Remains 502 /502 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2023-03-12 23:28:48] [INFO ] Invariant cache hit.
[2023-03-12 23:28:49] [INFO ] Implicit Places using invariants in 313 ms returned [71, 87, 92, 218]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 316 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 498/502 places, 1228/1228 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 498 transition count 1224
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 494 transition count 1224
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 490 transition count 1220
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 490 transition count 1217
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 487 transition count 1217
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 487 transition count 1217
Applied a total of 23 rules in 63 ms. Remains 487 /498 variables (removed 11) and now considering 1217/1228 (removed 11) transitions.
// Phase 1: matrix 1217 rows 487 cols
[2023-03-12 23:28:49] [INFO ] Computed 45 place invariants in 23 ms
[2023-03-12 23:28:49] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-12 23:28:49] [INFO ] Invariant cache hit.
[2023-03-12 23:28:50] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 487/502 places, 1217/1228 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1912 ms. Remains : 487/502 places, 1217/1228 transitions.
[2023-03-12 23:28:50] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17916 resets, run finished after 2282 ms. (steps per millisecond=438 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4016 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties (out of 1) seen :0
[2023-03-12 23:28:53] [INFO ] Invariant cache hit.
[2023-03-12 23:28:53] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-12 23:28:53] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 23 ms returned sat
[2023-03-12 23:28:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:54] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2023-03-12 23:28:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:28:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-12 23:28:54] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 36 ms returned sat
[2023-03-12 23:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:54] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-12 23:28:55] [INFO ] Computed and/alt/rep : 264/1168/264 causal constraints (skipped 923 transitions) in 128 ms.
[2023-03-12 23:28:55] [INFO ] Added : 21 causal constraints over 5 iterations in 746 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 1217/1217 transitions.
Applied a total of 0 rules in 18 ms. Remains 487 /487 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 487/487 places, 1217/1217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 1217/1217 transitions.
Applied a total of 0 rules in 17 ms. Remains 487 /487 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
[2023-03-12 23:28:55] [INFO ] Invariant cache hit.
[2023-03-12 23:28:56] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-12 23:28:56] [INFO ] Invariant cache hit.
[2023-03-12 23:28:57] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
[2023-03-12 23:28:57] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-12 23:28:57] [INFO ] Invariant cache hit.
[2023-03-12 23:28:58] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2223 ms. Remains : 487/487 places, 1217/1217 transitions.
Starting property specific reduction for ASLink-PT-06a-UpperBounds-13
[2023-03-12 23:28:58] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 170 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-12 23:28:58] [INFO ] Invariant cache hit.
[2023-03-12 23:28:58] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 23:28:58] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 13 ms returned sat
[2023-03-12 23:28:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:58] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2023-03-12 23:28:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:28:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-12 23:28:58] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 21 ms returned sat
[2023-03-12 23:28:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:28:59] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2023-03-12 23:28:59] [INFO ] Computed and/alt/rep : 264/1168/264 causal constraints (skipped 923 transitions) in 97 ms.
[2023-03-12 23:29:00] [INFO ] Added : 21 causal constraints over 5 iterations in 717 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 1217/1217 transitions.
Applied a total of 0 rules in 15 ms. Remains 487 /487 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 487/487 places, 1217/1217 transitions.
[2023-03-12 23:29:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17870 resets, run finished after 1827 ms. (steps per millisecond=547 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4023 resets, run finished after 714 ms. (steps per millisecond=1400 ) properties (out of 1) seen :0
[2023-03-12 23:29:03] [INFO ] Invariant cache hit.
[2023-03-12 23:29:03] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-12 23:29:03] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 141 ms returned sat
[2023-03-12 23:29:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:29:03] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2023-03-12 23:29:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:29:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-12 23:29:03] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 24 ms returned sat
[2023-03-12 23:29:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:29:04] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2023-03-12 23:29:04] [INFO ] Computed and/alt/rep : 264/1168/264 causal constraints (skipped 923 transitions) in 73 ms.
[2023-03-12 23:29:04] [INFO ] Added : 21 causal constraints over 5 iterations in 717 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 1217/1217 transitions.
Applied a total of 0 rules in 18 ms. Remains 487 /487 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 487/487 places, 1217/1217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 1217/1217 transitions.
Applied a total of 0 rules in 17 ms. Remains 487 /487 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
[2023-03-12 23:29:05] [INFO ] Invariant cache hit.
[2023-03-12 23:29:05] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-12 23:29:05] [INFO ] Invariant cache hit.
[2023-03-12 23:29:06] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
[2023-03-12 23:29:06] [INFO ] Redundant transitions in 121 ms returned []
[2023-03-12 23:29:06] [INFO ] Invariant cache hit.
[2023-03-12 23:29:07] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2137 ms. Remains : 487/487 places, 1217/1217 transitions.
Ending property specific reduction for ASLink-PT-06a-UpperBounds-13 in 9191 ms.
[2023-03-12 23:29:07] [INFO ] Flatten gal took : 124 ms
[2023-03-12 23:29:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-12 23:29:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 487 places, 1217 transitions and 4973 arcs took 4 ms.
Total runtime 188222 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_06a
(NrP: 487 NrTr: 1217 NrArc: 4973)

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

net check time: 0m 0.001sec

init dd package: 0m 3.220sec


before gc: list nodes free: 602906

after gc: idd nodes used:4908, unused:63995092; list nodes free:260021971

before gc: list nodes free: 611761

after gc: idd nodes used:4902, unused:63995098; list nodes free:260021952

before gc: list nodes free: 611710

after gc: idd nodes used:5051, unused:63994949; list nodes free:260021151

before gc: list nodes free: 611705

after gc: idd nodes used:4841, unused:63995159; list nodes free:260022184

before gc: list nodes free: 611740

after gc: idd nodes used:4956, unused:63995044; list nodes free:260021693

before gc: list nodes free: 611762

after gc: idd nodes used:4955, unused:63995045; list nodes free:260021704

before gc: list nodes free: 611699

after gc: idd nodes used:4881, unused:63995119; list nodes free:260022025

before gc: list nodes free: 611795

after gc: idd nodes used:5000, unused:63995000; list nodes free:260021513

before gc: list nodes free: 611723

after gc: idd nodes used:4998, unused:63995002; list nodes free:260021541
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6650952 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096884 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:
++ 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.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.006sec

3383 3388 4086 4319 4398 4364 3373 3373 3375 3835 4239 4406 4569 3383 3387 3388 3980 3988 4414 4361 3977 3377 3369 3794 4032 4422 4563 4196 3388 3388 3693 4276 4432 4361 4163 3375 3361 3355 4311 4423 4382 4165 3388 3392 3411 4081 4293 4395 4173 3361 3357 3353 3927 4286 4401 4566 3394 3401 3386 3941 3961 4407 4369 3327 3355 3350 3837 3996 4413 4560 4196 3386 3386 3721 4185 4420 4365 4169 3350 3337 3644 4373 4428 4440 4169 3386 3386 3380 4073 4309 4459 4186 3329 3347 3358 3971 4296 4473 4554 3386 3380 3380 3906 3851 4483 4482 3347 3364 3354 3899 3996 4493 4548 4152 3380 3380 3812 4184 4424 4475 4167 3356 3351 3656 4406 4435 4438 4167 3380 3388 3388 4071 4355 4473 4212 3351 3388 3388 4015 4294 4483 4469 3388 3388 3388 3853 3828 4491 4565 3388 3388 3390 3951 4033 4499 4464 4063 3388 3394 3827 4144 4507 4559 4161 3388 3398 3635 4400 4520 4428 4163 3394 3401 3386 4155 4442 4448 4169 3396 3405 3386 4087 4291 4462 4430 3404 3386 3386 3814 4067 4482 4571 3408 3386 3386 3965 4032 4492 4426 4012 3386 3373 3805 4048 4502 4565 4227 3386 3383 3670 4312 4515 4370 4172 3386 3373 3373 4243 4438 4386 4182 3383 3383 3383 4097 4303 4398 4457 3373 3373 3373 3823 4198 4406 4592 3383 3383 3382 3945 4032 4414 4453 3984 3373 3377 3800 4012 4493 4585 4196 3383 3388 3693 4311 4506 4361 4168 3377 3375 3361 4311 4428 4382 4208 3388 3388 3394 4081 4297 4395 4171 3375 3361 3357 3885 4251 4401 4566 3388 3388 3400 3940 3985 4414 4369 3327 3359 3355 3794 4024 4422 4560 4196 3396 3409 3700 4252 4432 4365 4163 3355 3350 3644 4341 4423 4439 4169 3408 3386 3386 4116 4301 4459 4173 3350 3335 3347 3928 4296 4400 4563 3386 3386 3380 3941 3887 4405 4467 3327 3334 3364 3856 4006 4413 4557 4158 3380 3380 3811 4184 4420 4463 4181 3347 3358 3650 4406 4428 4447 4186 3380 3380 3388 4071 4330 4465 4171 3360 3354 3388 3980 4313 4477 4469 3380 3384 3388 3897 3804 4486 4529 3351 3345 3388 3951 4033 4494 4464 4063 3388 3388 3819 4147 4504 4525 4208 3388 3388 3643 4403 4516 4428 4163 3388 3390 3404 4140 4439 4458 4168 3388 3392 3409 4033 4291 4472 4430 3390 3396 3386 3815 4067 4482 4565 3392 3400 3386 3957 4046 4492 4426 4012 3408 3386 3810 4048 4519 4559 4161 3411 3386 3670 4312 4530 4370 4170 3386 3386 3373 4202 4451 4386 4169 3386 3386 3383 4091 4299 4463 4444 3386 3373 3373 3823 4189 4472 4577 3386 3383 3383 3950 4032 4482 4440 3990 3373 3373 3840 4012 4492 4569 4215 3383 3383 3626 4311 4505 4361 4168 3373 3373 3375 4235 4428 4382 4167 3383 3388 3388 4086 4297 4398 4171 3382 3377 3369 3853 4251 4406 4569 3388 3388 3388 3980 3988 4414 4369 3872 3375 3361 3794 4032 4422 4563 4201 3388 3394 3693 4276 4432 4365 4163 3361 3357 3350 4317 4423 4379 4165 3392 3401 3386 4116 4293 4395 4173 3357 3355 3350 3928 4286 4401 4563 3401 3386 3386 3941 3887 4407 4467 3327 3350 3340 3837 3996 4413 4557 4158 3386 3386 3721 4185 4420 4463 4169

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-06a"
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-06a, 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-167813598600093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-06a.tgz
mv ASLink-PT-06a 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 ;