Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872500151.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyCommit-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872500151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.0K May 30 14:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 30 14:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 30 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 30 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 6.8K May 30 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K May 30 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 30 14:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 30 14:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 1.4M May 29 12:20 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 StigmergyCommit-PT-05b-ReachabilityFireability-00
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-01
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-02
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-03
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-04
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-05
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-06
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-07
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-08
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-09
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-10
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-11
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-12
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-13
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-14
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654781208625

Running Version 202205111006
[2022-06-09 13:26:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 13:26:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 13:26:52] [INFO ] Load time of PNML (sax parser for PT used): 678 ms
[2022-06-09 13:26:52] [INFO ] Transformed 1837 places.
[2022-06-09 13:26:52] [INFO ] Transformed 3460 transitions.
[2022-06-09 13:26:52] [INFO ] Found NUPN structural information;
[2022-06-09 13:26:52] [INFO ] Parsed PT model containing 1837 places and 3460 transitions in 972 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 87 resets, run finished after 908 ms. (steps per millisecond=11 ) properties (out of 16) seen :2
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 3460 rows 1837 cols
[2022-06-09 13:26:55] [INFO ] Computed 7 place invariants in 92 ms
[2022-06-09 13:26:57] [INFO ] After 1802ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-09 13:26:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 28 ms returned sat
[2022-06-09 13:27:03] [INFO ] After 3619ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :9
[2022-06-09 13:27:05] [INFO ] Deduced a trap composed of 397 places in 1507 ms of which 11 ms to minimize.
[2022-06-09 13:27:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1959 ms
[2022-06-09 13:27:07] [INFO ] Deduced a trap composed of 398 places in 1452 ms of which 2 ms to minimize.
[2022-06-09 13:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1800 ms
[2022-06-09 13:27:09] [INFO ] Deduced a trap composed of 399 places in 1791 ms of which 3 ms to minimize.
[2022-06-09 13:27:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2196 ms
[2022-06-09 13:27:12] [INFO ] Deduced a trap composed of 488 places in 1707 ms of which 3 ms to minimize.
[2022-06-09 13:27:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2098 ms
[2022-06-09 13:27:14] [INFO ] Deduced a trap composed of 396 places in 1916 ms of which 4 ms to minimize.
[2022-06-09 13:27:16] [INFO ] Deduced a trap composed of 400 places in 1933 ms of which 3 ms to minimize.
[2022-06-09 13:27:18] [INFO ] Deduced a trap composed of 400 places in 1790 ms of which 1 ms to minimize.
[2022-06-09 13:27:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6346 ms
[2022-06-09 13:27:20] [INFO ] Deduced a trap composed of 400 places in 1551 ms of which 2 ms to minimize.
[2022-06-09 13:27:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1898 ms
[2022-06-09 13:27:21] [INFO ] After 22273ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :9
Attempting to minimize the solution found.
Minimization took 1026 ms.
[2022-06-09 13:27:23] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :9
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 9990 ms.
Support contains 76 out of 1837 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Graph (trivial) has 1667 edges and 1837 vertex of which 115 / 1837 are part of one of the 17 SCC in 13 ms
Free SCC test removed 98 places
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Graph (complete) has 2734 edges and 1739 vertex of which 1728 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.34 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1237 transitions
Trivial Post-agglo rules discarded 1237 transitions
Performed 1237 trivial Post agglomeration. Transition count delta: 1237
Iterating post reduction 0 with 1242 rules applied. Total rules applied 1244 place count 1728 transition count 2088
Reduce places removed 1237 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 1260 rules applied. Total rules applied 2504 place count 491 transition count 2065
Reduce places removed 10 places and 0 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Iterating post reduction 2 with 64 rules applied. Total rules applied 2568 place count 481 transition count 2011
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 60 rules applied. Total rules applied 2628 place count 427 transition count 2005
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2629 place count 426 transition count 2005
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 75 Pre rules applied. Total rules applied 2629 place count 426 transition count 1930
Deduced a syphon composed of 75 places in 3 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 2779 place count 351 transition count 1930
Discarding 70 places :
Symmetric choice reduction at 5 with 70 rule applications. Total rules 2849 place count 281 transition count 1860
Iterating global reduction 5 with 70 rules applied. Total rules applied 2919 place count 281 transition count 1860
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2923 place count 281 transition count 1856
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2945 place count 259 transition count 1823
Iterating global reduction 6 with 22 rules applied. Total rules applied 2967 place count 259 transition count 1823
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2971 place count 259 transition count 1819
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 2980 place count 250 transition count 1810
Iterating global reduction 7 with 9 rules applied. Total rules applied 2989 place count 250 transition count 1810
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2994 place count 245 transition count 1805
Iterating global reduction 7 with 5 rules applied. Total rules applied 2999 place count 245 transition count 1805
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 3003 place count 245 transition count 1801
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 3039 place count 227 transition count 1783
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 3044 place count 222 transition count 1778
Iterating global reduction 8 with 5 rules applied. Total rules applied 3049 place count 222 transition count 1778
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 3054 place count 217 transition count 1773
Iterating global reduction 8 with 5 rules applied. Total rules applied 3059 place count 217 transition count 1773
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 3064 place count 212 transition count 1768
Iterating global reduction 8 with 5 rules applied. Total rules applied 3069 place count 212 transition count 1768
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 3075 place count 209 transition count 1773
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3076 place count 209 transition count 1772
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 3079 place count 209 transition count 1769
Free-agglomeration rule applied 47 times.
Iterating global reduction 9 with 47 rules applied. Total rules applied 3126 place count 209 transition count 1722
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 9 with 47 rules applied. Total rules applied 3173 place count 162 transition count 1722
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 10 with 59 rules applied. Total rules applied 3232 place count 162 transition count 1663
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3233 place count 162 transition count 1662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3234 place count 161 transition count 1662
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 3240 place count 161 transition count 1662
Applied a total of 3240 rules in 934 ms. Remains 161 /1837 variables (removed 1676) and now considering 1662/3460 (removed 1798) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/1837 places, 1662/3460 transitions.
Incomplete random walk after 1000000 steps, including 53589 resets, run finished after 27541 ms. (steps per millisecond=36 ) properties (out of 9) seen :3
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7706 resets, run finished after 3972 ms. (steps per millisecond=251 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7305 resets, run finished after 4239 ms. (steps per millisecond=235 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 737903 steps, including 5713 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen 0
Interrupted Best-First random walk after 985214 steps, including 7595 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen 0
Interrupted Best-First random walk after 776121 steps, including 6487 resets, run timeout after 5001 ms. (steps per millisecond=155 ) properties seen 1
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 8411 resets, run finished after 4811 ms. (steps per millisecond=207 ) properties (out of 5) seen :1
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 1662 rows 161 cols
[2022-06-09 13:28:29] [INFO ] Computed 6 place invariants in 16 ms
[2022-06-09 13:28:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-09 13:28:29] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-09 13:28:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-09 13:28:30] [INFO ] After 960ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-09 13:28:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-06-09 13:28:31] [INFO ] After 309ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-09 13:28:31] [INFO ] After 770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 260 ms.
[2022-06-09 13:28:31] [INFO ] After 2099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 495 ms.
Support contains 55 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 1662/1662 transitions.
Graph (trivial) has 44 edges and 161 vertex of which 4 / 161 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 745 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 158 transition count 1647
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 149 transition count 1646
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 149 transition count 1644
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 147 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 146 transition count 1643
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 146 transition count 1643
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 145 transition count 1642
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 145 transition count 1642
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 42 place count 139 transition count 1636
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 139 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 47 place count 136 transition count 1631
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 136 transition count 1631
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 136 transition count 1630
Performed 2 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 134 transition count 1649
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 65 place count 134 transition count 1639
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 73 place count 134 transition count 1631
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 81 place count 126 transition count 1631
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 126 transition count 1630
Applied a total of 82 rules in 490 ms. Remains 126 /161 variables (removed 35) and now considering 1630/1662 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/161 places, 1630/1662 transitions.
Incomplete random walk after 1000000 steps, including 54151 resets, run finished after 20429 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8083 resets, run finished after 3126 ms. (steps per millisecond=319 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7608 resets, run finished after 3281 ms. (steps per millisecond=304 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 769147 steps, including 6270 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen 0
Interrupted probabilistic random walk after 13806533 steps, run timeout after 93001 ms. (steps per millisecond=148 ) properties seen :{2=1}
Probabilistic random walk after 13806533 steps, saw 2278958 distinct states, run finished after 93003 ms. (steps per millisecond=148 ) properties seen :1
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 1630 rows 126 cols
[2022-06-09 13:30:37] [INFO ] Computed 7 place invariants in 11 ms
[2022-06-09 13:30:37] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2022-06-09 13:30:38] [INFO ] After 530ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-09 13:30:38] [INFO ] State equation strengthened by 660 read => feed constraints.
[2022-06-09 13:30:39] [INFO ] After 846ms SMT Verify possible using 660 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 13:30:39] [INFO ] After 1591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 13:30:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-06-09 13:30:40] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 13:30:41] [INFO ] After 1234ms SMT Verify possible using 660 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 13:30:42] [INFO ] Deduced a trap composed of 22 places in 1075 ms of which 1 ms to minimize.
[2022-06-09 13:30:43] [INFO ] Deduced a trap composed of 48 places in 1059 ms of which 1 ms to minimize.
[2022-06-09 13:30:44] [INFO ] Deduced a trap composed of 24 places in 814 ms of which 1 ms to minimize.
[2022-06-09 13:30:45] [INFO ] Deduced a trap composed of 45 places in 950 ms of which 1 ms to minimize.
[2022-06-09 13:30:46] [INFO ] Deduced a trap composed of 42 places in 1001 ms of which 0 ms to minimize.
[2022-06-09 13:30:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5433 ms
[2022-06-09 13:30:46] [INFO ] After 6887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 167 ms.
[2022-06-09 13:30:47] [INFO ] After 7871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 158 ms.
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 126/126 places, 1630/1630 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 126 transition count 1606
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 102 transition count 1604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 101 transition count 1604
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 51 place count 101 transition count 1602
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 99 transition count 1602
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 68 place count 86 transition count 427
Iterating global reduction 3 with 13 rules applied. Total rules applied 81 place count 86 transition count 427
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 88 place count 86 transition count 420
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 90 place count 84 transition count 418
Iterating global reduction 4 with 2 rules applied. Total rules applied 92 place count 84 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 84 transition count 417
Performed 7 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 107 place count 77 transition count 407
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 110 place count 77 transition count 404
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 117 place count 70 transition count 350
Iterating global reduction 6 with 7 rules applied. Total rules applied 124 place count 70 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 125 place count 70 transition count 349
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 130 place count 65 transition count 344
Iterating global reduction 7 with 5 rules applied. Total rules applied 135 place count 65 transition count 344
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 142 place count 65 transition count 337
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 143 place count 64 transition count 336
Iterating global reduction 8 with 1 rules applied. Total rules applied 144 place count 64 transition count 336
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 146 place count 63 transition count 351
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 149 place count 63 transition count 348
Free-agglomeration rule applied 22 times with reduction of 112 identical transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 171 place count 63 transition count 214
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 8 with 64 rules applied. Total rules applied 235 place count 41 transition count 172
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 241 place count 35 transition count 166
Iterating global reduction 9 with 6 rules applied. Total rules applied 247 place count 35 transition count 166
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 9 with 31 rules applied. Total rules applied 278 place count 35 transition count 135
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 280 place count 35 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 281 place count 35 transition count 134
Applied a total of 281 rules in 216 ms. Remains 35 /126 variables (removed 91) and now considering 134/1630 (removed 1496) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/126 places, 134/1630 transitions.
Finished random walk after 101 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=16 )
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 236465 ms.

BK_STOP 1654781447698

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-05b, 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 r294-smll-165463872500151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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