About the Execution of Smart+red for ASLink-PT-01b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
830.936 | 376637.00 | 618856.00 | 49.00 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r025-oct2-167813611400013.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 smartxred
Input is ASLink-PT-01b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-oct2-167813611400013
=====================================================================
--------------------
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 booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1679005475296
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=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-01b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-16 22:24:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-16 22:24:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 22:24:37] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-16 22:24:37] [INFO ] Transformed 846 places.
[2023-03-16 22:24:37] [INFO ] Transformed 1148 transitions.
[2023-03-16 22:24:37] [INFO ] Found NUPN structural information;
[2023-03-16 22:24:37] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 201 ms.
Structural test allowed to assert that 96 places are NOT stable. Took 9 ms.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 750) seen :643
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 107) seen :0
Running SMT prover for 107 properties.
// Phase 1: matrix 1148 rows 846 cols
[2023-03-16 22:24:38] [INFO ] Computed 82 place invariants in 35 ms
[2023-03-16 22:24:41] [INFO ] After 2903ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:107
[2023-03-16 22:24:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-16 22:24:45] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 70 ms returned sat
[2023-03-16 22:24:58] [INFO ] After 9835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :107
[2023-03-16 22:24:58] [INFO ] Deduced a trap composed of 58 places in 280 ms of which 5 ms to minimize.
[2023-03-16 22:24:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2023-03-16 22:25:00] [INFO ] Deduced a trap composed of 201 places in 599 ms of which 1 ms to minimize.
[2023-03-16 22:25:00] [INFO ] Deduced a trap composed of 143 places in 273 ms of which 1 ms to minimize.
[2023-03-16 22:25:00] [INFO ] Deduced a trap composed of 135 places in 218 ms of which 1 ms to minimize.
[2023-03-16 22:25:01] [INFO ] Deduced a trap composed of 179 places in 196 ms of which 0 ms to minimize.
[2023-03-16 22:25:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1481 ms
[2023-03-16 22:25:02] [INFO ] Deduced a trap composed of 49 places in 237 ms of which 1 ms to minimize.
[2023-03-16 22:25:02] [INFO ] Deduced a trap composed of 185 places in 196 ms of which 1 ms to minimize.
[2023-03-16 22:25:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 596 ms
[2023-03-16 22:25:02] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 10 ms to minimize.
[2023-03-16 22:25:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2023-03-16 22:25:04] [INFO ] Deduced a trap composed of 65 places in 359 ms of which 0 ms to minimize.
[2023-03-16 22:25:04] [INFO ] Deduced a trap composed of 67 places in 301 ms of which 1 ms to minimize.
[2023-03-16 22:25:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 785 ms
[2023-03-16 22:25:06] [INFO ] Deduced a trap composed of 55 places in 237 ms of which 1 ms to minimize.
[2023-03-16 22:25:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2023-03-16 22:25:06] [INFO ] After 17807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :107
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 22:25:06] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :107
Fused 107 Parikh solutions to 103 different solutions.
Parikh walk visited 6 properties in 4803 ms.
Support contains 101 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 846 transition count 986
Reduce places removed 162 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 172 rules applied. Total rules applied 334 place count 684 transition count 976
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 337 place count 681 transition count 976
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 170 Pre rules applied. Total rules applied 337 place count 681 transition count 806
Deduced a syphon composed of 170 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 351 rules applied. Total rules applied 688 place count 500 transition count 806
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 9 rules applied. Total rules applied 697 place count 499 transition count 798
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 705 place count 491 transition count 798
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 705 place count 491 transition count 794
Deduced a syphon composed of 4 places in 8 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 717 place count 483 transition count 794
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 717 place count 483 transition count 790
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 725 place count 479 transition count 790
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 746 place count 458 transition count 769
Iterating global reduction 5 with 21 rules applied. Total rules applied 767 place count 458 transition count 769
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 768 place count 458 transition count 768
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 768 place count 458 transition count 760
Deduced a syphon composed of 8 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 17 rules applied. Total rules applied 785 place count 449 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 785 place count 449 transition count 759
Deduced a syphon composed of 1 places in 5 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 788 place count 447 transition count 759
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 790 place count 445 transition count 744
Iterating global reduction 6 with 2 rules applied. Total rules applied 792 place count 445 transition count 744
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 793 place count 444 transition count 736
Iterating global reduction 6 with 1 rules applied. Total rules applied 794 place count 444 transition count 736
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 795 place count 443 transition count 728
Iterating global reduction 6 with 1 rules applied. Total rules applied 796 place count 443 transition count 728
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 797 place count 442 transition count 720
Iterating global reduction 6 with 1 rules applied. Total rules applied 798 place count 442 transition count 720
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 799 place count 441 transition count 712
Iterating global reduction 6 with 1 rules applied. Total rules applied 800 place count 441 transition count 712
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 801 place count 440 transition count 704
Iterating global reduction 6 with 1 rules applied. Total rules applied 802 place count 440 transition count 704
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 803 place count 439 transition count 696
Iterating global reduction 6 with 1 rules applied. Total rules applied 804 place count 439 transition count 696
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 805 place count 438 transition count 688
Iterating global reduction 6 with 1 rules applied. Total rules applied 806 place count 438 transition count 688
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 807 place count 437 transition count 680
Iterating global reduction 6 with 1 rules applied. Total rules applied 808 place count 437 transition count 680
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 809 place count 436 transition count 672
Iterating global reduction 6 with 1 rules applied. Total rules applied 810 place count 436 transition count 672
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 811 place count 435 transition count 664
Iterating global reduction 6 with 1 rules applied. Total rules applied 812 place count 435 transition count 664
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 813 place count 434 transition count 656
Iterating global reduction 6 with 1 rules applied. Total rules applied 814 place count 434 transition count 656
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 815 place count 433 transition count 648
Iterating global reduction 6 with 1 rules applied. Total rules applied 816 place count 433 transition count 648
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 817 place count 432 transition count 640
Iterating global reduction 6 with 1 rules applied. Total rules applied 818 place count 432 transition count 640
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 819 place count 431 transition count 632
Iterating global reduction 6 with 1 rules applied. Total rules applied 820 place count 431 transition count 632
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 821 place count 430 transition count 624
Iterating global reduction 6 with 1 rules applied. Total rules applied 822 place count 430 transition count 624
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 823 place count 429 transition count 616
Iterating global reduction 6 with 1 rules applied. Total rules applied 824 place count 429 transition count 616
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 896 place count 393 transition count 580
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 898 place count 392 transition count 589
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 903 place count 392 transition count 584
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 908 place count 387 transition count 584
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 909 place count 386 transition count 583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 910 place count 385 transition count 583
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 910 place count 385 transition count 582
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 912 place count 384 transition count 582
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 913 place count 383 transition count 582
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 915 place count 382 transition count 581
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 916 place count 381 transition count 580
Iterating global reduction 9 with 1 rules applied. Total rules applied 917 place count 381 transition count 580
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 918 place count 381 transition count 579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 919 place count 380 transition count 579
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 920 place count 380 transition count 579
Applied a total of 920 rules in 607 ms. Remains 380 /846 variables (removed 466) and now considering 579/1148 (removed 569) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 612 ms. Remains : 380/846 places, 579/1148 transitions.
Incomplete random walk after 1000000 steps, including 21319 resets, run finished after 23962 ms. (steps per millisecond=41 ) properties (out of 101) seen :70
Incomplete Best-First random walk after 100000 steps, including 926 resets, run finished after 1382 ms. (steps per millisecond=72 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 943 resets, run finished after 1614 ms. (steps per millisecond=61 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 897 resets, run finished after 1427 ms. (steps per millisecond=70 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 940 resets, run finished after 1626 ms. (steps per millisecond=61 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 907 resets, run finished after 1459 ms. (steps per millisecond=68 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 899 resets, run finished after 1618 ms. (steps per millisecond=61 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 917 resets, run finished after 1362 ms. (steps per millisecond=73 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 890 resets, run finished after 1187 ms. (steps per millisecond=84 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 909 resets, run finished after 926 ms. (steps per millisecond=107 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 899 resets, run finished after 713 ms. (steps per millisecond=140 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 922 resets, run finished after 674 ms. (steps per millisecond=148 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 946 resets, run finished after 627 ms. (steps per millisecond=159 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 939 resets, run finished after 706 ms. (steps per millisecond=141 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 909 resets, run finished after 1044 ms. (steps per millisecond=95 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 936 resets, run finished after 1261 ms. (steps per millisecond=79 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 935 resets, run finished after 1281 ms. (steps per millisecond=78 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 935 resets, run finished after 1316 ms. (steps per millisecond=75 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 924 resets, run finished after 1394 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 914 resets, run finished after 720 ms. (steps per millisecond=138 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 922 resets, run finished after 668 ms. (steps per millisecond=149 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 931 resets, run finished after 663 ms. (steps per millisecond=150 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 938 resets, run finished after 676 ms. (steps per millisecond=147 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 922 resets, run finished after 932 ms. (steps per millisecond=107 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 919 resets, run finished after 680 ms. (steps per millisecond=147 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 915 resets, run finished after 994 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 903 resets, run finished after 1611 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 930 resets, run finished after 1629 ms. (steps per millisecond=61 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 911 resets, run finished after 1551 ms. (steps per millisecond=64 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 907 resets, run finished after 1401 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 917 resets, run finished after 1361 ms. (steps per millisecond=73 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 978 resets, run finished after 1282 ms. (steps per millisecond=78 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
// Phase 1: matrix 579 rows 380 cols
[2023-03-16 22:26:11] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-16 22:26:12] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-16 22:26:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 33 ms returned sat
[2023-03-16 22:26:12] [INFO ] [Nat]Absence check using 17 positive and 45 generalized place invariants in 25 ms returned sat
[2023-03-16 22:26:13] [INFO ] After 1075ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-03-16 22:26:15] [INFO ] After 3049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 944 ms.
[2023-03-16 22:26:16] [INFO ] After 4797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
Fused 31 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 2927 ms.
Support contains 31 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 579/579 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 380 transition count 555
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 356 transition count 555
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 356 transition count 543
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 73 place count 343 transition count 543
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 343 transition count 542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 342 transition count 542
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 83 place count 338 transition count 538
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 337 transition count 537
Ensure Unique test removed 1 places
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 336 transition count 537
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 335 transition count 536
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 335 transition count 535
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 91 place count 334 transition count 534
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 334 transition count 534
Applied a total of 92 rules in 57 ms. Remains 334 /380 variables (removed 46) and now considering 534/579 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 334/380 places, 534/579 transitions.
Incomplete random walk after 1000000 steps, including 21165 resets, run finished after 28435 ms. (steps per millisecond=35 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 914 resets, run finished after 1402 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 938 resets, run finished after 1527 ms. (steps per millisecond=65 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 889 resets, run finished after 1662 ms. (steps per millisecond=60 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 939 resets, run finished after 964 ms. (steps per millisecond=103 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 923 resets, run finished after 635 ms. (steps per millisecond=157 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 923 resets, run finished after 643 ms. (steps per millisecond=155 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 907 resets, run finished after 738 ms. (steps per millisecond=135 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 927 resets, run finished after 684 ms. (steps per millisecond=146 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 929 resets, run finished after 1042 ms. (steps per millisecond=95 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 945 resets, run finished after 1352 ms. (steps per millisecond=73 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 901 resets, run finished after 1366 ms. (steps per millisecond=73 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 920 resets, run finished after 1616 ms. (steps per millisecond=61 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 859 resets, run finished after 1491 ms. (steps per millisecond=67 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 949 resets, run finished after 1356 ms. (steps per millisecond=73 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 977 resets, run finished after 1375 ms. (steps per millisecond=72 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 922 resets, run finished after 1641 ms. (steps per millisecond=60 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 942 resets, run finished after 1327 ms. (steps per millisecond=75 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 911 resets, run finished after 1298 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 889 resets, run finished after 1452 ms. (steps per millisecond=68 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 934 resets, run finished after 1583 ms. (steps per millisecond=63 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 920 resets, run finished after 1584 ms. (steps per millisecond=63 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 931 resets, run finished after 1603 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 920 resets, run finished after 1664 ms. (steps per millisecond=60 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 917 resets, run finished after 1477 ms. (steps per millisecond=67 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 915 resets, run finished after 642 ms. (steps per millisecond=155 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 895 resets, run finished after 632 ms. (steps per millisecond=158 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 910 resets, run finished after 678 ms. (steps per millisecond=147 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 937 resets, run finished after 656 ms. (steps per millisecond=152 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 939 resets, run finished after 678 ms. (steps per millisecond=147 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 918 resets, run finished after 734 ms. (steps per millisecond=136 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 953 resets, run finished after 736 ms. (steps per millisecond=135 ) properties (out of 31) seen :0
Interrupted probabilistic random walk after 45799129 steps, run timeout after 192001 ms. (steps per millisecond=238 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 29=1, 30=1}
Probabilistic random walk after 45799129 steps, saw 9695773 distinct states, run finished after 192004 ms. (steps per millisecond=238 ) properties seen :29
Running SMT prover for 2 properties.
// Phase 1: matrix 534 rows 334 cols
[2023-03-16 22:30:36] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-16 22:30:36] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 22:30:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 31 ms returned sat
[2023-03-16 22:30:36] [INFO ] [Nat]Absence check using 18 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-16 22:30:37] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 22:30:37] [INFO ] After 327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-16 22:30:37] [INFO ] After 541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 226 ms.
Support contains 2 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 534/534 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 334 transition count 532
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 332 transition count 532
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 4 place count 332 transition count 524
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 21 place count 323 transition count 524
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 323 transition count 523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 322 transition count 523
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 36 place count 315 transition count 517
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 36 place count 315 transition count 515
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 41 place count 312 transition count 515
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 42 place count 311 transition count 515
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 42 place count 311 transition count 514
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 44 place count 310 transition count 514
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 48 place count 308 transition count 512
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 49 place count 308 transition count 512
Applied a total of 49 rules in 46 ms. Remains 308 /334 variables (removed 26) and now considering 512/534 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 308/334 places, 512/534 transitions.
Incomplete random walk after 1000000 steps, including 21162 resets, run finished after 6521 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9282 resets, run finished after 3044 ms. (steps per millisecond=328 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9390 resets, run finished after 3073 ms. (steps per millisecond=325 ) properties (out of 2) seen :0
Finished probabilistic random walk after 334408 steps, run visited all 2 properties in 1721 ms. (steps per millisecond=194 )
Probabilistic random walk after 334408 steps, saw 110818 distinct states, run finished after 1722 ms. (steps per millisecond=194 ) properties seen :2
Able to resolve query StableMarking after proving 751 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 374176 ms.
ITS solved all properties within timeout
BK_STOP 1679005851933
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
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="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is ASLink-PT-01b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-oct2-167813611400013"
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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;