Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r081-smll-158922977800335.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
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 r081-smll-158922977800335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 3.7K Apr 4 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 4 07:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 07:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 3 21:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 3 21:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 3 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 3 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 536K Mar 24 05:37 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 1589685662231

[2020-05-17 03:21:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-17 03:21:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-17 03:21:05] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2020-05-17 03:21:05] [INFO ] Transformed 1988 places.
[2020-05-17 03:21:05] [INFO ] Transformed 2289 transitions.
[2020-05-17 03:21:05] [INFO ] Found NUPN structural information;
[2020-05-17 03:21:05] [INFO ] Parsed PT model containing 1988 places and 2289 transitions in 337 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 60 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 114 resets, run finished after 138 ms. (steps per millisecond=72 ) properties seen :[1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1]
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2289 rows 1988 cols
[2020-05-17 03:21:05] [INFO ] Computed 14 place invariants in 140 ms
[2020-05-17 03:21:06] [INFO ] [Real]Absence check using 14 positive place invariants in 188 ms returned sat
[2020-05-17 03:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:21:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 03:21:10] [INFO ] [Real]Absence check using state equation in 3928 ms returned (error "Failed to check-sat")
[2020-05-17 03:21:11] [INFO ] [Real]Absence check using 14 positive place invariants in 120 ms returned sat
[2020-05-17 03:21:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:21:15] [INFO ] [Real]Absence check using state equation in 4379 ms returned (error "Solver has unexpectedly terminated")
[2020-05-17 03:21:16] [INFO ] [Real]Absence check using 14 positive place invariants in 189 ms returned sat
[2020-05-17 03:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:21:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 03:21:20] [INFO ] [Real]Absence check using state equation in 4285 ms returned (error "Failed to check-sat")
[2020-05-17 03:21:21] [INFO ] [Real]Absence check using 14 positive place invariants in 120 ms returned sat
[2020-05-17 03:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:21:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s911 (- t1977 (+ t1058 t1060)))") while checking expression at index 3
[2020-05-17 03:21:26] [INFO ] [Real]Absence check using 14 positive place invariants in 182 ms returned sat
[2020-05-17 03:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:21:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 03:21:30] [INFO ] [Real]Absence check using state equation in 4176 ms returned (error "Failed to check-sat")
[2020-05-17 03:21:31] [INFO ] [Real]Absence check using 14 positive place invariants in 181 ms returned sat
[2020-05-17 03:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:21:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 03:21:35] [INFO ] [Real]Absence check using state equation in 4235 ms returned (error "Failed to check-sat")
[2020-05-17 03:21:36] [INFO ] [Real]Absence check using 14 positive place invariants in 120 ms returned sat
[2020-05-17 03:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:21:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 03:21:40] [INFO ] [Real]Absence check using state equation in 4333 ms returned (error "Failed to check-sat")
[2020-05-17 03:21:41] [INFO ] [Real]Absence check using 14 positive place invariants in 124 ms returned sat
[2020-05-17 03:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:21:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 03:21:45] [INFO ] [Real]Absence check using state equation in 4412 ms returned (error "Failed to check-sat")
Support contains 35 out of 1988 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1549 edges and 1988 vertex of which 48 / 1988 are part of one of the 8 SCC in 20 ms
Free SCC test removed 40 places
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Iterating post reduction 0 with 397 rules applied. Total rules applied 398 place count 1948 transition count 1892
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 747 place count 1599 transition count 1892
Performed 266 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 266 Pre rules applied. Total rules applied 747 place count 1599 transition count 1626
Deduced a syphon composed of 266 places in 4 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 2 with 532 rules applied. Total rules applied 1279 place count 1333 transition count 1626
Symmetric choice reduction at 2 with 736 rule applications. Total rules 2015 place count 1333 transition count 1626
Deduced a syphon composed of 736 places in 4 ms
Reduce places removed 736 places and 736 transitions.
Iterating global reduction 2 with 1472 rules applied. Total rules applied 3487 place count 597 transition count 890
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 2 with 2 rules applied. Total rules applied 3489 place count 597 transition count 888
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3490 place count 596 transition count 888
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 3490 place count 596 transition count 879
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 3508 place count 587 transition count 879
Symmetric choice reduction at 4 with 112 rule applications. Total rules 3620 place count 587 transition count 879
Deduced a syphon composed of 112 places in 2 ms
Reduce places removed 112 places and 112 transitions.
Iterating global reduction 4 with 224 rules applied. Total rules applied 3844 place count 475 transition count 767
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Iterating post reduction 4 with 103 rules applied. Total rules applied 3947 place count 475 transition count 664
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 4093 place count 402 transition count 591
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 4101 place count 398 transition count 591
Free-agglomeration rule applied 104 times.
Iterating global reduction 5 with 104 rules applied. Total rules applied 4205 place count 398 transition count 487
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 5 with 104 rules applied. Total rules applied 4309 place count 294 transition count 487
Symmetric choice reduction at 6 with 18 rule applications. Total rules 4327 place count 294 transition count 487
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 4363 place count 276 transition count 469
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 4381 place count 276 transition count 451
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 4384 place count 276 transition count 451
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 4391 place count 276 transition count 444
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4392 place count 275 transition count 443
Applied a total of 4392 rules in 755 ms. Remains 275 /1988 variables (removed 1713) and now considering 443/2289 (removed 1846) transitions.
Finished structural reductions, in 1 iterations. Remains : 275/1988 places, 443/2289 transitions.
Incomplete random walk after 1000000 steps, including 11458 resets, run finished after 3622 ms. (steps per millisecond=276 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 1]
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1500 resets, run finished after 952 ms. (steps per millisecond=1050 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 101 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1694 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties seen :[0, 0, 0]
[2020-05-17 03:21:52] [INFO ] Flow matrix only has 426 transitions (discarded 17 similar events)
// Phase 1: matrix 426 rows 275 cols
[2020-05-17 03:21:52] [INFO ] Computed 14 place invariants in 4 ms
[2020-05-17 03:21:52] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned sat
[2020-05-17 03:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:21:53] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2020-05-17 03:21:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-17 03:21:53] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-17 03:21:53] [INFO ] Computed and/alt/rep : 434/1032/417 causal constraints in 71 ms.
[2020-05-17 03:21:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 03:21:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-05-17 03:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 03:21:54] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2020-05-17 03:21:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-17 03:21:54] [INFO ] Computed and/alt/rep : 434/1032/417 causal constraints in 34 ms.
[2020-05-17 03:21:56] [INFO ] Added : 238 causal constraints over 48 iterations in 2158 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-05-17 03:21:56] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2020-05-17 03:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:21:57] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2020-05-17 03:21:57] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-17 03:21:57] [INFO ] Computed and/alt/rep : 434/1032/417 causal constraints in 73 ms.
[2020-05-17 03:21:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 03:21:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 42 ms returned sat
[2020-05-17 03:21:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 03:21:57] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2020-05-17 03:21:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-17 03:21:57] [INFO ] Computed and/alt/rep : 434/1032/417 causal constraints in 25 ms.
[2020-05-17 03:21:59] [INFO ] Added : 226 causal constraints over 46 iterations in 1765 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-05-17 03:21:59] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2020-05-17 03:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:22:00] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2020-05-17 03:22:00] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-17 03:22:00] [INFO ] Computed and/alt/rep : 434/1032/417 causal constraints in 39 ms.
[2020-05-17 03:22:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 03:22:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 28 ms returned sat
[2020-05-17 03:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 03:22:00] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2020-05-17 03:22:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-17 03:22:00] [INFO ] Computed and/alt/rep : 434/1032/417 causal constraints in 34 ms.
[2020-05-17 03:22:02] [INFO ] Added : 196 causal constraints over 40 iterations in 1318 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 46300 steps, including 793 resets, run finished after 427 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 43500 steps, including 682 resets, run finished after 297 ms. (steps per millisecond=146 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 53600 steps, including 854 resets, run finished after 224 ms. (steps per millisecond=239 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 19 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 443/443 transitions.
Graph (trivial) has 65 edges and 275 vertex of which 6 / 275 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 272 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 271 transition count 436
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 271 transition count 433
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 268 transition count 433
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 27 place count 268 transition count 421
Symmetric choice reduction at 3 with 17 rule applications. Total rules 44 place count 268 transition count 421
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 78 place count 251 transition count 404
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 94 place count 243 transition count 396
Symmetric choice reduction at 3 with 6 rule applications. Total rules 100 place count 243 transition count 396
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 112 place count 237 transition count 390
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 118 place count 237 transition count 384
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 155 place count 237 transition count 347
Reduce places removed 38 places and 0 transitions.
Graph (trivial) has 63 edges and 199 vertex of which 25 / 199 are part of one of the 11 SCC in 1 ms
Free SCC test removed 14 places
Iterating post reduction 4 with 39 rules applied. Total rules applied 194 place count 185 transition count 347
Drop transitions removed 25 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 222 place count 185 transition count 319
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 222 place count 185 transition count 307
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 246 place count 173 transition count 307
Symmetric choice reduction at 6 with 6 rule applications. Total rules 252 place count 173 transition count 307
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 264 place count 167 transition count 301
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 270 place count 167 transition count 295
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 296 place count 154 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 298 place count 153 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 300 place count 153 transition count 280
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 313 place count 153 transition count 267
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 324 place count 153 transition count 256
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 8 with 41 rules applied. Total rules applied 365 place count 136 transition count 232
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 28 rules applied. Total rules applied 393 place count 122 transition count 218
Symmetric choice reduction at 10 with 33 rule applications. Total rules 426 place count 122 transition count 218
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 33 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 492 place count 89 transition count 185
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 10 with 33 rules applied. Total rules applied 525 place count 89 transition count 152
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 536 place count 89 transition count 141
Applied a total of 536 rules in 102 ms. Remains 89 /275 variables (removed 186) and now considering 141/443 (removed 302) transitions.
Finished structural reductions, in 1 iterations. Remains : 89/275 places, 141/443 transitions.
Incomplete random walk after 1000000 steps, including 101190 resets, run finished after 2613 ms. (steps per millisecond=382 ) properties seen :[0, 0, 1]
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5246 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2506 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties seen :[0, 0]
// Phase 1: matrix 141 rows 89 cols
[2020-05-17 03:22:07] [INFO ] Computed 7 place invariants in 1 ms
[2020-05-17 03:22:07] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-05-17 03:22:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:22:07] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-05-17 03:22:07] [INFO ] Computed and/alt/rep : 135/250/135 causal constraints in 15 ms.
[2020-05-17 03:22:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 03:22:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2020-05-17 03:22:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 03:22:07] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2020-05-17 03:22:07] [INFO ] Computed and/alt/rep : 135/250/135 causal constraints in 11 ms.
[2020-05-17 03:22:07] [INFO ] Added : 33 causal constraints over 7 iterations in 93 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2020-05-17 03:22:07] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-05-17 03:22:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 03:22:07] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2020-05-17 03:22:07] [INFO ] Computed and/alt/rep : 135/250/135 causal constraints in 13 ms.
[2020-05-17 03:22:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 03:22:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-05-17 03:22:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 03:22:08] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2020-05-17 03:22:08] [INFO ] Computed and/alt/rep : 135/250/135 causal constraints in 10 ms.
[2020-05-17 03:22:08] [INFO ] Added : 49 causal constraints over 10 iterations in 122 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 10100 steps, including 800 resets, run finished after 32 ms. (steps per millisecond=315 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 6400 steps, including 596 resets, run finished after 20 ms. (steps per millisecond=320 ) properties seen :[0, 0] could not realise parikh vector
Support contains 18 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 141/141 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 88 transition count 140
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 87 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 138
Applied a total of 6 rules in 9 ms. Remains 87 /89 variables (removed 2) and now considering 138/141 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/89 places, 138/141 transitions.
Incomplete random walk after 1000000 steps, including 100270 resets, run finished after 2494 ms. (steps per millisecond=400 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5256 resets, run finished after 570 ms. (steps per millisecond=1754 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2532 resets, run finished after 645 ms. (steps per millisecond=1550 ) properties seen :[0, 0]
Finished probabilistic random walk after 1042565 steps, run visited all 2 properties in 1327 ms. (steps per millisecond=785 )
Probabilistic random walk after 1042565 steps, saw 159213 distinct states, run finished after 1327 ms. (steps per millisecond=785 ) properties seen :[1, 1]
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589685734297

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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"

# 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 r081-smll-158922977800335"
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 ;