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

About the Execution of ITS-Tools for ASLink-PT-06a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16219.531 3600000.00 3687011.00 3300.00 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.r005-oct2-167813592600093.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 itstools
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 r005-oct2-167813592600093
=====================================================================

--------------------
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 1678493767104

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-11 00:16:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 00:16:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:16:09] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-11 00:16:09] [INFO ] Transformed 1406 places.
[2023-03-11 00:16:09] [INFO ] Transformed 2100 transitions.
[2023-03-11 00:16:09] [INFO ] Found NUPN structural information;
[2023-03-11 00:16:09] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
// Phase 1: matrix 2078 rows 1406 cols
[2023-03-11 00:16:09] [INFO ] Computed 270 place invariants in 84 ms
Incomplete random walk after 10000 steps, including 56 resets, run finished after 142 ms. (steps per millisecond=70 ) 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 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :1
FORMULA ASLink-PT-06a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
[2023-03-11 00:16:10] [INFO ] Invariant cache hit.
[2023-03-11 00:16:10] [INFO ] [Real]Absence check using 66 positive place invariants in 77 ms returned sat
[2023-03-11 00:16:10] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 59 ms returned sat
[2023-03-11 00:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:16:11] [INFO ] [Real]Absence check using state equation in 1158 ms returned sat
[2023-03-11 00:16:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:16:12] [INFO ] [Nat]Absence check using 66 positive place invariants in 29 ms returned sat
[2023-03-11 00:16:12] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 65 ms returned sat
[2023-03-11 00:16:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:16:17] [INFO ] [Nat]Absence check using state equation in 4685 ms returned unknown
[2023-03-11 00:16:17] [INFO ] [Real]Absence check using 66 positive place invariants in 26 ms returned sat
[2023-03-11 00:16:17] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 112 ms returned sat
[2023-03-11 00:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:16:18] [INFO ] [Real]Absence check using state equation in 1174 ms returned sat
[2023-03-11 00:16:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:16:19] [INFO ] [Nat]Absence check using 66 positive place invariants in 44 ms returned sat
[2023-03-11 00:16:19] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 49 ms returned sat
[2023-03-11 00:16:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:16:23] [INFO ] [Nat]Absence check using state equation in 4605 ms returned unknown
[2023-03-11 00:16:24] [INFO ] [Real]Absence check using 66 positive place invariants in 129 ms returned sat
[2023-03-11 00:16:24] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 71 ms returned sat
[2023-03-11 00:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:16:25] [INFO ] [Real]Absence check using state equation in 1036 ms returned sat
[2023-03-11 00:16:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:16:25] [INFO ] [Nat]Absence check using 66 positive place invariants in 55 ms returned sat
[2023-03-11 00:16:25] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 66 ms returned sat
[2023-03-11 00:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:16:26] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2023-03-11 00:16:26] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 138 ms.
[2023-03-11 00:16:30] [INFO ] Added : 20 causal constraints over 4 iterations in 3748 ms. Result :unknown
[2023-03-11 00:16:30] [INFO ] [Real]Absence check using 66 positive place invariants in 28 ms returned sat
[2023-03-11 00:16:30] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 84 ms returned sat
[2023-03-11 00:16:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:16:31] [INFO ] [Real]Absence check using state equation in 913 ms returned sat
[2023-03-11 00:16:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:16:32] [INFO ] [Nat]Absence check using 66 positive place invariants in 26 ms returned sat
[2023-03-11 00:16:32] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 50 ms returned sat
[2023-03-11 00:16:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:16:37] [INFO ] [Nat]Absence check using state equation in 4689 ms returned unknown
[2023-03-11 00:16:37] [INFO ] [Real]Absence check using 66 positive place invariants in 25 ms returned sat
[2023-03-11 00:16:37] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 60 ms returned sat
[2023-03-11 00:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:16:38] [INFO ] [Real]Absence check using state equation in 1018 ms returned sat
[2023-03-11 00:16:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:16:38] [INFO ] [Nat]Absence check using 66 positive place invariants in 27 ms returned sat
[2023-03-11 00:16:38] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 81 ms returned sat
[2023-03-11 00:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:16:40] [INFO ] [Nat]Absence check using state equation in 1217 ms returned sat
[2023-03-11 00:16:40] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 6 ms to minimize.
[2023-03-11 00:16:43] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3374 ms
[2023-03-11 00:16:43] [INFO ] [Real]Absence check using 66 positive place invariants in 42 ms returned sat
[2023-03-11 00:16:43] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 66 ms returned sat
[2023-03-11 00:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:16:44] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2023-03-11 00:16:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:16:45] [INFO ] [Nat]Absence check using 66 positive place invariants in 35 ms returned sat
[2023-03-11 00:16:45] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 63 ms returned sat
[2023-03-11 00:16:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:16:49] [INFO ] [Nat]Absence check using state equation in 4692 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-06a-UpperBounds-09 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 7 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 1 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 1 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 1155 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 1156 ms. Remains : 933/1406 places, 1562/2078 transitions.
// Phase 1: matrix 1562 rows 933 cols
[2023-03-11 00:16:52] [INFO ] Computed 165 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 11452 resets, run finished after 3130 ms. (steps per millisecond=319 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1896 resets, run finished after 1295 ms. (steps per millisecond=772 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1886 resets, run finished after 1360 ms. (steps per millisecond=735 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1909 resets, run finished after 1279 ms. (steps per millisecond=781 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1871 resets, run finished after 1287 ms. (steps per millisecond=777 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1888 resets, run finished after 1289 ms. (steps per millisecond=775 ) properties (out of 5) seen :0
[2023-03-11 00:17:02] [INFO ] Invariant cache hit.
[2023-03-11 00:17:02] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2023-03-11 00:17:02] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 31 ms returned sat
[2023-03-11 00:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:17:03] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2023-03-11 00:17:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:17:03] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-11 00:17:03] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 27 ms returned sat
[2023-03-11 00:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:17:03] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2023-03-11 00:17:04] [INFO ] Computed and/alt/rep : 625/2366/625 causal constraints (skipped 903 transitions) in 124 ms.
[2023-03-11 00:17:15] [INFO ] Deduced a trap composed of 94 places in 372 ms of which 2 ms to minimize.
[2023-03-11 00:17:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 525 ms
[2023-03-11 00:17:16] [INFO ] Added : 459 causal constraints over 92 iterations in 11971 ms. Result :sat
Minimization took 466 ms.
[2023-03-11 00:17:16] [INFO ] [Real]Absence check using 42 positive place invariants in 11 ms returned sat
[2023-03-11 00:17:16] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 49 ms returned sat
[2023-03-11 00:17:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:17:17] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2023-03-11 00:17:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:17:17] [INFO ] [Nat]Absence check using 42 positive place invariants in 11 ms returned sat
[2023-03-11 00:17:17] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 70 ms returned sat
[2023-03-11 00:17:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:17:24] [INFO ] [Nat]Absence check using state equation in 7010 ms returned unknown
[2023-03-11 00:17:24] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2023-03-11 00:17:24] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 28 ms returned sat
[2023-03-11 00:17:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:17:25] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2023-03-11 00:17:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:17:25] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2023-03-11 00:17:25] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 34 ms returned sat
[2023-03-11 00:17:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:17:26] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2023-03-11 00:17:26] [INFO ] Computed and/alt/rep : 625/2366/625 causal constraints (skipped 903 transitions) in 166 ms.
[2023-03-11 00:17:37] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 11 ms to minimize.
[2023-03-11 00:17:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2023-03-11 00:17:37] [INFO ] Added : 470 causal constraints over 94 iterations in 10940 ms. Result :sat
Minimization took 624 ms.
[2023-03-11 00:17:38] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-11 00:17:38] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 33 ms returned sat
[2023-03-11 00:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:17:38] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-03-11 00:17:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:17:38] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-11 00:17:39] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 71 ms returned sat
[2023-03-11 00:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:17:39] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2023-03-11 00:17:39] [INFO ] Computed and/alt/rep : 625/2366/625 causal constraints (skipped 903 transitions) in 94 ms.
[2023-03-11 00:17:55] [INFO ] Added : 496 causal constraints over 100 iterations in 15939 ms. Result :sat
Minimization took 434 ms.
[2023-03-11 00:17:56] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned sat
[2023-03-11 00:17:56] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 51 ms returned sat
[2023-03-11 00:17:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:17:56] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2023-03-11 00:17:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:17:57] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-11 00:17:57] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 31 ms returned sat
[2023-03-11 00:17:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:17:57] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2023-03-11 00:17:58] [INFO ] Computed and/alt/rep : 625/2366/625 causal constraints (skipped 903 transitions) in 140 ms.
[2023-03-11 00:18:10] [INFO ] Added : 486 causal constraints over 98 iterations in 12289 ms. Result :sat
Minimization took 488 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 30 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 30 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 40 ms. Remains 933 /933 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2023-03-11 00:18:13] [INFO ] Invariant cache hit.
[2023-03-11 00:18:13] [INFO ] Implicit Places using invariants in 713 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 739 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 1 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 1 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 399 ms. Remains 607 /862 variables (removed 255) and now considering 1301/1562 (removed 261) transitions.
// Phase 1: matrix 1301 rows 607 cols
[2023-03-11 00:18:14] [INFO ] Computed 88 place invariants in 11 ms
[2023-03-11 00:18:14] [INFO ] Implicit Places using invariants in 427 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 439 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 127 ms. Remains 514 /569 variables (removed 55) and now considering 1246/1301 (removed 55) transitions.
// Phase 1: matrix 1246 rows 514 cols
[2023-03-11 00:18:14] [INFO ] Computed 50 place invariants in 9 ms
[2023-03-11 00:18:15] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-11 00:18:15] [INFO ] Invariant cache hit.
[2023-03-11 00:18:16] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1472 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 3218 ms. Remains : 514/933 places, 1246/1562 transitions.
Successfully produced net in file /tmp/petri1000_5032056676266237620.dot
Successfully produced net in file /tmp/petri1001_1470061964330771547.dot
Successfully produced net in file /tmp/petri1002_16504142144876368954.dot
Successfully produced net in file /tmp/petri1003_5967325121525887817.dot
Successfully produced net in file /tmp/petri1004_15474073639873942817.dot
Successfully produced net in file /tmp/petri1005_13715562187864038416.dot
Drop transitions removed 6 transitions
Dominated transitions for bounds rules discarded 6 transitions
// Phase 1: matrix 1240 rows 514 cols
[2023-03-11 00:18:16] [INFO ] Computed 50 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 17793 resets, run finished after 1881 ms. (steps per millisecond=531 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3975 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4034 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3992 resets, run finished after 755 ms. (steps per millisecond=1324 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3993 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3958 resets, run finished after 766 ms. (steps per millisecond=1305 ) properties (out of 5) seen :0
[2023-03-11 00:18:21] [INFO ] Invariant cache hit.
[2023-03-11 00:18:22] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-11 00:18:22] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 23 ms returned sat
[2023-03-11 00:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:22] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2023-03-11 00:18:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:18:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-11 00:18:22] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 10 ms returned sat
[2023-03-11 00:18:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:22] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2023-03-11 00:18:23] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 77 ms.
[2023-03-11 00:18:23] [INFO ] Added : 23 causal constraints over 5 iterations in 752 ms. Result :sat
Minimization took 315 ms.
[2023-03-11 00:18:24] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-11 00:18:24] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 18 ms returned sat
[2023-03-11 00:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:24] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2023-03-11 00:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:18:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-11 00:18:24] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 13 ms returned sat
[2023-03-11 00:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:24] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2023-03-11 00:18:25] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 85 ms.
[2023-03-11 00:18:26] [INFO ] Added : 60 causal constraints over 12 iterations in 1270 ms. Result :sat
Minimization took 216 ms.
[2023-03-11 00:18:26] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-11 00:18:26] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 78 ms returned sat
[2023-03-11 00:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:26] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2023-03-11 00:18:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:18:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 65 ms returned sat
[2023-03-11 00:18:27] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 27 ms returned sat
[2023-03-11 00:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:27] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2023-03-11 00:18:27] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 74 ms.
[2023-03-11 00:18:29] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 1 ms to minimize.
[2023-03-11 00:18:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2023-03-11 00:18:29] [INFO ] Added : 75 causal constraints over 15 iterations in 2380 ms. Result :sat
Minimization took 299 ms.
[2023-03-11 00:18:30] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-11 00:18:30] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 22 ms returned sat
[2023-03-11 00:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:30] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-03-11 00:18:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:18:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-11 00:18:30] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 10 ms returned sat
[2023-03-11 00:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:30] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2023-03-11 00:18:31] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2023-03-11 00:18:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-11 00:18:31] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 67 ms.
[2023-03-11 00:18:31] [INFO ] Added : 31 causal constraints over 7 iterations in 880 ms. Result :sat
Minimization took 180 ms.
[2023-03-11 00:18:32] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-11 00:18:32] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 15 ms returned sat
[2023-03-11 00:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:32] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2023-03-11 00:18:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:18:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-11 00:18:32] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 24 ms returned sat
[2023-03-11 00:18:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:33] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2023-03-11 00:18:33] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 87 ms.
[2023-03-11 00:18:34] [INFO ] Added : 57 causal constraints over 12 iterations in 1633 ms. Result :sat
Minimization took 273 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.2 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 86 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 86 ms. Remains : 502/514 places, 1228/1240 transitions.
// Phase 1: matrix 1228 rows 502 cols
[2023-03-11 00:18:36] [INFO ] Computed 49 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 17800 resets, run finished after 1924 ms. (steps per millisecond=519 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3994 resets, run finished after 737 ms. (steps per millisecond=1356 ) properties (out of 1) seen :0
[2023-03-11 00:18:39] [INFO ] Invariant cache hit.
[2023-03-11 00:18:39] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-11 00:18:39] [INFO ] [Real]Absence check using 14 positive and 35 generalized place invariants in 16 ms returned sat
[2023-03-11 00:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:39] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2023-03-11 00:18:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:18:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-11 00:18:39] [INFO ] [Nat]Absence check using 14 positive and 35 generalized place invariants in 40 ms returned sat
[2023-03-11 00:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:39] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2023-03-11 00:18:39] [INFO ] Computed and/alt/rep : 295/1409/295 causal constraints (skipped 903 transitions) in 70 ms.
[2023-03-11 00:18:41] [INFO ] Added : 63 causal constraints over 13 iterations in 1153 ms. Result :sat
Minimization took 172 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 13 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 13 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 13 ms. Remains 502 /502 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2023-03-11 00:18:41] [INFO ] Invariant cache hit.
[2023-03-11 00:18:41] [INFO ] Implicit Places using invariants in 395 ms returned [71, 87, 92, 218]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 397 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 54 ms. Remains 487 /498 variables (removed 11) and now considering 1217/1228 (removed 11) transitions.
// Phase 1: matrix 1217 rows 487 cols
[2023-03-11 00:18:41] [INFO ] Computed 45 place invariants in 24 ms
[2023-03-11 00:18:42] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-11 00:18:42] [INFO ] Invariant cache hit.
[2023-03-11 00:18:43] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1273 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 1737 ms. Remains : 487/502 places, 1217/1228 transitions.
[2023-03-11 00:18:43] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17800 resets, run finished after 1811 ms. (steps per millisecond=552 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3961 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties (out of 1) seen :0
[2023-03-11 00:18:45] [INFO ] Invariant cache hit.
[2023-03-11 00:18:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-11 00:18:45] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 22 ms returned sat
[2023-03-11 00:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:46] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2023-03-11 00:18:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:18:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-11 00:18:46] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 112 ms returned sat
[2023-03-11 00:18:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:46] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2023-03-11 00:18:46] [INFO ] Computed and/alt/rep : 264/1168/264 causal constraints (skipped 923 transitions) in 59 ms.
[2023-03-11 00:18:47] [INFO ] Added : 21 causal constraints over 5 iterations in 581 ms. Result :sat
Minimization took 131 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 14 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 14 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 27 ms. Remains 487 /487 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
[2023-03-11 00:18:47] [INFO ] Invariant cache hit.
[2023-03-11 00:18:47] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-11 00:18:47] [INFO ] Invariant cache hit.
[2023-03-11 00:18:48] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
[2023-03-11 00:18:48] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-11 00:18:49] [INFO ] Invariant cache hit.
[2023-03-11 00:18:49] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1884 ms. Remains : 487/487 places, 1217/1217 transitions.
Starting property specific reduction for ASLink-PT-06a-UpperBounds-13
[2023-03-11 00:18:49] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 183 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
[2023-03-11 00:18:49] [INFO ] Invariant cache hit.
[2023-03-11 00:18:49] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2023-03-11 00:18:49] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 13 ms returned sat
[2023-03-11 00:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:49] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2023-03-11 00:18:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:18:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-11 00:18:50] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 8 ms returned sat
[2023-03-11 00:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:50] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2023-03-11 00:18:50] [INFO ] Computed and/alt/rep : 264/1168/264 causal constraints (skipped 923 transitions) in 71 ms.
[2023-03-11 00:18:51] [INFO ] Added : 21 causal constraints over 5 iterations in 575 ms. Result :sat
Minimization took 154 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 13 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 13 ms. Remains : 487/487 places, 1217/1217 transitions.
[2023-03-11 00:18:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17854 resets, run finished after 1855 ms. (steps per millisecond=539 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3983 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 1) seen :0
[2023-03-11 00:18:54] [INFO ] Invariant cache hit.
[2023-03-11 00:18:54] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-11 00:18:54] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 24 ms returned sat
[2023-03-11 00:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:54] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2023-03-11 00:18:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:18:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2023-03-11 00:18:54] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 20 ms returned sat
[2023-03-11 00:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:18:55] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2023-03-11 00:18:55] [INFO ] Computed and/alt/rep : 264/1168/264 causal constraints (skipped 923 transitions) in 105 ms.
[2023-03-11 00:18:55] [INFO ] Added : 21 causal constraints over 5 iterations in 743 ms. Result :sat
Minimization took 122 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 14 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 14 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 13 ms. Remains 487 /487 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
[2023-03-11 00:18:56] [INFO ] Invariant cache hit.
[2023-03-11 00:18:56] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-11 00:18:56] [INFO ] Invariant cache hit.
[2023-03-11 00:18:57] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1327 ms to find 0 implicit places.
[2023-03-11 00:18:57] [INFO ] Redundant transitions in 140 ms returned []
[2023-03-11 00:18:57] [INFO ] Invariant cache hit.
[2023-03-11 00:18:58] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1993 ms. Remains : 487/487 places, 1217/1217 transitions.
Ending property specific reduction for ASLink-PT-06a-UpperBounds-13 in 8680 ms.
[2023-03-11 00:18:58] [INFO ] Flatten gal took : 138 ms
[2023-03-11 00:18:58] [INFO ] Applying decomposition
[2023-03-11 00:18:58] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1569878527748885245.txt' '-o' '/tmp/graph1569878527748885245.bin' '-w' '/tmp/graph1569878527748885245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1569878527748885245.bin' '-l' '-1' '-v' '-w' '/tmp/graph1569878527748885245.weights' '-q' '0' '-e' '0.001'
[2023-03-11 00:18:59] [INFO ] Decomposing Gal with order
[2023-03-11 00:18:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 00:18:59] [INFO ] Removed a total of 2504 redundant transitions.
[2023-03-11 00:18:59] [INFO ] Flatten gal took : 141 ms
[2023-03-11 00:18:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 34 ms.
[2023-03-11 00:18:59] [INFO ] Time to serialize gal into /tmp/UpperBounds474139744393045770.gal : 12 ms
[2023-03-11 00:18:59] [INFO ] Time to serialize properties into /tmp/UpperBounds10424049783851781679.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds474139744393045770.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10424049783851781679.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds10424049783851781679.prop.
Detected timeout of ITS tools.
[2023-03-11 00:39:55] [INFO ] Applying decomposition
[2023-03-11 00:39:56] [INFO ] Flatten gal took : 67 ms
[2023-03-11 00:39:56] [INFO ] Decomposing Gal with order
[2023-03-11 00:39:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 00:39:56] [INFO ] Removed a total of 2285 redundant transitions.
[2023-03-11 00:39:56] [INFO ] Flatten gal took : 129 ms
[2023-03-11 00:39:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 436 labels/synchronizations in 25 ms.
[2023-03-11 00:39:56] [INFO ] Time to serialize gal into /tmp/UpperBounds9042138579476013890.gal : 6 ms
[2023-03-11 00:39:56] [INFO ] Time to serialize properties into /tmp/UpperBounds11260543519708556505.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9042138579476013890.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11260543519708556505.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds11260543519708556505.prop.
Detected timeout of ITS tools.
[2023-03-11 01:00:52] [INFO ] Flatten gal took : 101 ms
[2023-03-11 01:00:52] [INFO ] Input system was already deterministic with 1217 transitions.
[2023-03-11 01:00:52] [INFO ] Transformed 487 places.
[2023-03-11 01:00:52] [INFO ] Transformed 1217 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 01:00:52] [INFO ] Time to serialize gal into /tmp/UpperBounds12986530365851199065.gal : 15 ms
[2023-03-11 01:00:52] [INFO ] Time to serialize properties into /tmp/UpperBounds457561674897925884.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12986530365851199065.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds457561674897925884.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds457561674897925884.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 136620 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16246932 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-06a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r005-oct2-167813592600093"
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 ;