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.r096-smll-165260575700079.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 FlexibleBarrier-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575700079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 6.7K Apr 29 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 29 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 13:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 536K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654180993061

Running Version 202205111006
[2022-06-02 14:43:14] [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-02 14:43:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 14:43:15] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2022-06-02 14:43:15] [INFO ] Transformed 1988 places.
[2022-06-02 14:43:15] [INFO ] Transformed 2289 transitions.
[2022-06-02 14:43:15] [INFO ] Found NUPN structural information;
[2022-06-02 14:43:15] [INFO ] Parsed PT model containing 1988 places and 2289 transitions in 507 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 117 resets, run finished after 1072 ms. (steps per millisecond=9 ) properties (out of 16) seen :2
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 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 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2289 rows 1988 cols
[2022-06-02 14:43:17] [INFO ] Computed 14 place invariants in 79 ms
[2022-06-02 14:43:19] [INFO ] [Real]Absence check using 14 positive place invariants in 32 ms returned sat
[2022-06-02 14:43:20] [INFO ] After 2378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-02 14:43:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2022-06-02 14:43:26] [INFO ] After 4748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-06-02 14:43:26] [INFO ] Deduced a trap composed of 232 places in 209 ms of which 8 ms to minimize.
[2022-06-02 14:43:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2022-06-02 14:43:29] [INFO ] Deduced a trap composed of 713 places in 1414 ms of which 3 ms to minimize.
[2022-06-02 14:43:30] [INFO ] Deduced a trap composed of 730 places in 1039 ms of which 3 ms to minimize.
[2022-06-02 14:43:31] [INFO ] Deduced a trap composed of 648 places in 1087 ms of which 4 ms to minimize.
[2022-06-02 14:43:33] [INFO ] Deduced a trap composed of 675 places in 1202 ms of which 1 ms to minimize.
[2022-06-02 14:43:34] [INFO ] Deduced a trap composed of 675 places in 921 ms of which 1 ms to minimize.
[2022-06-02 14:43:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 6477 ms
[2022-06-02 14:43:35] [INFO ] Deduced a trap composed of 694 places in 1162 ms of which 2 ms to minimize.
[2022-06-02 14:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1430 ms
[2022-06-02 14:43:37] [INFO ] Deduced a trap composed of 710 places in 1101 ms of which 1 ms to minimize.
[2022-06-02 14:43:39] [INFO ] Deduced a trap composed of 648 places in 1110 ms of which 3 ms to minimize.
[2022-06-02 14:43:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2599 ms
[2022-06-02 14:43:40] [INFO ] Deduced a trap composed of 682 places in 1216 ms of which 2 ms to minimize.
[2022-06-02 14:43:42] [INFO ] Deduced a trap composed of 654 places in 1060 ms of which 2 ms to minimize.
[2022-06-02 14:43:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2561 ms
[2022-06-02 14:43:42] [INFO ] After 20739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Minimization took 2824 ms.
[2022-06-02 14:43:45] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 8 properties in 6580 ms.
Support contains 42 out of 1988 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1800 edges and 1988 vertex of which 43 / 1988 are part of one of the 7 SCC in 14 ms
Free SCC test removed 36 places
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions removed 482 transitions
Trivial Post-agglo rules discarded 482 transitions
Performed 482 trivial Post agglomeration. Transition count delta: 482
Iterating post reduction 0 with 482 rules applied. Total rules applied 483 place count 1952 transition count 1764
Reduce places removed 482 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 491 rules applied. Total rules applied 974 place count 1470 transition count 1755
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 983 place count 1461 transition count 1755
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 983 place count 1461 transition count 1624
Deduced a syphon composed of 131 places in 4 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 1245 place count 1330 transition count 1624
Discarding 736 places :
Symmetric choice reduction at 3 with 736 rule applications. Total rules 1981 place count 594 transition count 888
Iterating global reduction 3 with 736 rules applied. Total rules applied 2717 place count 594 transition count 888
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 2717 place count 594 transition count 882
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 2729 place count 588 transition count 882
Discarding 111 places :
Symmetric choice reduction at 3 with 111 rule applications. Total rules 2840 place count 477 transition count 771
Iterating global reduction 3 with 111 rules applied. Total rules applied 2951 place count 477 transition count 771
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 3 with 107 rules applied. Total rules applied 3058 place count 477 transition count 664
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 3206 place count 403 transition count 590
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 3212 place count 403 transition count 584
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 3224 place count 397 transition count 593
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 3234 place count 397 transition count 583
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3238 place count 395 transition count 609
Free-agglomeration rule applied 215 times.
Iterating global reduction 5 with 215 rules applied. Total rules applied 3453 place count 395 transition count 394
Reduce places removed 215 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 235 rules applied. Total rules applied 3688 place count 180 transition count 374
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 3712 place count 180 transition count 350
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 3715 place count 180 transition count 350
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 3718 place count 180 transition count 347
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3719 place count 179 transition count 346
Applied a total of 3719 rules in 743 ms. Remains 179 /1988 variables (removed 1809) and now considering 346/2289 (removed 1943) transitions.
Finished structural reductions, in 1 iterations. Remains : 179/1988 places, 346/2289 transitions.
Incomplete random walk after 1000000 steps, including 17232 resets, run finished after 12868 ms. (steps per millisecond=77 ) properties (out of 4) seen :2
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2995 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2247 resets, run finished after 3194 ms. (steps per millisecond=313 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-02 14:44:11] [INFO ] Flow matrix only has 299 transitions (discarded 47 similar events)
// Phase 1: matrix 299 rows 179 cols
[2022-06-02 14:44:11] [INFO ] Computed 14 place invariants in 1 ms
[2022-06-02 14:44:11] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2022-06-02 14:44:11] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 14:44:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2022-06-02 14:44:11] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 14:44:11] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-02 14:44:11] [INFO ] After 56ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 14:44:11] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-06-02 14:44:11] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 132 ms.
Support contains 30 out of 179 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 179/179 places, 346/346 transitions.
Graph (trivial) has 20 edges and 179 vertex of which 2 / 179 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 178 transition count 338
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 172 transition count 338
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 172 transition count 337
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 171 transition count 337
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 26 place count 171 transition count 326
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 38 place count 159 transition count 312
Iterating global reduction 3 with 12 rules applied. Total rules applied 50 place count 159 transition count 312
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 66 place count 151 transition count 304
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 70 place count 151 transition count 300
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 150 transition count 299
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 150 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 150 transition count 298
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 78 place count 150 transition count 293
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 150 transition count 291
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 63 edges and 147 vertex of which 12 / 147 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 86 place count 141 transition count 289
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 15 rules applied. Total rules applied 101 place count 139 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 102 place count 138 transition count 276
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 102 place count 138 transition count 265
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 124 place count 127 transition count 265
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 134 place count 127 transition count 255
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 172 place count 108 transition count 236
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 174 place count 108 transition count 234
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 178 place count 106 transition count 234
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 182 place count 106 transition count 230
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 184 place count 106 transition count 228
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 191 place count 106 transition count 221
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 204 place count 98 transition count 216
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 12 with 45 rules applied. Total rules applied 249 place count 98 transition count 171
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 250 place count 98 transition count 171
Applied a total of 250 rules in 97 ms. Remains 98 /179 variables (removed 81) and now considering 171/346 (removed 175) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/179 places, 171/346 transitions.
Incomplete random walk after 1000000 steps, including 41460 resets, run finished after 3190 ms. (steps per millisecond=313 ) properties (out of 2) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4698 resets, run finished after 1384 ms. (steps per millisecond=722 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 171 rows 98 cols
[2022-06-02 14:44:16] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-02 14:44:16] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 14:44:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-06-02 14:44:17] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 14:44:17] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-02 14:44:17] [INFO ] After 29ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 14:44:17] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-02 14:44:17] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 851 steps, including 53 resets, run visited all 1 properties in 3 ms. (steps per millisecond=283 )
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
All properties solved without resorting to model-checking.
Total runtime 62202 ms.

BK_STOP 1654181057193

--------------------
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="FlexibleBarrier-PT-12b"
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 FlexibleBarrier-PT-12b, 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 r096-smll-165260575700079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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