Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592500021.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ASLink-PT-01b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592500021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 293K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-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 1678485911365

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-10 22:05:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 22:05:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:05:13] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-10 22:05:13] [INFO ] Transformed 846 places.
[2023-03-10 22:05:13] [INFO ] Transformed 1148 transitions.
[2023-03-10 22:05:13] [INFO ] Found NUPN structural information;
[2023-03-10 22:05:13] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1148 rows 846 cols
[2023-03-10 22:05:14] [INFO ] Computed 82 place invariants in 59 ms
Incomplete random walk after 10000 steps, including 54 resets, run finished after 69 ms. (steps per millisecond=144 ) 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-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-10 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 10000 steps, including 19 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 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
[2023-03-10 22:05:14] [INFO ] Invariant cache hit.
[2023-03-10 22:05:14] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2023-03-10 22:05:14] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 77 ms returned sat
[2023-03-10 22:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:05:15] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2023-03-10 22:05:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:05:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-10 22:05:16] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 28 ms returned sat
[2023-03-10 22:05:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:05:16] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2023-03-10 22:05:17] [INFO ] Deduced a trap composed of 144 places in 467 ms of which 17 ms to minimize.
[2023-03-10 22:05:17] [INFO ] Deduced a trap composed of 156 places in 377 ms of which 1 ms to minimize.
[2023-03-10 22:05:17] [INFO ] Deduced a trap composed of 186 places in 358 ms of which 2 ms to minimize.
[2023-03-10 22:05:19] [INFO ] Deduced a trap composed of 24 places in 813 ms of which 1 ms to minimize.
[2023-03-10 22:05:19] [INFO ] Deduced a trap composed of 34 places in 625 ms of which 1 ms to minimize.
[2023-03-10 22:05:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3509 ms
[2023-03-10 22:05:20] [INFO ] Computed and/alt/rep : 932/2112/932 causal constraints (skipped 215 transitions) in 87 ms.
[2023-03-10 22:05:20] [INFO ] Added : 30 causal constraints over 6 iterations in 763 ms. Result :unknown
[2023-03-10 22:05:21] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-10 22:05:21] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 21 ms returned sat
[2023-03-10 22:05:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:05:21] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2023-03-10 22:05:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:05:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-10 22:05:21] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 36 ms returned sat
[2023-03-10 22:05:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:05:22] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-10 22:05:22] [INFO ] Computed and/alt/rep : 932/2112/932 causal constraints (skipped 215 transitions) in 91 ms.
[2023-03-10 22:05:26] [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: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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, 1] Max seen :[0, 0]
Support contains 2 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 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 187 rules applied. Total rules applied 187 place count 846 transition count 961
Reduce places removed 187 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 197 rules applied. Total rules applied 384 place count 659 transition count 951
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 387 place count 656 transition count 951
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 387 place count 656 transition count 760
Deduced a syphon composed of 191 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 395 rules applied. Total rules applied 782 place count 452 transition count 760
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 3 with 11 rules applied. Total rules applied 793 place count 451 transition count 750
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 803 place count 441 transition count 750
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 803 place count 441 transition count 746
Deduced a syphon composed of 4 places in 5 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 815 place count 433 transition count 746
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 815 place count 433 transition count 742
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 823 place count 429 transition count 742
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 848 place count 404 transition count 717
Iterating global reduction 5 with 25 rules applied. Total rules applied 873 place count 404 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 874 place count 404 transition count 716
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 874 place count 404 transition count 706
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 895 place count 393 transition count 706
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 895 place count 393 transition count 705
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 6 with 3 rules applied. Total rules applied 898 place count 391 transition count 705
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 900 place count 389 transition count 690
Iterating global reduction 6 with 2 rules applied. Total rules applied 902 place count 389 transition count 690
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 902 place count 389 transition count 689
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 904 place count 388 transition count 689
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 905 place count 387 transition count 681
Iterating global reduction 6 with 1 rules applied. Total rules applied 906 place count 387 transition count 681
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 907 place count 386 transition count 673
Iterating global reduction 6 with 1 rules applied. Total rules applied 908 place count 386 transition count 673
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 909 place count 385 transition count 665
Iterating global reduction 6 with 1 rules applied. Total rules applied 910 place count 385 transition count 665
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 911 place count 384 transition count 657
Iterating global reduction 6 with 1 rules applied. Total rules applied 912 place count 384 transition count 657
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 913 place count 383 transition count 649
Iterating global reduction 6 with 1 rules applied. Total rules applied 914 place count 383 transition count 649
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 915 place count 382 transition count 641
Iterating global reduction 6 with 1 rules applied. Total rules applied 916 place count 382 transition count 641
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 917 place count 381 transition count 633
Iterating global reduction 6 with 1 rules applied. Total rules applied 918 place count 381 transition count 633
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 919 place count 380 transition count 625
Iterating global reduction 6 with 1 rules applied. Total rules applied 920 place count 380 transition count 625
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 921 place count 379 transition count 617
Iterating global reduction 6 with 1 rules applied. Total rules applied 922 place count 379 transition count 617
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 923 place count 378 transition count 609
Iterating global reduction 6 with 1 rules applied. Total rules applied 924 place count 378 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 925 place count 377 transition count 601
Iterating global reduction 6 with 1 rules applied. Total rules applied 926 place count 377 transition count 601
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 927 place count 376 transition count 593
Iterating global reduction 6 with 1 rules applied. Total rules applied 928 place count 376 transition count 593
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 929 place count 375 transition count 585
Iterating global reduction 6 with 1 rules applied. Total rules applied 930 place count 375 transition count 585
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 931 place count 374 transition count 577
Iterating global reduction 6 with 1 rules applied. Total rules applied 932 place count 374 transition count 577
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 933 place count 373 transition count 569
Iterating global reduction 6 with 1 rules applied. Total rules applied 934 place count 373 transition count 569
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 935 place count 372 transition count 561
Iterating global reduction 6 with 1 rules applied. Total rules applied 936 place count 372 transition count 561
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 1020 place count 330 transition count 519
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1021 place count 329 transition count 518
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 1023 place count 328 transition count 518
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1024 place count 327 transition count 517
Iterating global reduction 6 with 1 rules applied. Total rules applied 1025 place count 327 transition count 517
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 1027 place count 327 transition count 515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1028 place count 326 transition count 515
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 1030 place count 325 transition count 524
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1032 place count 325 transition count 522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1034 place count 323 transition count 522
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1035 place count 322 transition count 521
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 9 with 3 rules applied. Total rules applied 1038 place count 320 transition count 520
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1039 place count 319 transition count 520
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 1039 place count 319 transition count 517
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 11 with 7 rules applied. Total rules applied 1046 place count 315 transition count 517
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 11 with 2 rules applied. Total rules applied 1048 place count 313 transition count 517
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1048 place count 313 transition count 516
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1050 place count 312 transition count 516
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 1056 place count 309 transition count 513
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1057 place count 308 transition count 512
Iterating global reduction 12 with 1 rules applied. Total rules applied 1058 place count 308 transition count 512
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1059 place count 308 transition count 511
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1060 place count 307 transition count 511
Applied a total of 1060 rules in 520 ms. Remains 307 /846 variables (removed 539) and now considering 511/1148 (removed 637) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 520 ms. Remains : 307/846 places, 511/1148 transitions.
// Phase 1: matrix 511 rows 307 cols
[2023-03-10 22:05:27] [INFO ] Computed 56 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 21392 resets, run finished after 1595 ms. (steps per millisecond=626 ) properties (out of 2) seen :2
FORMULA ASLink-PT-01b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15653 ms.

BK_STOP 1678485929653

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-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-5348"
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 r005-oct2-167813592500021"
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 ;