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-158922977900399.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-20b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922977900399
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.9K Apr 4 19:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 19:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 4 08:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 4 08:41 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.5K 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.2K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 3 21:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 21:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 3 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 3 13:43 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 1.5M 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-20b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589729893468

[2020-05-17 15:38:16] [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 15:38:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-17 15:38:16] [INFO ] Load time of PNML (sax parser for PT used): 546 ms
[2020-05-17 15:38:16] [INFO ] Transformed 5372 places.
[2020-05-17 15:38:16] [INFO ] Transformed 6193 transitions.
[2020-05-17 15:38:16] [INFO ] Found NUPN structural information;
[2020-05-17 15:38:17] [INFO ] Parsed PT model containing 5372 places and 6193 transitions in 715 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 170 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 74 resets, run finished after 350 ms. (steps per millisecond=28 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0]
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 6193 rows 5372 cols
[2020-05-17 15:38:18] [INFO ] Computed 22 place invariants in 466 ms
[2020-05-17 15:38:20] [INFO ] [Real]Absence check using 22 positive place invariants in 585 ms returned sat
[2020-05-17 15:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:38:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 15:38:23] [INFO ] [Real]Absence check using state equation in 2948 ms returned (error "Failed to check-sat")
[2020-05-17 15:38:25] [INFO ] [Real]Absence check using 22 positive place invariants in 462 ms returned sat
[2020-05-17 15:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:38:28] [INFO ] [Real]Absence check using state equation in 3053 ms returned (error "Solver has unexpectedly terminated")
[2020-05-17 15:38:30] [INFO ] [Real]Absence check using 22 positive place invariants in 674 ms returned sat
[2020-05-17 15:38:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:38:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 15:38:33] [INFO ] [Real]Absence check using state equation in 3068 ms returned (error "Failed to check-sat")
[2020-05-17 15:38:35] [INFO ] [Real]Absence check using 22 positive place invariants in 676 ms returned sat
[2020-05-17 15:38:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:38:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 15:38:38] [INFO ] [Real]Absence check using state equation in 2751 ms returned (error "Failed to check-sat")
[2020-05-17 15:38:40] [INFO ] [Real]Absence check using 22 positive place invariants in 690 ms returned sat
[2020-05-17 15:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:38:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 15:38:43] [INFO ] [Real]Absence check using state equation in 2789 ms returned (error "Failed to check-sat")
[2020-05-17 15:38:45] [INFO ] [Real]Absence check using 22 positive place invariants in 686 ms returned sat
[2020-05-17 15:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:38:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 15:38:48] [INFO ] [Real]Absence check using state equation in 2893 ms returned (error "Failed to check-sat")
[2020-05-17 15:38:50] [INFO ] [Real]Absence check using 22 positive place invariants in 696 ms returned sat
[2020-05-17 15:38:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:38:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 15:38:53] [INFO ] [Real]Absence check using state equation in 2829 ms returned (error "Failed to check-sat")
[2020-05-17 15:38:55] [INFO ] [Real]Absence check using 22 positive place invariants in 700 ms returned sat
[2020-05-17 15:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:38:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 15:38:58] [INFO ] [Real]Absence check using state equation in 2888 ms returned (error "Failed to check-sat")
[2020-05-17 15:39:00] [INFO ] [Real]Absence check using 22 positive place invariants in 675 ms returned sat
[2020-05-17 15:39:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:39:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 15:39:03] [INFO ] [Real]Absence check using state equation in 2837 ms returned (error "Failed to check-sat")
[2020-05-17 15:39:05] [INFO ] [Real]Absence check using 22 positive place invariants in 675 ms returned sat
[2020-05-17 15:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:39:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 15:39:08] [INFO ] [Real]Absence check using state equation in 2847 ms returned (error "Failed to check-sat")
[2020-05-17 15:39:10] [INFO ] [Real]Absence check using 22 positive place invariants in 701 ms returned sat
[2020-05-17 15:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:39:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 15:39:13] [INFO ] [Real]Absence check using state equation in 2914 ms returned (error "Failed to check-sat")
Support contains 65 out of 5372 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 4278 edges and 5372 vertex of which 85 / 5372 are part of one of the 14 SCC in 48 ms
Free SCC test removed 71 places
Drop transitions removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Performed 936 Post agglomeration using F-continuation condition.Transition count delta: 936
Iterating post reduction 0 with 1021 rules applied. Total rules applied 1022 place count 5301 transition count 5172
Reduce places removed 936 places and 0 transitions.
Iterating post reduction 1 with 936 rules applied. Total rules applied 1958 place count 4365 transition count 5172
Performed 721 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 721 Pre rules applied. Total rules applied 1958 place count 4365 transition count 4451
Deduced a syphon composed of 721 places in 7 ms
Reduce places removed 721 places and 0 transitions.
Iterating global reduction 2 with 1442 rules applied. Total rules applied 3400 place count 3644 transition count 4451
Symmetric choice reduction at 2 with 2177 rule applications. Total rules 5577 place count 3644 transition count 4451
Deduced a syphon composed of 2177 places in 19 ms
Reduce places removed 2177 places and 2177 transitions.
Iterating global reduction 2 with 4354 rules applied. Total rules applied 9931 place count 1467 transition count 2274
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 9931 place count 1467 transition count 2259
Deduced a syphon composed of 15 places in 11 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 9961 place count 1452 transition count 2259
Symmetric choice reduction at 2 with 345 rule applications. Total rules 10306 place count 1452 transition count 2259
Deduced a syphon composed of 345 places in 5 ms
Reduce places removed 345 places and 345 transitions.
Iterating global reduction 2 with 690 rules applied. Total rules applied 10996 place count 1107 transition count 1914
Ensure Unique test removed 333 transitions
Reduce isomorphic transitions removed 333 transitions.
Iterating post reduction 2 with 333 rules applied. Total rules applied 11329 place count 1107 transition count 1581
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 2 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 11567 place count 988 transition count 1462
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
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 11579 place count 982 transition count 1462
Free-agglomeration rule applied 297 times.
Iterating global reduction 3 with 297 rules applied. Total rules applied 11876 place count 982 transition count 1165
Reduce places removed 297 places and 0 transitions.
Iterating post reduction 3 with 297 rules applied. Total rules applied 12173 place count 685 transition count 1165
Symmetric choice reduction at 4 with 30 rule applications. Total rules 12203 place count 685 transition count 1165
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 30 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 12263 place count 655 transition count 1135
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 12293 place count 655 transition count 1105
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 12299 place count 655 transition count 1105
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 12313 place count 655 transition count 1091
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 12314 place count 654 transition count 1090
Applied a total of 12314 rules in 2445 ms. Remains 654 /5372 variables (removed 4718) and now considering 1090/6193 (removed 5103) transitions.
Finished structural reductions, in 1 iterations. Remains : 654/5372 places, 1090/6193 transitions.
Incomplete random walk after 1000000 steps, including 7404 resets, run finished after 6332 ms. (steps per millisecond=157 ) properties seen :[1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1]
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 695 resets, run finished after 1242 ms. (steps per millisecond=805 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 17 resets, run finished after 1799 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 710 resets, run finished after 975 ms. (steps per millisecond=1025 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 81 resets, run finished after 1047 ms. (steps per millisecond=955 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 718 resets, run finished after 1083 ms. (steps per millisecond=923 ) properties seen :[0, 0, 0, 0, 0]
[2020-05-17 15:39:28] [INFO ] Flow matrix only has 1059 transitions (discarded 31 similar events)
// Phase 1: matrix 1059 rows 654 cols
[2020-05-17 15:39:28] [INFO ] Computed 22 place invariants in 26 ms
[2020-05-17 15:39:28] [INFO ] [Real]Absence check using 22 positive place invariants in 63 ms returned sat
[2020-05-17 15:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:39:30] [INFO ] [Real]Absence check using state equation in 2134 ms returned sat
[2020-05-17 15:39:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-17 15:39:31] [INFO ] [Real]Added 1 Read/Feed constraints in 14 ms returned sat
[2020-05-17 15:39:31] [INFO ] Deduced a trap composed of 363 places in 746 ms
[2020-05-17 15:39:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 919 ms
[2020-05-17 15:39:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 15:39:32] [INFO ] [Nat]Absence check using 22 positive place invariants in 70 ms returned sat
[2020-05-17 15:39:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 15:39:34] [INFO ] [Nat]Absence check using state equation in 2151 ms returned sat
[2020-05-17 15:39:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-05-17 15:39:35] [INFO ] Deduced a trap composed of 363 places in 537 ms
[2020-05-17 15:39:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 694 ms
[2020-05-17 15:39:35] [INFO ] Computed and/alt/rep : 1072/4090/1041 causal constraints in 176 ms.
[2020-05-17 15:39:44] [INFO ] Added : 410 causal constraints over 82 iterations in 9074 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 55 ms.
[2020-05-17 15:39:44] [INFO ] [Real]Absence check using 22 positive place invariants in 41 ms returned sat
[2020-05-17 15:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:39:46] [INFO ] [Real]Absence check using state equation in 2013 ms returned sat
[2020-05-17 15:39:46] [INFO ] [Real]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-05-17 15:39:47] [INFO ] Computed and/alt/rep : 1072/4090/1041 causal constraints in 105 ms.
[2020-05-17 15:39:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 15:39:47] [INFO ] [Nat]Absence check using 22 positive place invariants in 47 ms returned sat
[2020-05-17 15:39:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 15:39:49] [INFO ] [Nat]Absence check using state equation in 1954 ms returned sat
[2020-05-17 15:39:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-17 15:39:49] [INFO ] Computed and/alt/rep : 1072/4090/1041 causal constraints in 78 ms.
[2020-05-17 15:39:57] [INFO ] Added : 404 causal constraints over 81 iterations in 8049 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
[2020-05-17 15:39:58] [INFO ] [Real]Absence check using 22 positive place invariants in 66 ms returned sat
[2020-05-17 15:39:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:40:00] [INFO ] [Real]Absence check using state equation in 2053 ms returned sat
[2020-05-17 15:40:00] [INFO ] [Real]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-05-17 15:40:00] [INFO ] Deduced a trap composed of 366 places in 691 ms
[2020-05-17 15:40:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 777 ms
[2020-05-17 15:40:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 15:40:01] [INFO ] [Nat]Absence check using 22 positive place invariants in 72 ms returned sat
[2020-05-17 15:40:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 15:40:03] [INFO ] [Nat]Absence check using state equation in 2169 ms returned sat
[2020-05-17 15:40:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-05-17 15:40:04] [INFO ] Deduced a trap composed of 366 places in 648 ms
[2020-05-17 15:40:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 756 ms
[2020-05-17 15:40:04] [INFO ] Computed and/alt/rep : 1072/4090/1041 causal constraints in 87 ms.
[2020-05-17 15:40:12] [INFO ] Added : 393 causal constraints over 79 iterations in 8227 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
[2020-05-17 15:40:12] [INFO ] [Real]Absence check using 22 positive place invariants in 43 ms returned sat
[2020-05-17 15:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:40:14] [INFO ] [Real]Absence check using state equation in 1938 ms returned sat
[2020-05-17 15:40:14] [INFO ] [Real]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-05-17 15:40:15] [INFO ] Deduced a trap composed of 365 places in 646 ms
[2020-05-17 15:40:16] [INFO ] Deduced a trap composed of 364 places in 634 ms
[2020-05-17 15:40:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1445 ms
[2020-05-17 15:40:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 15:40:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 64 ms returned sat
[2020-05-17 15:40:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 15:40:18] [INFO ] [Nat]Absence check using state equation in 2191 ms returned sat
[2020-05-17 15:40:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-05-17 15:40:19] [INFO ] Deduced a trap composed of 364 places in 539 ms
[2020-05-17 15:40:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 644 ms
[2020-05-17 15:40:19] [INFO ] Computed and/alt/rep : 1072/4090/1041 causal constraints in 99 ms.
[2020-05-17 15:40:27] [INFO ] Added : 403 causal constraints over 81 iterations in 7568 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 43 ms.
[2020-05-17 15:40:27] [INFO ] [Real]Absence check using 22 positive place invariants in 62 ms returned sat
[2020-05-17 15:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:40:29] [INFO ] [Real]Absence check using state equation in 2084 ms returned sat
[2020-05-17 15:40:29] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-17 15:40:30] [INFO ] Deduced a trap composed of 359 places in 605 ms
[2020-05-17 15:40:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 643 ms
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 84700 steps, including 876 resets, run finished after 663 ms. (steps per millisecond=127 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 82200 steps, including 799 resets, run finished after 579 ms. (steps per millisecond=141 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 82000 steps, including 799 resets, run finished after 565 ms. (steps per millisecond=145 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 83300 steps, including 824 resets, run finished after 566 ms. (steps per millisecond=147 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 33 out of 654 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 654/654 places, 1090/1090 transitions.
Graph (trivial) has 58 edges and 654 vertex of which 2 / 654 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 653 transition count 1081
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 17 place count 646 transition count 1081
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 17 place count 646 transition count 1076
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 27 place count 641 transition count 1076
Symmetric choice reduction at 2 with 11 rule applications. Total rules 38 place count 641 transition count 1076
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 60 place count 630 transition count 1065
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 630 transition count 1065
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 629 transition count 1064
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 629 transition count 1063
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 86 place count 618 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 618 transition count 1051
Symmetric choice reduction at 4 with 7 rule applications. Total rules 94 place count 618 transition count 1051
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 108 place count 611 transition count 1044
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 115 place count 611 transition count 1037
Free-agglomeration rule applied 22 times with reduction of 1 identical transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 137 place count 611 transition count 1014
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 159 place count 589 transition count 1014
Symmetric choice reduction at 6 with 17 rule applications. Total rules 176 place count 589 transition count 1014
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 210 place count 572 transition count 997
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 227 place count 572 transition count 980
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 228 place count 572 transition count 980
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 230 place count 572 transition count 978
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 231 place count 572 transition count 977
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 232 place count 571 transition count 977
Applied a total of 232 rules in 414 ms. Remains 571 /654 variables (removed 83) and now considering 977/1090 (removed 113) transitions.
Finished structural reductions, in 1 iterations. Remains : 571/654 places, 977/1090 transitions.
Incomplete random walk after 1000000 steps, including 6351 resets, run finished after 5780 ms. (steps per millisecond=173 ) properties seen :[0, 1, 0, 0]
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 691 resets, run finished after 974 ms. (steps per millisecond=1026 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 698 resets, run finished after 977 ms. (steps per millisecond=1023 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 74 resets, run finished after 1030 ms. (steps per millisecond=970 ) properties seen :[0, 0, 0]
[2020-05-17 15:40:41] [INFO ] Flow matrix only has 944 transitions (discarded 33 similar events)
// Phase 1: matrix 944 rows 571 cols
[2020-05-17 15:40:41] [INFO ] Computed 22 place invariants in 19 ms
[2020-05-17 15:40:42] [INFO ] [Real]Absence check using 22 positive place invariants in 34 ms returned sat
[2020-05-17 15:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:40:43] [INFO ] [Real]Absence check using state equation in 1583 ms returned sat
[2020-05-17 15:40:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-17 15:40:43] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-17 15:40:44] [INFO ] Deduced a trap composed of 328 places in 506 ms
[2020-05-17 15:40:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 598 ms
[2020-05-17 15:40:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 15:40:44] [INFO ] [Nat]Absence check using 22 positive place invariants in 53 ms returned sat
[2020-05-17 15:40:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 15:40:46] [INFO ] [Nat]Absence check using state equation in 1693 ms returned sat
[2020-05-17 15:40:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-05-17 15:40:46] [INFO ] Deduced a trap composed of 330 places in 527 ms
[2020-05-17 15:40:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 616 ms
[2020-05-17 15:40:46] [INFO ] Computed and/alt/rep : 963/2263/930 causal constraints in 103 ms.
[2020-05-17 15:40:52] [INFO ] Added : 311 causal constraints over 63 iterations in 5515 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-05-17 15:40:52] [INFO ] [Real]Absence check using 22 positive place invariants in 55 ms returned sat
[2020-05-17 15:40:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:40:54] [INFO ] [Real]Absence check using state equation in 1674 ms returned sat
[2020-05-17 15:40:54] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-17 15:40:55] [INFO ] Deduced a trap composed of 329 places in 526 ms
[2020-05-17 15:40:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 613 ms
[2020-05-17 15:40:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 15:40:55] [INFO ] [Nat]Absence check using 22 positive place invariants in 52 ms returned sat
[2020-05-17 15:40:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 15:40:57] [INFO ] [Nat]Absence check using state equation in 1613 ms returned sat
[2020-05-17 15:40:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-05-17 15:40:57] [INFO ] Deduced a trap composed of 329 places in 537 ms
[2020-05-17 15:40:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 622 ms
[2020-05-17 15:40:57] [INFO ] Computed and/alt/rep : 963/2263/930 causal constraints in 103 ms.
[2020-05-17 15:41:02] [INFO ] Added : 303 causal constraints over 61 iterations in 5289 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-05-17 15:41:03] [INFO ] [Real]Absence check using 22 positive place invariants in 57 ms returned sat
[2020-05-17 15:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:41:05] [INFO ] [Real]Absence check using state equation in 1752 ms returned sat
[2020-05-17 15:41:05] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-17 15:41:05] [INFO ] Deduced a trap composed of 327 places in 508 ms
[2020-05-17 15:41:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 597 ms
[2020-05-17 15:41:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 15:41:05] [INFO ] [Nat]Absence check using 22 positive place invariants in 56 ms returned sat
[2020-05-17 15:41:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 15:41:07] [INFO ] [Nat]Absence check using state equation in 1720 ms returned sat
[2020-05-17 15:41:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-17 15:41:08] [INFO ] Deduced a trap composed of 327 places in 521 ms
[2020-05-17 15:41:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 610 ms
[2020-05-17 15:41:08] [INFO ] Computed and/alt/rep : 963/2263/930 causal constraints in 103 ms.
[2020-05-17 15:41:14] [INFO ] Added : 314 causal constraints over 63 iterations in 5681 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
Incomplete Parikh walk after 63200 steps, including 699 resets, run finished after 692 ms. (steps per millisecond=91 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 66800 steps, including 707 resets, run finished after 570 ms. (steps per millisecond=117 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 68100 steps, including 697 resets, run finished after 438 ms. (steps per millisecond=155 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 18 out of 571 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 571/571 places, 977/977 transitions.
Graph (trivial) has 347 edges and 571 vertex of which 4 / 571 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 569 transition count 972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 568 transition count 972
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 568 transition count 970
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 566 transition count 970
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 31 place count 566 transition count 950
Symmetric choice reduction at 3 with 23 rule applications. Total rules 54 place count 566 transition count 950
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 100 place count 543 transition count 927
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 541 transition count 925
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 541 transition count 925
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 538 transition count 922
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 538 transition count 919
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 537 transition count 918
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 134 place count 537 transition count 902
Free-agglomeration rule applied 332 times with reduction of 2 identical transitions.
Iterating global reduction 5 with 332 rules applied. Total rules applied 466 place count 537 transition count 568
Reduce places removed 333 places and 0 transitions.
Drop transitions removed 154 transitions
Reduce isomorphic transitions removed 154 transitions.
Graph (trivial) has 102 edges and 204 vertex of which 33 / 204 are part of one of the 16 SCC in 1 ms
Free SCC test removed 17 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 489 rules applied. Total rules applied 955 place count 187 transition count 413
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 990 place count 186 transition count 379
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 990 place count 186 transition count 360
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 1028 place count 167 transition count 360
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1047 place count 167 transition count 341
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 8 with 48 rules applied. Total rules applied 1095 place count 143 transition count 317
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1096 place count 143 transition count 316
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 9 with 8 rules applied. Total rules applied 1104 place count 139 transition count 316
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1112 place count 139 transition count 308
Free-agglomeration rule applied 16 times.
Iterating global reduction 10 with 16 rules applied. Total rules applied 1128 place count 139 transition count 292
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 10 with 90 rules applied. Total rules applied 1218 place count 112 transition count 229
Symmetric choice reduction at 11 with 40 rule applications. Total rules 1258 place count 112 transition count 229
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 40 transitions.
Iterating global reduction 11 with 80 rules applied. Total rules applied 1338 place count 72 transition count 189
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 11 with 40 rules applied. Total rules applied 1378 place count 72 transition count 149
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 12 with 31 rules applied. Total rules applied 1409 place count 72 transition count 118
Applied a total of 1409 rules in 153 ms. Remains 72 /571 variables (removed 499) and now considering 118/977 (removed 859) transitions.
Finished structural reductions, in 1 iterations. Remains : 72/571 places, 118/977 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2331 ms. (steps per millisecond=429 ) properties seen :[1, 0, 0]
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 624 ms. (steps per millisecond=1602 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1010 ms. (steps per millisecond=990 ) properties seen :[0, 0]
// Phase 1: matrix 118 rows 72 cols
[2020-05-17 15:41:20] [INFO ] Computed 10 place invariants in 1 ms
[2020-05-17 15:41:20] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2020-05-17 15:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:41:20] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-05-17 15:41:20] [INFO ] Computed and/alt/rep : 99/162/99 causal constraints in 8 ms.
[2020-05-17 15:41:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 15:41:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2020-05-17 15:41:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 15:41:20] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-05-17 15:41:20] [INFO ] Computed and/alt/rep : 99/162/99 causal constraints in 7 ms.
[2020-05-17 15:41:20] [INFO ] Added : 42 causal constraints over 9 iterations in 116 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-05-17 15:41:20] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2020-05-17 15:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 15:41:20] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2020-05-17 15:41:20] [INFO ] Deduced a trap composed of 9 places in 39 ms
[2020-05-17 15:41:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2020-05-17 15:41:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 15:41:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2020-05-17 15:41:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 15:41:20] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2020-05-17 15:41:20] [INFO ] Deduced a trap composed of 9 places in 41 ms
[2020-05-17 15:41:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2020-05-17 15:41:20] [INFO ] Computed and/alt/rep : 99/162/99 causal constraints in 12 ms.
[2020-05-17 15:41:20] [INFO ] Added : 39 causal constraints over 9 iterations in 129 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Incomplete Parikh walk after 7000 steps, including 343 resets, run finished after 37 ms. (steps per millisecond=189 ) properties seen :[0, 1] could not realise parikh vector
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 7500 steps, including 355 resets, run finished after 35 ms. (steps per millisecond=214 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 118/118 transitions.
Graph (trivial) has 62 edges and 72 vertex of which 8 / 72 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 68 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 66 transition count 108
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 66 transition count 107
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 64 transition count 107
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 64 transition count 106
Symmetric choice reduction at 3 with 7 rule applications. Total rules 24 place count 64 transition count 106
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 38 place count 57 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 42 place count 57 transition count 95
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 63 place count 45 transition count 86
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 73 place count 45 transition count 76
Symmetric choice reduction at 5 with 12 rule applications. Total rules 85 place count 45 transition count 76
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 109 place count 33 transition count 64
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 121 place count 33 transition count 52
Free-agglomeration rule applied 23 times with reduction of 1 identical transitions.
Iterating global reduction 6 with 23 rules applied. Total rules applied 144 place count 33 transition count 28
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 191 place count 7 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 192 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 193 place count 6 transition count 6
Applied a total of 193 rules in 9 ms. Remains 6 /72 variables (removed 66) and now considering 6/118 (removed 112) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/72 places, 6/118 transitions.
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589730081828

--------------------
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-20b"
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-20b, 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-158922977900399"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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