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.r170-tall-167838857700727.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FunctionPointer-PT-c004, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857700727
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M 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

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

=== Now, execution of the tool begins

BK_START 1678623500070

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 12:18:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 12:18:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:18:21] [INFO ] Load time of PNML (sax parser for PT used): 316 ms
[2023-03-12 12:18:21] [INFO ] Transformed 2826 places.
[2023-03-12 12:18:22] [INFO ] Transformed 8960 transitions.
[2023-03-12 12:18:22] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 28 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 13) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-12 12:18:23] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 12:18:23] [INFO ] Computed 4 place invariants in 80 ms
[2023-03-12 12:18:24] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-12 12:18:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 12:18:24] [INFO ] After 1328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 12:18:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-12 12:18:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 12:18:29] [INFO ] After 3185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-12 12:18:29] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 12:18:32] [INFO ] After 3785ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-12 12:18:35] [INFO ] Deduced a trap composed of 131 places in 702 ms of which 7 ms to minimize.
[2023-03-12 12:18:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 881 ms
[2023-03-12 12:18:36] [INFO ] After 7281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2315 ms.
[2023-03-12 12:18:38] [INFO ] After 13719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 82 ms.
Support contains 28 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.13 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 289 places :
Symmetric choice reduction at 0 with 289 rule applications. Total rules 290 place count 1322 transition count 3820
Iterating global reduction 0 with 289 rules applied. Total rules applied 579 place count 1322 transition count 3820
Ensure Unique test removed 438 transitions
Reduce isomorphic transitions removed 438 transitions.
Iterating post reduction 0 with 438 rules applied. Total rules applied 1017 place count 1322 transition count 3382
Discarding 146 places :
Symmetric choice reduction at 1 with 146 rule applications. Total rules 1163 place count 1176 transition count 3090
Iterating global reduction 1 with 146 rules applied. Total rules applied 1309 place count 1176 transition count 3090
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1409 place count 1176 transition count 2990
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1423 place count 1162 transition count 2962
Iterating global reduction 2 with 14 rules applied. Total rules applied 1437 place count 1162 transition count 2962
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1451 place count 1148 transition count 2934
Iterating global reduction 2 with 14 rules applied. Total rules applied 1465 place count 1148 transition count 2934
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1479 place count 1134 transition count 2906
Iterating global reduction 2 with 14 rules applied. Total rules applied 1493 place count 1134 transition count 2906
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1507 place count 1120 transition count 2878
Iterating global reduction 2 with 14 rules applied. Total rules applied 1521 place count 1120 transition count 2878
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1535 place count 1106 transition count 2850
Iterating global reduction 2 with 14 rules applied. Total rules applied 1549 place count 1106 transition count 2850
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1561 place count 1094 transition count 2826
Iterating global reduction 2 with 12 rules applied. Total rules applied 1573 place count 1094 transition count 2826
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1585 place count 1082 transition count 2802
Iterating global reduction 2 with 12 rules applied. Total rules applied 1597 place count 1082 transition count 2802
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 1635 place count 1044 transition count 2664
Iterating global reduction 2 with 38 rules applied. Total rules applied 1673 place count 1044 transition count 2664
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 1723 place count 994 transition count 2464
Iterating global reduction 2 with 50 rules applied. Total rules applied 1773 place count 994 transition count 2464
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 1823 place count 944 transition count 2326
Iterating global reduction 2 with 50 rules applied. Total rules applied 1873 place count 944 transition count 2326
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 1923 place count 894 transition count 2226
Iterating global reduction 2 with 50 rules applied. Total rules applied 1973 place count 894 transition count 2226
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 2023 place count 844 transition count 2126
Iterating global reduction 2 with 50 rules applied. Total rules applied 2073 place count 844 transition count 2126
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 2123 place count 794 transition count 2026
Iterating global reduction 2 with 50 rules applied. Total rules applied 2173 place count 794 transition count 2026
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 2223 place count 744 transition count 1926
Iterating global reduction 2 with 50 rules applied. Total rules applied 2273 place count 744 transition count 1926
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 2289 place count 728 transition count 1894
Iterating global reduction 2 with 16 rules applied. Total rules applied 2305 place count 728 transition count 1894
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 2333 place count 728 transition count 1866
Applied a total of 2333 rules in 1605 ms. Remains 728 /1628 variables (removed 900) and now considering 1866/5962 (removed 4096) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1606 ms. Remains : 728/1628 places, 1866/5962 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 10) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :2
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 12:18:40] [INFO ] Flow matrix only has 1256 transitions (discarded 610 similar events)
// Phase 1: matrix 1256 rows 728 cols
[2023-03-12 12:18:40] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-12 12:18:41] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 12:18:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 12:18:42] [INFO ] After 1764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 12:18:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 12:18:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 12:18:44] [INFO ] After 1427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 12:18:44] [INFO ] State equation strengthened by 307 read => feed constraints.
[2023-03-12 12:18:45] [INFO ] After 1239ms SMT Verify possible using 307 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 12:18:46] [INFO ] Deduced a trap composed of 131 places in 190 ms of which 1 ms to minimize.
[2023-03-12 12:18:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-12 12:18:46] [INFO ] After 2520ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 687 ms.
[2023-03-12 12:18:47] [INFO ] After 4877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 19 ms.
Support contains 25 out of 728 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 728/728 places, 1866/1866 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 725 transition count 1860
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 725 transition count 1860
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 725 transition count 1856
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 722 transition count 1850
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 722 transition count 1850
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 721 transition count 1848
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 721 transition count 1848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 720 transition count 1844
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 720 transition count 1844
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 719 transition count 1842
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 719 transition count 1842
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 718 transition count 1840
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 718 transition count 1840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 717 transition count 1838
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 717 transition count 1838
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 716 transition count 1836
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 716 transition count 1836
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 715 transition count 1834
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 715 transition count 1834
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 714 transition count 1832
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 714 transition count 1832
Applied a total of 32 rules in 277 ms. Remains 714 /728 variables (removed 14) and now considering 1832/1866 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 714/728 places, 1832/1866 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 12:18:48] [INFO ] Flow matrix only has 1235 transitions (discarded 597 similar events)
// Phase 1: matrix 1235 rows 714 cols
[2023-03-12 12:18:48] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-12 12:18:48] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 12:18:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 12:18:49] [INFO ] After 1314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 12:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 12:18:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 12:18:51] [INFO ] After 1244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 12:18:51] [INFO ] State equation strengthened by 304 read => feed constraints.
[2023-03-12 12:18:52] [INFO ] After 973ms SMT Verify possible using 304 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 12:18:52] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 1 ms to minimize.
[2023-03-12 12:18:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-12 12:18:53] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 0 ms to minimize.
[2023-03-12 12:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-12 12:18:53] [INFO ] After 2271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 523 ms.
[2023-03-12 12:18:53] [INFO ] After 4256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 42 ms.
Support contains 24 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 1832/1832 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 713 transition count 1830
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 713 transition count 1830
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 712 transition count 1828
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 712 transition count 1828
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 711 transition count 1824
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 711 transition count 1824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 710 transition count 1822
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 710 transition count 1822
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 709 transition count 1820
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 709 transition count 1820
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 708 transition count 1818
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 708 transition count 1818
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 707 transition count 1816
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 707 transition count 1816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 706 transition count 1814
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 706 transition count 1814
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 705 transition count 1812
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 705 transition count 1812
Applied a total of 18 rules in 231 ms. Remains 705 /714 variables (removed 9) and now considering 1812/1832 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 705/714 places, 1812/1832 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 12:18:54] [INFO ] Flow matrix only has 1221 transitions (discarded 591 similar events)
// Phase 1: matrix 1221 rows 705 cols
[2023-03-12 12:18:54] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 12:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 12:18:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-12 12:18:55] [INFO ] After 1224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 12:18:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 12:18:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 12:18:56] [INFO ] After 1035ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 12:18:56] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-12 12:18:57] [INFO ] After 788ms SMT Verify possible using 301 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 12:18:58] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 1 ms to minimize.
[2023-03-12 12:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-12 12:18:58] [INFO ] Deduced a trap composed of 131 places in 159 ms of which 0 ms to minimize.
[2023-03-12 12:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-12 12:18:58] [INFO ] After 2039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 576 ms.
[2023-03-12 12:18:59] [INFO ] After 3835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 19 ms.
Support contains 23 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 1812/1812 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 704 transition count 1810
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 704 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 703 transition count 1806
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 703 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 702 transition count 1804
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 702 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 701 transition count 1802
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 701 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 700 transition count 1800
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 700 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 699 transition count 1798
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 699 transition count 1798
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 698 transition count 1796
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 698 transition count 1796
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 697 transition count 1794
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 697 transition count 1794
Applied a total of 16 rules in 198 ms. Remains 697 /705 variables (removed 8) and now considering 1794/1812 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 697/705 places, 1794/1812 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 229912 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229912 steps, saw 150881 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 12:19:02] [INFO ] Flow matrix only has 1208 transitions (discarded 586 similar events)
// Phase 1: matrix 1208 rows 697 cols
[2023-03-12 12:19:02] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 12:19:03] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 12:19:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 12:19:04] [INFO ] After 1357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 12:19:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 12:19:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 12:19:05] [INFO ] After 959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 12:19:05] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-03-12 12:19:06] [INFO ] After 869ms SMT Verify possible using 298 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 12:19:06] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 0 ms to minimize.
[2023-03-12 12:19:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-12 12:19:07] [INFO ] After 1851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 708 ms.
[2023-03-12 12:19:07] [INFO ] After 3693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 19 ms.
Support contains 23 out of 697 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 697/697 places, 1794/1794 transitions.
Applied a total of 0 rules in 91 ms. Remains 697 /697 variables (removed 0) and now considering 1794/1794 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 697/697 places, 1794/1794 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 697/697 places, 1794/1794 transitions.
Applied a total of 0 rules in 95 ms. Remains 697 /697 variables (removed 0) and now considering 1794/1794 (removed 0) transitions.
[2023-03-12 12:19:08] [INFO ] Flow matrix only has 1208 transitions (discarded 586 similar events)
[2023-03-12 12:19:08] [INFO ] Invariant cache hit.
[2023-03-12 12:19:08] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-12 12:19:08] [INFO ] Flow matrix only has 1208 transitions (discarded 586 similar events)
[2023-03-12 12:19:08] [INFO ] Invariant cache hit.
[2023-03-12 12:19:08] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-03-12 12:19:10] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 2054 ms to find 0 implicit places.
[2023-03-12 12:19:10] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-12 12:19:10] [INFO ] Flow matrix only has 1208 transitions (discarded 586 similar events)
[2023-03-12 12:19:10] [INFO ] Invariant cache hit.
[2023-03-12 12:19:10] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2794 ms. Remains : 697/697 places, 1794/1794 transitions.
Graph (trivial) has 1037 edges and 697 vertex of which 192 / 697 are part of one of the 64 SCC in 5 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 458 transitions
Reduce isomorphic transitions removed 778 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 569 transition count 1002
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 555 transition count 1002
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 29 place count 555 transition count 907
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 219 place count 460 transition count 907
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 282 place count 397 transition count 844
Iterating global reduction 2 with 63 rules applied. Total rules applied 345 place count 397 transition count 844
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 471 place count 397 transition count 718
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 737 place count 264 transition count 585
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 798 place count 203 transition count 463
Iterating global reduction 3 with 61 rules applied. Total rules applied 859 place count 203 transition count 463
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 861 place count 203 transition count 461
Discarding 57 places :
Symmetric choice reduction at 4 with 57 rule applications. Total rules 918 place count 146 transition count 347
Iterating global reduction 4 with 57 rules applied. Total rules applied 975 place count 146 transition count 347
Discarding 57 places :
Symmetric choice reduction at 4 with 57 rule applications. Total rules 1032 place count 89 transition count 233
Iterating global reduction 4 with 57 rules applied. Total rules applied 1089 place count 89 transition count 233
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 1146 place count 89 transition count 176
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 5 with 2 rules applied. Total rules applied 1148 place count 88 transition count 175
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1164 place count 80 transition count 186
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 1173 place count 80 transition count 177
Applied a total of 1173 rules in 77 ms. Remains 80 /697 variables (removed 617) and now considering 177/1794 (removed 1617) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 177 rows 80 cols
[2023-03-12 12:19:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 12:19:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 12:19:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 12:19:11] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 12:19:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 12:19:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 12:19:11] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 12:19:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 12:19:11] [INFO ] After 58ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 12:19:11] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-12 12:19:11] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-12 12:19:11] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-12 12:19:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 697 places, 1794 transitions and 7302 arcs took 11 ms.
[2023-03-12 12:19:11] [INFO ] Flatten gal took : 150 ms
Total runtime 50234 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FuncPointer_3
(NrP: 697 NrTr: 1794 NrArc: 7302)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.084sec

net check time: 0m 0.000sec

init dd package: 0m 2.752sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 7041360 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16094536 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

6702 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7283 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7283 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7283 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7283 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7283 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7283 7284 7283 7284 7283 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7283 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7283 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7283 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7283 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7283 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7281 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281 7284 7281 7284 7283 7284 7283 7284 7282 7285 7282 7285 7282 7281 7284 7281 7284 7283 7284 7283 7284 7283 7285 7282 7285 7282 7285 7284 7281

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="FunctionPointer-PT-c004"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is FunctionPointer-PT-c004, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857700727"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;