fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037989400021
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ASLink-PT-01b

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989400021.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-01b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989400021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 293K May 5 16:51 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-01b-UpperBounds-00
FORMULA_NAME ASLink-PT-01b-UpperBounds-01
FORMULA_NAME ASLink-PT-01b-UpperBounds-02
FORMULA_NAME ASLink-PT-01b-UpperBounds-03
FORMULA_NAME ASLink-PT-01b-UpperBounds-04
FORMULA_NAME ASLink-PT-01b-UpperBounds-05
FORMULA_NAME ASLink-PT-01b-UpperBounds-06
FORMULA_NAME ASLink-PT-01b-UpperBounds-07
FORMULA_NAME ASLink-PT-01b-UpperBounds-08
FORMULA_NAME ASLink-PT-01b-UpperBounds-09
FORMULA_NAME ASLink-PT-01b-UpperBounds-10
FORMULA_NAME ASLink-PT-01b-UpperBounds-11
FORMULA_NAME ASLink-PT-01b-UpperBounds-12
FORMULA_NAME ASLink-PT-01b-UpperBounds-13
FORMULA_NAME ASLink-PT-01b-UpperBounds-14
FORMULA_NAME ASLink-PT-01b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620391909185

Running Version 0
[2021-05-07 12:51:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-07 12:51:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 12:51:51] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2021-05-07 12:51:51] [INFO ] Transformed 846 places.
[2021-05-07 12:51:51] [INFO ] Transformed 1148 transitions.
[2021-05-07 12:51:51] [INFO ] Found NUPN structural information;
[2021-05-07 12:51:51] [INFO ] Parsed PT model containing 846 places and 1148 transitions in 145 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1148 rows 846 cols
[2021-05-07 12:51:51] [INFO ] Computed 82 place invariants in 62 ms
Incomplete random walk after 10000 steps, including 59 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :14
FORMULA ASLink-PT-01b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
FORMULA ASLink-PT-01b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1148 rows 846 cols
[2021-05-07 12:51:51] [INFO ] Computed 82 place invariants in 32 ms
[2021-05-07 12:51:51] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2021-05-07 12:51:51] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 19 ms returned sat
[2021-05-07 12:51:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:51:52] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2021-05-07 12:51:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:51:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:51:52] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 18 ms returned sat
[2021-05-07 12:51:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:51:53] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2021-05-07 12:51:53] [INFO ] Deduced a trap composed of 93 places in 320 ms of which 7 ms to minimize.
[2021-05-07 12:51:53] [INFO ] Deduced a trap composed of 74 places in 258 ms of which 2 ms to minimize.
[2021-05-07 12:51:54] [INFO ] Deduced a trap composed of 88 places in 189 ms of which 1 ms to minimize.
[2021-05-07 12:51:54] [INFO ] Deduced a trap composed of 28 places in 268 ms of which 1 ms to minimize.
[2021-05-07 12:51:54] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 0 ms to minimize.
[2021-05-07 12:51:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1468 ms
[2021-05-07 12:51:54] [INFO ] Computed and/alt/rep : 932/2112/932 causal constraints (skipped 215 transitions) in 86 ms.
[2021-05-07 12:51:57] [INFO ] Added : 5 causal constraints over 1 iterations in 2821 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 46300 steps, including 850 resets, run finished after 185 ms. (steps per millisecond=250 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 846 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 846/846 places, 1147/1147 transitions.
Drop transitions removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 846 transition count 958
Reduce places removed 189 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 199 rules applied. Total rules applied 388 place count 657 transition count 948
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 391 place count 654 transition count 948
Performed 189 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 189 Pre rules applied. Total rules applied 391 place count 654 transition count 759
Deduced a syphon composed of 189 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 3 with 391 rules applied. Total rules applied 782 place count 452 transition count 759
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 13 rules applied. Total rules applied 795 place count 450 transition count 748
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 806 place count 439 transition count 748
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 806 place count 439 transition count 744
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 818 place count 431 transition count 744
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 818 place count 431 transition count 740
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 826 place count 427 transition count 740
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 851 place count 402 transition count 715
Iterating global reduction 5 with 25 rules applied. Total rules applied 876 place count 402 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 877 place count 402 transition count 714
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 877 place count 402 transition count 704
Deduced a syphon composed of 10 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 21 rules applied. Total rules applied 898 place count 391 transition count 704
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 898 place count 391 transition count 703
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 901 place count 389 transition count 703
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 903 place count 387 transition count 688
Iterating global reduction 6 with 2 rules applied. Total rules applied 905 place count 387 transition count 688
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 905 place count 387 transition count 687
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 907 place count 386 transition count 687
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 908 place count 385 transition count 679
Iterating global reduction 6 with 1 rules applied. Total rules applied 909 place count 385 transition count 679
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 910 place count 384 transition count 671
Iterating global reduction 6 with 1 rules applied. Total rules applied 911 place count 384 transition count 671
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 912 place count 383 transition count 663
Iterating global reduction 6 with 1 rules applied. Total rules applied 913 place count 383 transition count 663
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 914 place count 382 transition count 655
Iterating global reduction 6 with 1 rules applied. Total rules applied 915 place count 382 transition count 655
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 916 place count 381 transition count 647
Iterating global reduction 6 with 1 rules applied. Total rules applied 917 place count 381 transition count 647
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 918 place count 380 transition count 639
Iterating global reduction 6 with 1 rules applied. Total rules applied 919 place count 380 transition count 639
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 920 place count 379 transition count 631
Iterating global reduction 6 with 1 rules applied. Total rules applied 921 place count 379 transition count 631
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 922 place count 378 transition count 623
Iterating global reduction 6 with 1 rules applied. Total rules applied 923 place count 378 transition count 623
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 924 place count 377 transition count 615
Iterating global reduction 6 with 1 rules applied. Total rules applied 925 place count 377 transition count 615
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 926 place count 376 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 927 place count 376 transition count 607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 928 place count 375 transition count 599
Iterating global reduction 6 with 1 rules applied. Total rules applied 929 place count 375 transition count 599
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 930 place count 374 transition count 591
Iterating global reduction 6 with 1 rules applied. Total rules applied 931 place count 374 transition count 591
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 932 place count 373 transition count 583
Iterating global reduction 6 with 1 rules applied. Total rules applied 933 place count 373 transition count 583
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 934 place count 372 transition count 575
Iterating global reduction 6 with 1 rules applied. Total rules applied 935 place count 372 transition count 575
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 936 place count 371 transition count 567
Iterating global reduction 6 with 1 rules applied. Total rules applied 937 place count 371 transition count 567
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 938 place count 370 transition count 559
Iterating global reduction 6 with 1 rules applied. Total rules applied 939 place count 370 transition count 559
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 1023 place count 328 transition count 517
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1024 place count 327 transition count 516
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 1026 place count 326 transition count 516
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1027 place count 325 transition count 515
Iterating global reduction 6 with 1 rules applied. Total rules applied 1028 place count 325 transition count 515
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 6 with 2 rules applied. Total rules applied 1030 place count 325 transition count 513
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1031 place count 324 transition count 513
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1033 place count 323 transition count 522
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1035 place count 323 transition count 520
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1037 place count 321 transition count 520
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1038 place count 321 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1039 place count 320 transition count 519
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1040 place count 319 transition count 518
Reduce places removed 2 places and 0 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 10 with 3 rules applied. Total rules applied 1043 place count 317 transition count 517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1044 place count 316 transition count 517
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 1044 place count 316 transition count 514
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 7 rules applied. Total rules applied 1051 place count 312 transition count 514
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 12 with 2 rules applied. Total rules applied 1053 place count 310 transition count 514
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1053 place count 310 transition count 513
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1055 place count 309 transition count 513
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 1061 place count 306 transition count 510
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1062 place count 305 transition count 509
Iterating global reduction 13 with 1 rules applied. Total rules applied 1063 place count 305 transition count 509
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1064 place count 305 transition count 508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1065 place count 304 transition count 508
Applied a total of 1065 rules in 550 ms. Remains 304 /846 variables (removed 542) and now considering 508/1147 (removed 639) transitions.
Finished structural reductions, in 1 iterations. Remains : 304/846 places, 508/1147 transitions.
// Phase 1: matrix 508 rows 304 cols
[2021-05-07 12:51:58] [INFO ] Computed 55 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 21303 resets, run finished after 2308 ms. (steps per millisecond=433 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9240 resets, run finished after 1214 ms. (steps per millisecond=823 ) properties (out of 1) seen :0
// Phase 1: matrix 508 rows 304 cols
[2021-05-07 12:52:01] [INFO ] Computed 55 place invariants in 5 ms
[2021-05-07 12:52:01] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2021-05-07 12:52:01] [INFO ] [Real]Absence check using 17 positive and 38 generalized place invariants in 8 ms returned sat
[2021-05-07 12:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:01] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-07 12:52:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:52:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2021-05-07 12:52:01] [INFO ] [Nat]Absence check using 17 positive and 38 generalized place invariants in 7 ms returned sat
[2021-05-07 12:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:02] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-07 12:52:02] [INFO ] Computed and/alt/rep : 186/744/186 causal constraints (skipped 309 transitions) in 40 ms.
[2021-05-07 12:52:02] [INFO ] Added : 62 causal constraints over 13 iterations in 475 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 55200 steps, including 1002 resets, run finished after 217 ms. (steps per millisecond=254 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 304 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 304/304 places, 508/508 transitions.
Applied a total of 0 rules in 10 ms. Remains 304 /304 variables (removed 0) and now considering 508/508 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 304/304 places, 508/508 transitions.
Starting structural reductions, iteration 0 : 304/304 places, 508/508 transitions.
Applied a total of 0 rules in 9 ms. Remains 304 /304 variables (removed 0) and now considering 508/508 (removed 0) transitions.
// Phase 1: matrix 508 rows 304 cols
[2021-05-07 12:52:03] [INFO ] Computed 55 place invariants in 6 ms
[2021-05-07 12:52:03] [INFO ] Implicit Places using invariants in 240 ms returned [1, 18, 29, 46, 64, 133, 137, 138, 149, 150, 151, 169, 171, 175, 193, 194, 195, 196, 208, 214, 220, 226, 232, 238, 244, 250, 256, 262, 268]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 244 ms to find 29 implicit places.
[2021-05-07 12:52:03] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 508 rows 275 cols
[2021-05-07 12:52:03] [INFO ] Computed 26 place invariants in 5 ms
[2021-05-07 12:52:03] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Starting structural reductions, iteration 1 : 275/304 places, 508/508 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 275 transition count 461
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 228 transition count 460
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 95 place count 228 transition count 450
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 116 place count 217 transition count 450
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 2 with 12 rules applied. Total rules applied 128 place count 213 transition count 442
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 136 place count 205 transition count 442
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 151 place count 190 transition count 427
Iterating global reduction 4 with 15 rules applied. Total rules applied 166 place count 190 transition count 427
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 169 place count 190 transition count 424
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 169 place count 190 transition count 423
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 189 transition count 423
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 174 place count 186 transition count 417
Iterating global reduction 5 with 3 rules applied. Total rules applied 177 place count 186 transition count 417
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 178 place count 185 transition count 416
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 185 transition count 416
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 180 place count 184 transition count 414
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 184 transition count 414
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 209 place count 170 transition count 400
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 169 transition count 399
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 169 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 212 place count 169 transition count 398
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 216 place count 167 transition count 399
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 217 place count 167 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 218 place count 166 transition count 398
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 221 place count 166 transition count 395
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 225 place count 162 transition count 395
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 228 place count 162 transition count 395
Applied a total of 228 rules in 65 ms. Remains 162 /275 variables (removed 113) and now considering 395/508 (removed 113) transitions.
// Phase 1: matrix 395 rows 162 cols
[2021-05-07 12:52:03] [INFO ] Computed 20 place invariants in 4 ms
[2021-05-07 12:52:03] [INFO ] Implicit Places using invariants in 103 ms returned [72, 89, 95, 98, 100]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 105 ms to find 5 implicit places.
Starting structural reductions, iteration 2 : 157/304 places, 395/508 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 154 transition count 392
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 154 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 153 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 153 transition count 391
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 151 transition count 389
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 151 transition count 386
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 18 place count 148 transition count 386
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 148 transition count 385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 147 transition count 385
Applied a total of 20 rules in 27 ms. Remains 147 /157 variables (removed 10) and now considering 385/395 (removed 10) transitions.
// Phase 1: matrix 385 rows 147 cols
[2021-05-07 12:52:03] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-07 12:52:03] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 385 rows 147 cols
[2021-05-07 12:52:03] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-07 12:52:04] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 147/304 places, 385/508 transitions.
Successfully produced net in file /tmp/petri1000_12673562287538437281.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 384 rows 147 cols
[2021-05-07 12:52:04] [INFO ] Computed 15 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 31804 resets, run finished after 1954 ms. (steps per millisecond=511 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 15589 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 1) seen :0
// Phase 1: matrix 384 rows 147 cols
[2021-05-07 12:52:07] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-07 12:52:07] [INFO ] [Real]Absence check using 7 positive place invariants in 30 ms returned sat
[2021-05-07 12:52:07] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 26 ms returned sat
[2021-05-07 12:52:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:07] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-07 12:52:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:52:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 12:52:07] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-07 12:52:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:07] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-07 12:52:07] [INFO ] Computed and/alt/rep : 73/446/73 causal constraints (skipped 298 transitions) in 86 ms.
[2021-05-07 12:52:07] [INFO ] Added : 19 causal constraints over 5 iterations in 255 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 33100 steps, including 1766 resets, run finished after 69 ms. (steps per millisecond=479 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 384/384 transitions.
Graph (complete) has 940 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 146 transition count 384
Applied a total of 2 rules in 15 ms. Remains 146 /147 variables (removed 1) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/147 places, 384/384 transitions.
// Phase 1: matrix 384 rows 146 cols
[2021-05-07 12:52:07] [INFO ] Computed 15 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 31868 resets, run finished after 2232 ms. (steps per millisecond=448 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 15529 resets, run finished after 1076 ms. (steps per millisecond=929 ) properties (out of 1) seen :0
// Phase 1: matrix 384 rows 146 cols
[2021-05-07 12:52:11] [INFO ] Computed 15 place invariants in 6 ms
[2021-05-07 12:52:11] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-07 12:52:11] [INFO ] [Real]Absence check using 5 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-07 12:52:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:11] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-07 12:52:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:52:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-07 12:52:11] [INFO ] [Nat]Absence check using 5 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-07 12:52:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:11] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-07 12:52:11] [INFO ] Computed and/alt/rep : 73/445/73 causal constraints (skipped 298 transitions) in 24 ms.
[2021-05-07 12:52:12] [INFO ] Added : 18 causal constraints over 5 iterations in 969 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 38200 steps, including 1794 resets, run finished after 97 ms. (steps per millisecond=393 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 146/146 places, 384/384 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 384/384 transitions.
Starting structural reductions, iteration 0 : 146/146 places, 384/384 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 146 cols
[2021-05-07 12:52:12] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-07 12:52:12] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 384 rows 146 cols
[2021-05-07 12:52:12] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-07 12:52:12] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2021-05-07 12:52:12] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 384 rows 146 cols
[2021-05-07 12:52:12] [INFO ] Computed 15 place invariants in 10 ms
[2021-05-07 12:52:13] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 384/384 transitions.
Starting property specific reduction for ASLink-PT-01b-UpperBounds-06
// Phase 1: matrix 384 rows 146 cols
[2021-05-07 12:52:13] [INFO ] Computed 15 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 340 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 159 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 384 rows 146 cols
[2021-05-07 12:52:13] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-07 12:52:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-07 12:52:13] [INFO ] [Real]Absence check using 5 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-07 12:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:13] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-07 12:52:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:52:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-07 12:52:13] [INFO ] [Nat]Absence check using 5 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-07 12:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:13] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-07 12:52:13] [INFO ] Computed and/alt/rep : 73/445/73 causal constraints (skipped 298 transitions) in 38 ms.
[2021-05-07 12:52:14] [INFO ] Added : 18 causal constraints over 5 iterations in 994 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [33] Max seen :[0]
Incomplete Parikh walk after 38200 steps, including 1780 resets, run finished after 81 ms. (steps per millisecond=471 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 146/146 places, 384/384 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 384/384 transitions.
// Phase 1: matrix 384 rows 146 cols
[2021-05-07 12:52:14] [INFO ] Computed 15 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 32347 resets, run finished after 1921 ms. (steps per millisecond=520 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 15504 resets, run finished after 1035 ms. (steps per millisecond=966 ) properties (out of 1) seen :0
// Phase 1: matrix 384 rows 146 cols
[2021-05-07 12:52:17] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-07 12:52:17] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-07 12:52:17] [INFO ] [Real]Absence check using 5 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-07 12:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:17] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-07 12:52:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:52:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-07 12:52:17] [INFO ] [Nat]Absence check using 5 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-07 12:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:17] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-07 12:52:17] [INFO ] Computed and/alt/rep : 73/445/73 causal constraints (skipped 298 transitions) in 22 ms.
[2021-05-07 12:52:18] [INFO ] Added : 18 causal constraints over 5 iterations in 964 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [33] Max seen :[0]
Incomplete Parikh walk after 38200 steps, including 1824 resets, run finished after 79 ms. (steps per millisecond=483 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 146/146 places, 384/384 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 384/384 transitions.
Starting structural reductions, iteration 0 : 146/146 places, 384/384 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 146 cols
[2021-05-07 12:52:18] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-07 12:52:19] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 384 rows 146 cols
[2021-05-07 12:52:19] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-07 12:52:19] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2021-05-07 12:52:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 384 rows 146 cols
[2021-05-07 12:52:19] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-07 12:52:19] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 384/384 transitions.
Ending property specific reduction for ASLink-PT-01b-UpperBounds-06 in 6404 ms.
[2021-05-07 12:52:19] [INFO ] Flatten gal took : 76 ms
[2021-05-07 12:52:19] [INFO ] Applying decomposition
[2021-05-07 12:52:19] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5201535156518991785.txt, -o, /tmp/graph5201535156518991785.bin, -w, /tmp/graph5201535156518991785.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5201535156518991785.bin, -l, -1, -v, -w, /tmp/graph5201535156518991785.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 12:52:19] [INFO ] Decomposing Gal with order
[2021-05-07 12:52:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 12:52:19] [INFO ] Removed a total of 700 redundant transitions.
[2021-05-07 12:52:20] [INFO ] Flatten gal took : 73 ms
[2021-05-07 12:52:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 11 ms.
[2021-05-07 12:52:20] [INFO ] Time to serialize gal into /tmp/UpperBounds9534781561273796559.gal : 6 ms
[2021-05-07 12:52:20] [INFO ] Time to serialize properties into /tmp/UpperBounds12816420933801480659.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9534781561273796559.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12816420933801480659.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds9534781561273796559.gal -t CGAL -reachable-file /tmp/UpperBounds12816420933801480659.prop --nowitness
Loading property file /tmp/UpperBounds12816420933801480659.prop.
Detected timeout of ITS tools.
[2021-05-07 13:12:29] [INFO ] Applying decomposition
[2021-05-07 13:12:29] [INFO ] Flatten gal took : 50 ms
[2021-05-07 13:12:29] [INFO ] Decomposing Gal with order
[2021-05-07 13:12:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:12:29] [INFO ] Removed a total of 700 redundant transitions.
[2021-05-07 13:12:29] [INFO ] Flatten gal took : 65 ms
[2021-05-07 13:12:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 8 ms.
[2021-05-07 13:12:29] [INFO ] Time to serialize gal into /tmp/UpperBounds10512414646922841959.gal : 2 ms
[2021-05-07 13:12:29] [INFO ] Time to serialize properties into /tmp/UpperBounds9852557583976854667.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds10512414646922841959.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9852557583976854667.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds10512414646922841959.gal -t CGAL -reachable-file /tmp/UpperBounds9852557583976854667.prop --nowitness
Loading property file /tmp/UpperBounds9852557583976854667.prop.
Detected timeout of ITS tools.
[2021-05-07 13:32:38] [INFO ] Flatten gal took : 22 ms
[2021-05-07 13:32:38] [INFO ] Input system was already deterministic with 384 transitions.
[2021-05-07 13:32:38] [INFO ] Transformed 146 places.
[2021-05-07 13:32:38] [INFO ] Transformed 384 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-07 13:32:38] [INFO ] Time to serialize gal into /tmp/UpperBounds12717119221260801404.gal : 4 ms
[2021-05-07 13:32:38] [INFO ] Time to serialize properties into /tmp/UpperBounds1791660125574751708.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds12717119221260801404.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1791660125574751708.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12717119221260801404.gal -t CGAL -reachable-file /tmp/UpperBounds1791660125574751708.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds1791660125574751708.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-01b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-01b, 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 r007-tall-162037989400021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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