Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245688700021.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 r006-tajo-165245688700021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.1K Apr 30 07:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 30 07:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 07:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 07:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 293K May 10 09:33 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 1652644603333

Running Version 202205111006
[2022-05-15 19:56:44] [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]
[2022-05-15 19:56:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:56:44] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2022-05-15 19:56:44] [INFO ] Transformed 846 places.
[2022-05-15 19:56:44] [INFO ] Transformed 1148 transitions.
[2022-05-15 19:56:44] [INFO ] Found NUPN structural information;
[2022-05-15 19:56:44] [INFO ] Parsed PT model containing 846 places and 1148 transitions in 268 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 1148 rows 846 cols
[2022-05-15 19:56:45] [INFO ] Computed 82 place invariants in 68 ms
Incomplete random walk after 10000 steps, including 69 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :15
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-11 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-06 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-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 18 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 1148 rows 846 cols
[2022-05-15 19:56:45] [INFO ] Computed 82 place invariants in 26 ms
[2022-05-15 19:56:45] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2022-05-15 19:56:45] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 21 ms returned sat
[2022-05-15 19:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:56:45] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2022-05-15 19:56:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:56:46] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2022-05-15 19:56:46] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 17 ms returned sat
[2022-05-15 19:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:56:46] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2022-05-15 19:56:46] [INFO ] Deduced a trap composed of 50 places in 319 ms of which 8 ms to minimize.
[2022-05-15 19:56:47] [INFO ] Deduced a trap composed of 98 places in 358 ms of which 2 ms to minimize.
[2022-05-15 19:56:47] [INFO ] Deduced a trap composed of 184 places in 340 ms of which 2 ms to minimize.
[2022-05-15 19:56:48] [INFO ] Deduced a trap composed of 128 places in 277 ms of which 2 ms to minimize.
[2022-05-15 19:56:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1597 ms
[2022-05-15 19:56:48] [INFO ] Computed and/alt/rep : 932/2112/932 causal constraints (skipped 215 transitions) in 98 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-15 19:56:51] [INFO ] Deduced a trap composed of 15 places in 401 ms of which 1 ms to minimize.
[2022-05-15 19:56:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 846 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 846/846 places, 1147/1147 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 2174 edges and 845 vertex of which 844 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 844 transition count 959
Reduce places removed 188 places and 1 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 198 rules applied. Total rules applied 387 place count 656 transition count 948
Reduce places removed 5 places and 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 392 place count 651 transition count 946
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 394 place count 649 transition count 944
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 396 place count 647 transition count 942
Reduce places removed 2 places and 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 5 with 3 rules applied. Total rules applied 399 place count 645 transition count 940
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 400 place count 644 transition count 940
Performed 188 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 188 Pre rules applied. Total rules applied 400 place count 644 transition count 752
Deduced a syphon composed of 188 places in 3 ms
Ensure Unique test removed 13 places
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 7 with 389 rules applied. Total rules applied 789 place count 443 transition count 752
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 7 with 11 rules applied. Total rules applied 800 place count 442 transition count 742
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 810 place count 432 transition count 742
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 810 place count 432 transition count 738
Deduced a syphon composed of 4 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 822 place count 424 transition count 738
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 822 place count 424 transition count 734
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 830 place count 420 transition count 734
Discarding 24 places :
Symmetric choice reduction at 9 with 24 rule applications. Total rules 854 place count 396 transition count 710
Iterating global reduction 9 with 24 rules applied. Total rules applied 878 place count 396 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 879 place count 396 transition count 709
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 10 Pre rules applied. Total rules applied 879 place count 396 transition count 699
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 10 with 21 rules applied. Total rules applied 900 place count 385 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 900 place count 385 transition count 698
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 903 place count 383 transition count 698
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 905 place count 381 transition count 683
Iterating global reduction 10 with 2 rules applied. Total rules applied 907 place count 381 transition count 683
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 907 place count 381 transition count 682
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 909 place count 380 transition count 682
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 910 place count 379 transition count 674
Iterating global reduction 10 with 1 rules applied. Total rules applied 911 place count 379 transition count 674
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 912 place count 378 transition count 666
Iterating global reduction 10 with 1 rules applied. Total rules applied 913 place count 378 transition count 666
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 914 place count 377 transition count 658
Iterating global reduction 10 with 1 rules applied. Total rules applied 915 place count 377 transition count 658
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 916 place count 376 transition count 650
Iterating global reduction 10 with 1 rules applied. Total rules applied 917 place count 376 transition count 650
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 918 place count 375 transition count 642
Iterating global reduction 10 with 1 rules applied. Total rules applied 919 place count 375 transition count 642
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 920 place count 374 transition count 634
Iterating global reduction 10 with 1 rules applied. Total rules applied 921 place count 374 transition count 634
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 922 place count 373 transition count 626
Iterating global reduction 10 with 1 rules applied. Total rules applied 923 place count 373 transition count 626
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 924 place count 372 transition count 618
Iterating global reduction 10 with 1 rules applied. Total rules applied 925 place count 372 transition count 618
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 926 place count 371 transition count 610
Iterating global reduction 10 with 1 rules applied. Total rules applied 927 place count 371 transition count 610
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 928 place count 370 transition count 602
Iterating global reduction 10 with 1 rules applied. Total rules applied 929 place count 370 transition count 602
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 930 place count 369 transition count 594
Iterating global reduction 10 with 1 rules applied. Total rules applied 931 place count 369 transition count 594
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 932 place count 368 transition count 586
Iterating global reduction 10 with 1 rules applied. Total rules applied 933 place count 368 transition count 586
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 934 place count 367 transition count 578
Iterating global reduction 10 with 1 rules applied. Total rules applied 935 place count 367 transition count 578
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 936 place count 366 transition count 570
Iterating global reduction 10 with 1 rules applied. Total rules applied 937 place count 366 transition count 570
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 938 place count 365 transition count 562
Iterating global reduction 10 with 1 rules applied. Total rules applied 939 place count 365 transition count 562
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 940 place count 364 transition count 554
Iterating global reduction 10 with 1 rules applied. Total rules applied 941 place count 364 transition count 554
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 10 with 84 rules applied. Total rules applied 1025 place count 322 transition count 512
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1026 place count 321 transition count 511
Ensure Unique test removed 1 places
Iterating global reduction 10 with 2 rules applied. Total rules applied 1028 place count 320 transition count 511
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1029 place count 319 transition count 510
Iterating global reduction 10 with 1 rules applied. Total rules applied 1030 place count 319 transition count 510
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 10 with 2 rules applied. Total rules applied 1032 place count 319 transition count 508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1033 place count 318 transition count 508
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1035 place count 317 transition count 516
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1037 place count 317 transition count 514
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1039 place count 315 transition count 514
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1040 place count 314 transition count 513
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 13 with 3 rules applied. Total rules applied 1043 place count 312 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1044 place count 311 transition count 512
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 3 Pre rules applied. Total rules applied 1044 place count 311 transition count 509
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 7 rules applied. Total rules applied 1051 place count 307 transition count 509
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 15 with 2 rules applied. Total rules applied 1053 place count 305 transition count 509
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 1053 place count 305 transition count 508
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 1055 place count 304 transition count 508
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 16 with 6 rules applied. Total rules applied 1061 place count 301 transition count 505
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1062 place count 300 transition count 504
Iterating global reduction 16 with 1 rules applied. Total rules applied 1063 place count 300 transition count 504
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1064 place count 300 transition count 503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1065 place count 299 transition count 503
Applied a total of 1065 rules in 601 ms. Remains 299 /846 variables (removed 547) and now considering 503/1147 (removed 644) transitions.
Finished structural reductions, in 1 iterations. Remains : 299/846 places, 503/1147 transitions.
// Phase 1: matrix 503 rows 299 cols
[2022-05-15 19:56:52] [INFO ] Computed 54 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 21489 resets, run finished after 1380 ms. (steps per millisecond=724 ) properties (out of 1) seen :1
FORMULA ASLink-PT-01b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8769 ms.

BK_STOP 1652644613475

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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 r006-tajo-165245688700021"
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 ;