Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r021-smll-171620127800021.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ASLink-PT-02b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620127800021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 417K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716370463436

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-22 09:34:25] [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]
[2024-05-22 09:34:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 09:34:26] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2024-05-22 09:34:26] [INFO ] Transformed 1242 places.
[2024-05-22 09:34:26] [INFO ] Transformed 1621 transitions.
[2024-05-22 09:34:26] [INFO ] Found NUPN structural information;
[2024-05-22 09:34:26] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1621 rows 1242 cols
[2024-05-22 09:34:26] [INFO ] Computed 121 invariants in 105 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :12
FORMULA ASLink-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
[2024-05-22 09:34:26] [INFO ] Invariant cache hit.
[2024-05-22 09:34:27] [INFO ] [Real]Absence check using 27 positive place invariants in 69 ms returned sat
[2024-05-22 09:34:27] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 55 ms returned sat
[2024-05-22 09:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:34:28] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2024-05-22 09:34:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:34:29] [INFO ] [Nat]Absence check using 27 positive place invariants in 38 ms returned sat
[2024-05-22 09:34:29] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 54 ms returned sat
[2024-05-22 09:34:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:34:30] [INFO ] [Nat]Absence check using state equation in 1311 ms returned sat
[2024-05-22 09:34:31] [INFO ] Deduced a trap composed of 60 places in 772 ms of which 6 ms to minimize.
[2024-05-22 09:34:32] [INFO ] Deduced a trap composed of 42 places in 630 ms of which 2 ms to minimize.
[2024-05-22 09:34:32] [INFO ] Deduced a trap composed of 93 places in 841 ms of which 27 ms to minimize.
[2024-05-22 09:34:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2643 ms
[2024-05-22 09:34:33] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 339 ms.
[2024-05-22 09:34:33] [INFO ] Added : 5 causal constraints over 1 iterations in 621 ms. Result :unknown
[2024-05-22 09:34:34] [INFO ] [Real]Absence check using 27 positive place invariants in 35 ms returned sat
[2024-05-22 09:34:34] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 53 ms returned sat
[2024-05-22 09:34:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:34:35] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2024-05-22 09:34:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:34:36] [INFO ] [Nat]Absence check using 27 positive place invariants in 36 ms returned sat
[2024-05-22 09:34:36] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 51 ms returned sat
[2024-05-22 09:34:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:34:40] [INFO ] [Nat]Absence check using state equation in 4661 ms returned unknown
[2024-05-22 09:34:41] [INFO ] [Real]Absence check using 27 positive place invariants in 32 ms returned sat
[2024-05-22 09:34:41] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 51 ms returned sat
[2024-05-22 09:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:34:42] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2024-05-22 09:34:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:34:42] [INFO ] [Nat]Absence check using 27 positive place invariants in 35 ms returned sat
[2024-05-22 09:34:42] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 47 ms returned sat
[2024-05-22 09:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:34:47] [INFO ] [Nat]Absence check using state equation in 4665 ms returned unknown
[2024-05-22 09:34:47] [INFO ] [Real]Absence check using 27 positive place invariants in 33 ms returned sat
[2024-05-22 09:34:47] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 52 ms returned sat
[2024-05-22 09:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:34:48] [INFO ] [Real]Absence check using state equation in 1148 ms returned sat
[2024-05-22 09:34:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:34:49] [INFO ] [Nat]Absence check using 27 positive place invariants in 37 ms returned sat
[2024-05-22 09:34:49] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 51 ms returned sat
[2024-05-22 09:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:34:53] [INFO ] [Nat]Absence check using state equation in 4669 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1242 transition count 1342
Reduce places removed 279 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 1 with 293 rules applied. Total rules applied 572 place count 963 transition count 1328
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 577 place count 959 transition count 1327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 578 place count 958 transition count 1327
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 283 Pre rules applied. Total rules applied 578 place count 958 transition count 1044
Deduced a syphon composed of 283 places in 4 ms
Ensure Unique test removed 23 places
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 4 with 589 rules applied. Total rules applied 1167 place count 652 transition count 1044
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 20 rules applied. Total rules applied 1187 place count 649 transition count 1027
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1204 place count 632 transition count 1027
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1204 place count 632 transition count 1019
Deduced a syphon composed of 8 places in 5 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1228 place count 616 transition count 1019
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1228 place count 616 transition count 1011
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1244 place count 608 transition count 1011
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1282 place count 570 transition count 973
Iterating global reduction 6 with 38 rules applied. Total rules applied 1320 place count 570 transition count 973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1321 place count 570 transition count 972
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 1321 place count 570 transition count 958
Deduced a syphon composed of 14 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 29 rules applied. Total rules applied 1350 place count 555 transition count 958
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1350 place count 555 transition count 957
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1353 place count 553 transition count 957
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1356 place count 550 transition count 936
Iterating global reduction 7 with 3 rules applied. Total rules applied 1359 place count 550 transition count 936
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1359 place count 550 transition count 934
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1363 place count 548 transition count 934
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1364 place count 547 transition count 926
Iterating global reduction 7 with 1 rules applied. Total rules applied 1365 place count 547 transition count 926
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1366 place count 546 transition count 918
Iterating global reduction 7 with 1 rules applied. Total rules applied 1367 place count 546 transition count 918
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1368 place count 545 transition count 910
Iterating global reduction 7 with 1 rules applied. Total rules applied 1369 place count 545 transition count 910
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1370 place count 544 transition count 902
Iterating global reduction 7 with 1 rules applied. Total rules applied 1371 place count 544 transition count 902
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1372 place count 543 transition count 894
Iterating global reduction 7 with 1 rules applied. Total rules applied 1373 place count 543 transition count 894
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1374 place count 542 transition count 886
Iterating global reduction 7 with 1 rules applied. Total rules applied 1375 place count 542 transition count 886
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1376 place count 541 transition count 878
Iterating global reduction 7 with 1 rules applied. Total rules applied 1377 place count 541 transition count 878
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1378 place count 540 transition count 870
Iterating global reduction 7 with 1 rules applied. Total rules applied 1379 place count 540 transition count 870
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1380 place count 539 transition count 862
Iterating global reduction 7 with 1 rules applied. Total rules applied 1381 place count 539 transition count 862
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1382 place count 538 transition count 854
Iterating global reduction 7 with 1 rules applied. Total rules applied 1383 place count 538 transition count 854
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1384 place count 537 transition count 846
Iterating global reduction 7 with 1 rules applied. Total rules applied 1385 place count 537 transition count 846
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1386 place count 536 transition count 838
Iterating global reduction 7 with 1 rules applied. Total rules applied 1387 place count 536 transition count 838
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1388 place count 535 transition count 830
Iterating global reduction 7 with 1 rules applied. Total rules applied 1389 place count 535 transition count 830
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1390 place count 534 transition count 822
Iterating global reduction 7 with 1 rules applied. Total rules applied 1391 place count 534 transition count 822
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1392 place count 533 transition count 814
Iterating global reduction 7 with 1 rules applied. Total rules applied 1393 place count 533 transition count 814
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1394 place count 532 transition count 806
Iterating global reduction 7 with 1 rules applied. Total rules applied 1395 place count 532 transition count 806
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 7 with 128 rules applied. Total rules applied 1523 place count 468 transition count 742
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1524 place count 467 transition count 741
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 1526 place count 466 transition count 741
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1527 place count 465 transition count 740
Iterating global reduction 7 with 1 rules applied. Total rules applied 1528 place count 465 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1530 place count 465 transition count 738
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1531 place count 464 transition count 738
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1533 place count 463 transition count 747
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1536 place count 463 transition count 744
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1539 place count 460 transition count 744
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1540 place count 460 transition count 743
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1541 place count 459 transition count 743
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1542 place count 458 transition count 742
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 1548 place count 454 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1550 place count 452 transition count 740
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 6 Pre rules applied. Total rules applied 1550 place count 452 transition count 734
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 13 with 12 rules applied. Total rules applied 1562 place count 446 transition count 734
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 1565 place count 443 transition count 734
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1565 place count 443 transition count 733
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1567 place count 442 transition count 733
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 14 with 8 rules applied. Total rules applied 1575 place count 438 transition count 729
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1577 place count 436 transition count 727
Iterating global reduction 14 with 2 rules applied. Total rules applied 1579 place count 436 transition count 727
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1581 place count 436 transition count 725
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1583 place count 434 transition count 725
Applied a total of 1583 rules in 1172 ms. Remains 434 /1242 variables (removed 808) and now considering 725/1621 (removed 896) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1172 ms. Remains : 434/1242 places, 725/1621 transitions.
// Phase 1: matrix 725 rows 434 cols
[2024-05-22 09:34:55] [INFO ] Computed 77 invariants in 15 ms
Incomplete random walk after 1000000 steps, including 16236 resets, run finished after 2048 ms. (steps per millisecond=488 ) properties (out of 4) seen :2
FORMULA ASLink-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 5536 resets, run finished after 983 ms. (steps per millisecond=1017 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5543 resets, run finished after 987 ms. (steps per millisecond=1013 ) properties (out of 2) seen :0
[2024-05-22 09:34:59] [INFO ] Invariant cache hit.
[2024-05-22 09:34:59] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-22 09:34:59] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 22 ms returned sat
[2024-05-22 09:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:34:59] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2024-05-22 09:34:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:34:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-22 09:34:59] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 22 ms returned sat
[2024-05-22 09:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:00] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2024-05-22 09:35:00] [INFO ] Computed and/alt/rep : 285/1153/285 causal constraints (skipped 423 transitions) in 63 ms.
[2024-05-22 09:35:02] [INFO ] Added : 163 causal constraints over 33 iterations in 2075 ms. Result :sat
Minimization took 353 ms.
[2024-05-22 09:35:02] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-22 09:35:02] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 23 ms returned sat
[2024-05-22 09:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:03] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2024-05-22 09:35:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:35:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-22 09:35:03] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 22 ms returned sat
[2024-05-22 09:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:03] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2024-05-22 09:35:03] [INFO ] Computed and/alt/rep : 285/1153/285 causal constraints (skipped 423 transitions) in 71 ms.
[2024-05-22 09:35:05] [INFO ] Deduced a trap composed of 134 places in 291 ms of which 1 ms to minimize.
[2024-05-22 09:35:06] [INFO ] Deduced a trap composed of 135 places in 228 ms of which 1 ms to minimize.
[2024-05-22 09:35:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 669 ms
[2024-05-22 09:35:06] [INFO ] Added : 161 causal constraints over 33 iterations in 2447 ms. Result :sat
Minimization took 464 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 725/725 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 434 transition count 723
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 432 transition count 723
Applied a total of 4 rules in 23 ms. Remains 432 /434 variables (removed 2) and now considering 723/725 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 432/434 places, 723/725 transitions.
// Phase 1: matrix 723 rows 432 cols
[2024-05-22 09:35:07] [INFO ] Computed 77 invariants in 12 ms
Incomplete random walk after 1000000 steps, including 16228 resets, run finished after 1912 ms. (steps per millisecond=523 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5544 resets, run finished after 949 ms. (steps per millisecond=1053 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5532 resets, run finished after 956 ms. (steps per millisecond=1046 ) properties (out of 2) seen :0
[2024-05-22 09:35:11] [INFO ] Invariant cache hit.
[2024-05-22 09:35:11] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-22 09:35:11] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 23 ms returned sat
[2024-05-22 09:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:11] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2024-05-22 09:35:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:35:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-22 09:35:11] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 22 ms returned sat
[2024-05-22 09:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:12] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2024-05-22 09:35:12] [INFO ] Computed and/alt/rep : 275/1072/275 causal constraints (skipped 431 transitions) in 53 ms.
[2024-05-22 09:35:14] [INFO ] Added : 217 causal constraints over 44 iterations in 2639 ms. Result :sat
Minimization took 275 ms.
[2024-05-22 09:35:15] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-22 09:35:15] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 21 ms returned sat
[2024-05-22 09:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:15] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2024-05-22 09:35:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:35:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-22 09:35:15] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 21 ms returned sat
[2024-05-22 09:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:16] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2024-05-22 09:35:16] [INFO ] Computed and/alt/rep : 275/1072/275 causal constraints (skipped 431 transitions) in 50 ms.
[2024-05-22 09:35:17] [INFO ] Added : 148 causal constraints over 30 iterations in 1610 ms. Result :sat
Minimization took 381 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 723/723 transitions.
Applied a total of 0 rules in 15 ms. Remains 432 /432 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 432/432 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 723/723 transitions.
Applied a total of 0 rules in 15 ms. Remains 432 /432 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-05-22 09:35:19] [INFO ] Invariant cache hit.
[2024-05-22 09:35:20] [INFO ] Implicit Places using invariants in 560 ms returned [1, 18, 19, 31, 48, 66, 136, 140, 151, 152, 154, 171, 189, 258, 262, 263, 266, 277, 278, 279, 297, 299, 303, 321, 322, 323, 324, 336, 342, 348, 354, 360, 366, 372, 378, 384, 390, 396]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 563 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 394/432 places, 723/723 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 394 transition count 660
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 129 place count 331 transition count 657
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 330 transition count 657
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 130 place count 330 transition count 642
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 161 place count 314 transition count 642
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 173 place count 310 transition count 634
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 181 place count 302 transition count 634
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 196 place count 287 transition count 619
Iterating global reduction 5 with 15 rules applied. Total rules applied 211 place count 287 transition count 619
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 214 place count 287 transition count 616
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 214 place count 287 transition count 615
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 216 place count 286 transition count 615
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 219 place count 283 transition count 609
Iterating global reduction 6 with 3 rules applied. Total rules applied 222 place count 283 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 223 place count 282 transition count 608
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 282 transition count 608
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 225 place count 281 transition count 606
Iterating global reduction 6 with 1 rules applied. Total rules applied 226 place count 281 transition count 606
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 268 place count 260 transition count 585
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 270 place count 258 transition count 583
Iterating global reduction 6 with 2 rules applied. Total rules applied 272 place count 258 transition count 583
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 274 place count 258 transition count 581
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 278 place count 256 transition count 582
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 282 place count 256 transition count 578
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 287 place count 251 transition count 578
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 293 place count 251 transition count 578
Applied a total of 293 rules in 102 ms. Remains 251 /394 variables (removed 143) and now considering 578/723 (removed 145) transitions.
// Phase 1: matrix 578 rows 251 cols
[2024-05-22 09:35:20] [INFO ] Computed 33 invariants in 6 ms
[2024-05-22 09:35:20] [INFO ] Implicit Places using invariants in 272 ms returned [72, 90, 96, 99, 101, 106, 107, 159, 176, 182, 185, 187]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 274 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 239/432 places, 578/723 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 233 transition count 572
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 233 transition count 572
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 231 transition count 570
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 231 transition count 570
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 227 transition count 566
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 227 transition count 560
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 221 transition count 560
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 221 transition count 558
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 219 transition count 558
Applied a total of 40 rules in 44 ms. Remains 219 /239 variables (removed 20) and now considering 558/578 (removed 20) transitions.
// Phase 1: matrix 558 rows 219 cols
[2024-05-22 09:35:20] [INFO ] Computed 21 invariants in 5 ms
[2024-05-22 09:35:20] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-22 09:35:20] [INFO ] Invariant cache hit.
[2024-05-22 09:35:21] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 219/432 places, 558/723 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1757 ms. Remains : 219/432 places, 558/723 transitions.
Successfully produced net in file /tmp/petri1000_16019346633030099045.dot
Successfully produced net in file /tmp/petri1001_9079778104092055555.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 556 rows 219 cols
[2024-05-22 09:35:21] [INFO ] Computed 21 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 25598 resets, run finished after 1769 ms. (steps per millisecond=565 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9689 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9621 resets, run finished after 780 ms. (steps per millisecond=1282 ) properties (out of 2) seen :0
[2024-05-22 09:35:24] [INFO ] Invariant cache hit.
[2024-05-22 09:35:24] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-22 09:35:24] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 8 ms returned sat
[2024-05-22 09:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:25] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-22 09:35:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:35:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-22 09:35:25] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 7 ms returned sat
[2024-05-22 09:35:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:25] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-22 09:35:25] [INFO ] Computed and/alt/rep : 98/564/98 causal constraints (skipped 441 transitions) in 41 ms.
[2024-05-22 09:35:25] [INFO ] Added : 13 causal constraints over 3 iterations in 277 ms. Result :sat
Minimization took 80 ms.
[2024-05-22 09:35:25] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-22 09:35:25] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 8 ms returned sat
[2024-05-22 09:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:25] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-22 09:35:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:35:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-22 09:35:26] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 7 ms returned sat
[2024-05-22 09:35:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:26] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2024-05-22 09:35:26] [INFO ] Computed and/alt/rep : 98/564/98 causal constraints (skipped 441 transitions) in 37 ms.
[2024-05-22 09:35:26] [INFO ] Added : 14 causal constraints over 3 iterations in 288 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 556/556 transitions.
Graph (complete) has 1364 edges and 219 vertex of which 217 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 217 transition count 556
Applied a total of 3 rules in 20 ms. Remains 217 /219 variables (removed 2) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 217/219 places, 556/556 transitions.
// Phase 1: matrix 556 rows 217 cols
[2024-05-22 09:35:27] [INFO ] Computed 21 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 25621 resets, run finished after 1650 ms. (steps per millisecond=606 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9682 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9573 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 2) seen :0
[2024-05-22 09:35:30] [INFO ] Invariant cache hit.
[2024-05-22 09:35:30] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-22 09:35:30] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-22 09:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:30] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-22 09:35:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:35:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-22 09:35:30] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 7 ms returned sat
[2024-05-22 09:35:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:30] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2024-05-22 09:35:30] [INFO ] Computed and/alt/rep : 98/562/98 causal constraints (skipped 441 transitions) in 39 ms.
[2024-05-22 09:35:31] [INFO ] Added : 8 causal constraints over 2 iterations in 148 ms. Result :sat
Minimization took 83 ms.
[2024-05-22 09:35:31] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-22 09:35:31] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-22 09:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:31] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2024-05-22 09:35:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:35:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-22 09:35:31] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-22 09:35:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:31] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2024-05-22 09:35:31] [INFO ] Computed and/alt/rep : 98/562/98 causal constraints (skipped 441 transitions) in 37 ms.
[2024-05-22 09:35:32] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2024-05-22 09:35:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2024-05-22 09:35:32] [INFO ] Added : 37 causal constraints over 9 iterations in 925 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 556/556 transitions.
Applied a total of 0 rules in 9 ms. Remains 217 /217 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 217/217 places, 556/556 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 556/556 transitions.
Applied a total of 0 rules in 8 ms. Remains 217 /217 variables (removed 0) and now considering 556/556 (removed 0) transitions.
[2024-05-22 09:35:33] [INFO ] Invariant cache hit.
[2024-05-22 09:35:33] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-22 09:35:33] [INFO ] Invariant cache hit.
[2024-05-22 09:35:33] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2024-05-22 09:35:34] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-22 09:35:34] [INFO ] Invariant cache hit.
[2024-05-22 09:35:34] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1405 ms. Remains : 217/217 places, 556/556 transitions.
Starting property specific reduction for ASLink-PT-02b-UpperBounds-00
[2024-05-22 09:35:34] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 279 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2024-05-22 09:35:34] [INFO ] Invariant cache hit.
[2024-05-22 09:35:34] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-22 09:35:34] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 7 ms returned sat
[2024-05-22 09:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:34] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-22 09:35:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:35:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-22 09:35:34] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 7 ms returned sat
[2024-05-22 09:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:35] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2024-05-22 09:35:35] [INFO ] Computed and/alt/rep : 98/562/98 causal constraints (skipped 441 transitions) in 36 ms.
[2024-05-22 09:35:35] [INFO ] Added : 8 causal constraints over 2 iterations in 145 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 556/556 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 216 transition count 555
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 2 with 2 rules applied. Total rules applied 4 place count 215 transition count 554
Applied a total of 4 rules in 21 ms. Remains 215 /217 variables (removed 2) and now considering 554/556 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 215/217 places, 554/556 transitions.
// Phase 1: matrix 554 rows 215 cols
[2024-05-22 09:35:35] [INFO ] Computed 21 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 25578 resets, run finished after 1586 ms. (steps per millisecond=630 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9739 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 1) seen :0
[2024-05-22 09:35:37] [INFO ] Invariant cache hit.
[2024-05-22 09:35:37] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-22 09:35:37] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 6 ms returned sat
[2024-05-22 09:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:37] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-22 09:35:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:35:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-22 09:35:38] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 7 ms returned sat
[2024-05-22 09:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:38] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2024-05-22 09:35:38] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 1 ms to minimize.
[2024-05-22 09:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2024-05-22 09:35:38] [INFO ] Computed and/alt/rep : 96/560/96 causal constraints (skipped 441 transitions) in 41 ms.
[2024-05-22 09:35:38] [INFO ] Added : 11 causal constraints over 3 iterations in 201 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 554/554 transitions.
Applied a total of 0 rules in 7 ms. Remains 215 /215 variables (removed 0) and now considering 554/554 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 215/215 places, 554/554 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 554/554 transitions.
Applied a total of 0 rules in 7 ms. Remains 215 /215 variables (removed 0) and now considering 554/554 (removed 0) transitions.
[2024-05-22 09:35:38] [INFO ] Invariant cache hit.
[2024-05-22 09:35:39] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-22 09:35:39] [INFO ] Invariant cache hit.
[2024-05-22 09:35:39] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2024-05-22 09:35:39] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-22 09:35:39] [INFO ] Invariant cache hit.
[2024-05-22 09:35:40] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1158 ms. Remains : 215/215 places, 554/554 transitions.
Ending property specific reduction for ASLink-PT-02b-UpperBounds-00 in 5669 ms.
Starting property specific reduction for ASLink-PT-02b-UpperBounds-10
// Phase 1: matrix 556 rows 217 cols
[2024-05-22 09:35:40] [INFO ] Computed 21 invariants in 6 ms
Incomplete random walk after 10000 steps, including 264 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2024-05-22 09:35:40] [INFO ] Invariant cache hit.
[2024-05-22 09:35:40] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-22 09:35:40] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 7 ms returned sat
[2024-05-22 09:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:40] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-05-22 09:35:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:35:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-22 09:35:40] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-22 09:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:40] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2024-05-22 09:35:40] [INFO ] Computed and/alt/rep : 98/562/98 causal constraints (skipped 441 transitions) in 39 ms.
[2024-05-22 09:35:41] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 1 ms to minimize.
[2024-05-22 09:35:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2024-05-22 09:35:41] [INFO ] Added : 37 causal constraints over 9 iterations in 925 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 556/556 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 216 transition count 555
Applied a total of 2 rules in 10 ms. Remains 216 /217 variables (removed 1) and now considering 555/556 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 216/217 places, 555/556 transitions.
// Phase 1: matrix 555 rows 216 cols
[2024-05-22 09:35:41] [INFO ] Computed 21 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 25498 resets, run finished after 1584 ms. (steps per millisecond=631 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9669 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 1) seen :0
[2024-05-22 09:35:44] [INFO ] Invariant cache hit.
[2024-05-22 09:35:44] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-22 09:35:44] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 6 ms returned sat
[2024-05-22 09:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:44] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-05-22 09:35:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 09:35:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-22 09:35:44] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 10 ms returned sat
[2024-05-22 09:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 09:35:44] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-05-22 09:35:44] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 37 ms.
[2024-05-22 09:35:45] [INFO ] Added : 20 causal constraints over 5 iterations in 351 ms. Result :sat
Minimization took 176 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 7 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 216/216 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 7 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2024-05-22 09:35:45] [INFO ] Invariant cache hit.
[2024-05-22 09:35:45] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-22 09:35:45] [INFO ] Invariant cache hit.
[2024-05-22 09:35:46] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
[2024-05-22 09:35:46] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-22 09:35:46] [INFO ] Invariant cache hit.
[2024-05-22 09:35:46] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1240 ms. Remains : 216/216 places, 555/555 transitions.
Ending property specific reduction for ASLink-PT-02b-UpperBounds-10 in 6753 ms.
[2024-05-22 09:35:47] [INFO ] Flatten gal took : 127 ms
[2024-05-22 09:35:47] [INFO ] Applying decomposition
[2024-05-22 09:35:47] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14857773685408781270.txt' '-o' '/tmp/graph14857773685408781270.bin' '-w' '/tmp/graph14857773685408781270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14857773685408781270.bin' '-l' '-1' '-v' '-w' '/tmp/graph14857773685408781270.weights' '-q' '0' '-e' '0.001'
[2024-05-22 09:35:47] [INFO ] Decomposing Gal with order
[2024-05-22 09:35:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 09:35:47] [INFO ] Removed a total of 1141 redundant transitions.
[2024-05-22 09:35:47] [INFO ] Flatten gal took : 138 ms
[2024-05-22 09:35:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 14 ms.
[2024-05-22 09:35:47] [INFO ] Time to serialize gal into /tmp/UpperBounds5309054165236817267.gal : 11 ms
[2024-05-22 09:35:47] [INFO ] Time to serialize properties into /tmp/UpperBounds18000247996448581599.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5309054165236817267.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18000247996448581599.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds18000247996448581599.prop.
Detected timeout of ITS tools.
[2024-05-22 09:56:15] [INFO ] Applying decomposition
[2024-05-22 09:56:15] [INFO ] Flatten gal took : 50 ms
[2024-05-22 09:56:15] [INFO ] Decomposing Gal with order
[2024-05-22 09:56:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 09:56:15] [INFO ] Removed a total of 1027 redundant transitions.
[2024-05-22 09:56:15] [INFO ] Flatten gal took : 127 ms
[2024-05-22 09:56:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 399 labels/synchronizations in 18 ms.
[2024-05-22 09:56:15] [INFO ] Time to serialize gal into /tmp/UpperBounds16862602171750544386.gal : 4 ms
[2024-05-22 09:56:15] [INFO ] Time to serialize properties into /tmp/UpperBounds218330972302831971.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16862602171750544386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds218330972302831971.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds218330972302831971.prop.
Detected timeout of ITS tools.
[2024-05-22 10:16:42] [INFO ] Flatten gal took : 36 ms
[2024-05-22 10:16:42] [INFO ] Input system was already deterministic with 556 transitions.
[2024-05-22 10:16:42] [INFO ] Transformed 217 places.
[2024-05-22 10:16:42] [INFO ] Transformed 556 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
[2024-05-22 10:16:43] [INFO ] Time to serialize gal into /tmp/UpperBounds15955559670262518806.gal : 5 ms
[2024-05-22 10:16:43] [INFO ] Time to serialize properties into /tmp/UpperBounds6287793428099358865.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15955559670262518806.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6287793428099358865.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds6287793428099358865.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6647424 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103904 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-02b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ASLink-PT-02b, 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 r021-smll-171620127800021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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