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.r170-smll-158987815800399.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 itslola
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 r170-smll-158987815800399
=====================================================================

--------------------
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 1591413507366

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 03:18:29] [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, -timeout, 3600, -rebuildPNML]
[2020-06-06 03:18:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 03:18:30] [INFO ] Load time of PNML (sax parser for PT used): 425 ms
[2020-06-06 03:18:30] [INFO ] Transformed 5372 places.
[2020-06-06 03:18:30] [INFO ] Transformed 6193 transitions.
[2020-06-06 03:18:30] [INFO ] Found NUPN structural information;
[2020-06-06 03:18:30] [INFO ] Parsed PT model containing 5372 places and 6193 transitions in 545 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 148 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 75 resets, run finished after 203 ms. (steps per millisecond=49 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0]
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 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 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 19 ms. (steps per millisecond=526 ) properties seen :[0, 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 30 ms. (steps per millisecond=333 ) properties seen :[0, 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 24 ms. (steps per millisecond=416 ) properties seen :[0, 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 34 ms. (steps per millisecond=294 ) properties seen :[0, 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 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 10000 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) 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 13 ms. (steps per millisecond=769 ) 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 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 6193 rows 5372 cols
[2020-06-06 03:18:31] [INFO ] Computed 22 place invariants in 509 ms
[2020-06-06 03:18:33] [INFO ] [Real]Absence check using 22 positive place invariants in 504 ms returned sat
[2020-06-06 03:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:18:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 03:18:36] [INFO ] [Real]Absence check using state equation in 2972 ms returned (error "Failed to check-sat")
[2020-06-06 03:18:38] [INFO ] [Real]Absence check using 22 positive place invariants in 434 ms returned sat
[2020-06-06 03:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:18:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 03:18:41] [INFO ] [Real]Absence check using state equation in 3346 ms returned (error "Failed to check-sat")
[2020-06-06 03:18:43] [INFO ] [Real]Absence check using 22 positive place invariants in 657 ms returned sat
[2020-06-06 03:18:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:18:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 03:18:46] [INFO ] [Real]Absence check using state equation in 2976 ms returned (error "Failed to check-sat")
[2020-06-06 03:18:49] [INFO ] [Real]Absence check using 22 positive place invariants in 662 ms returned sat
[2020-06-06 03:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:18:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 03:18:51] [INFO ] [Real]Absence check using state equation in 2669 ms returned (error "Failed to check-sat")
[2020-06-06 03:18:53] [INFO ] [Real]Absence check using 22 positive place invariants in 706 ms returned sat
[2020-06-06 03:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:18:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 03:18:56] [INFO ] [Real]Absence check using state equation in 2871 ms returned (error "Failed to check-sat")
[2020-06-06 03:18:58] [INFO ] [Real]Absence check using 22 positive place invariants in 602 ms returned sat
[2020-06-06 03:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:19:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 03:19:01] [INFO ] [Real]Absence check using state equation in 3241 ms returned unknown
[2020-06-06 03:19:03] [INFO ] [Real]Absence check using 22 positive place invariants in 685 ms returned sat
[2020-06-06 03:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:19:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 03:19:06] [INFO ] [Real]Absence check using state equation in 2986 ms returned (error "Failed to check-sat")
[2020-06-06 03:19:08] [INFO ] [Real]Absence check using 22 positive place invariants in 428 ms returned sat
[2020-06-06 03:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:19:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 03:19:11] [INFO ] [Real]Absence check using state equation in 3462 ms returned (error "Failed to check-sat")
[2020-06-06 03:19:13] [INFO ] [Real]Absence check using 22 positive place invariants in 584 ms returned sat
[2020-06-06 03:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:19:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 03:19:16] [INFO ] [Real]Absence check using state equation in 2916 ms returned (error "Failed to check-sat")
[2020-06-06 03:19:18] [INFO ] [Real]Absence check using 22 positive place invariants in 653 ms returned sat
[2020-06-06 03:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:19:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 03:19:21] [INFO ] [Real]Absence check using state equation in 3033 ms returned (error "Failed to check-sat")
Support contains 55 out of 5372 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 4292 edges and 5372 vertex of which 85 / 5372 are part of one of the 14 SCC in 36 ms
Free SCC test removed 71 places
Drop transitions removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Performed 939 Post agglomeration using F-continuation condition.Transition count delta: 939
Iterating post reduction 0 with 1024 rules applied. Total rules applied 1025 place count 5301 transition count 5169
Reduce places removed 939 places and 0 transitions.
Iterating post reduction 1 with 939 rules applied. Total rules applied 1964 place count 4362 transition count 5169
Performed 723 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 723 Pre rules applied. Total rules applied 1964 place count 4362 transition count 4446
Deduced a syphon composed of 723 places in 8 ms
Reduce places removed 723 places and 0 transitions.
Iterating global reduction 2 with 1446 rules applied. Total rules applied 3410 place count 3639 transition count 4446
Symmetric choice reduction at 2 with 2182 rule applications. Total rules 5592 place count 3639 transition count 4446
Deduced a syphon composed of 2182 places in 12 ms
Reduce places removed 2182 places and 2182 transitions.
Iterating global reduction 2 with 4364 rules applied. Total rules applied 9956 place count 1457 transition count 2264
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 9956 place count 1457 transition count 2248
Deduced a syphon composed of 16 places in 6 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 9988 place count 1441 transition count 2248
Symmetric choice reduction at 2 with 347 rule applications. Total rules 10335 place count 1441 transition count 2248
Deduced a syphon composed of 347 places in 3 ms
Reduce places removed 347 places and 347 transitions.
Iterating global reduction 2 with 694 rules applied. Total rules applied 11029 place count 1094 transition count 1901
Ensure Unique test removed 335 transitions
Reduce isomorphic transitions removed 335 transitions.
Iterating post reduction 2 with 335 rules applied. Total rules applied 11364 place count 1094 transition count 1566
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 11606 place count 973 transition count 1445
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 11618 place count 967 transition count 1445
Free-agglomeration rule applied 295 times.
Iterating global reduction 3 with 295 rules applied. Total rules applied 11913 place count 967 transition count 1150
Reduce places removed 295 places and 0 transitions.
Iterating post reduction 3 with 295 rules applied. Total rules applied 12208 place count 672 transition count 1150
Symmetric choice reduction at 4 with 32 rule applications. Total rules 12240 place count 672 transition count 1150
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 32 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 12304 place count 640 transition count 1118
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 12336 place count 640 transition count 1086
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 12342 place count 640 transition count 1086
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 12355 place count 640 transition count 1073
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 12356 place count 639 transition count 1072
Applied a total of 12356 rules in 2715 ms. Remains 639 /5372 variables (removed 4733) and now considering 1072/6193 (removed 5121) transitions.
Finished structural reductions, in 1 iterations. Remains : 639/5372 places, 1072/6193 transitions.
Incomplete random walk after 1000000 steps, including 7790 resets, run finished after 5151 ms. (steps per millisecond=194 ) properties seen :[1, 0, 1, 1, 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-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 719 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 729 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 86 resets, run finished after 1040 ms. (steps per millisecond=961 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 738 resets, run finished after 1009 ms. (steps per millisecond=991 ) properties seen :[0, 0, 0, 0]
[2020-06-06 03:19:33] [INFO ] Flow matrix only has 1040 transitions (discarded 32 similar events)
// Phase 1: matrix 1040 rows 639 cols
[2020-06-06 03:19:33] [INFO ] Computed 22 place invariants in 65 ms
[2020-06-06 03:19:33] [INFO ] [Real]Absence check using 22 positive place invariants in 37 ms returned sat
[2020-06-06 03:19:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:19:35] [INFO ] [Real]Absence check using state equation in 1397 ms returned sat
[2020-06-06 03:19:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-06 03:19:35] [INFO ] [Real]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-06 03:19:36] [INFO ] Deduced a trap composed of 359 places in 535 ms
[2020-06-06 03:19:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 671 ms
[2020-06-06 03:19:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:19:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 47 ms returned sat
[2020-06-06 03:19:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:19:37] [INFO ] [Nat]Absence check using state equation in 1377 ms returned sat
[2020-06-06 03:19:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-06 03:19:38] [INFO ] Deduced a trap composed of 359 places in 514 ms
[2020-06-06 03:19:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 624 ms
[2020-06-06 03:19:38] [INFO ] Computed and/alt/rep : 1055/3283/1023 causal constraints in 155 ms.
[2020-06-06 03:19:45] [INFO ] Added : 382 causal constraints over 77 iterations in 7283 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 54 ms.
[2020-06-06 03:19:46] [INFO ] [Real]Absence check using 22 positive place invariants in 37 ms returned sat
[2020-06-06 03:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:19:47] [INFO ] [Real]Absence check using state equation in 1417 ms returned sat
[2020-06-06 03:19:47] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-06 03:19:47] [INFO ] Computed and/alt/rep : 1055/3283/1023 causal constraints in 117 ms.
[2020-06-06 03:19:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:19:48] [INFO ] [Nat]Absence check using 22 positive place invariants in 37 ms returned sat
[2020-06-06 03:19:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:19:49] [INFO ] [Nat]Absence check using state equation in 1328 ms returned sat
[2020-06-06 03:19:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-06 03:19:49] [INFO ] Computed and/alt/rep : 1055/3283/1023 causal constraints in 79 ms.
[2020-06-06 03:19:54] [INFO ] Added : 370 causal constraints over 74 iterations in 4826 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-06-06 03:19:54] [INFO ] [Real]Absence check using 22 positive place invariants in 63 ms returned sat
[2020-06-06 03:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:19:56] [INFO ] [Real]Absence check using state equation in 2044 ms returned sat
[2020-06-06 03:19:56] [INFO ] [Real]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-06-06 03:19:57] [INFO ] Deduced a trap composed of 358 places in 535 ms
[2020-06-06 03:19:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 607 ms
[2020-06-06 03:19:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:19:57] [INFO ] [Nat]Absence check using 22 positive place invariants in 61 ms returned sat
[2020-06-06 03:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:19:59] [INFO ] [Nat]Absence check using state equation in 1732 ms returned sat
[2020-06-06 03:19:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2020-06-06 03:20:00] [INFO ] Deduced a trap composed of 358 places in 600 ms
[2020-06-06 03:20:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 695 ms
[2020-06-06 03:20:00] [INFO ] Computed and/alt/rep : 1055/3283/1023 causal constraints in 94 ms.
[2020-06-06 03:20:06] [INFO ] Added : 370 causal constraints over 74 iterations in 6587 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-06 03:20:07] [INFO ] [Real]Absence check using 22 positive place invariants in 65 ms returned sat
[2020-06-06 03:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:20:08] [INFO ] [Real]Absence check using state equation in 1501 ms returned sat
[2020-06-06 03:20:08] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-06 03:20:09] [INFO ] Deduced a trap composed of 356 places in 471 ms
[2020-06-06 03:20:09] [INFO ] Deduced a trap composed of 355 places in 468 ms
[2020-06-06 03:20:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1050 ms
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 77500 steps, including 849 resets, run finished after 904 ms. (steps per millisecond=85 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 77500 steps, including 823 resets, run finished after 577 ms. (steps per millisecond=134 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 78100 steps, including 806 resets, run finished after 480 ms. (steps per millisecond=162 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 18 out of 639 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 639/639 places, 1072/1072 transitions.
Graph (trivial) has 413 edges and 639 vertex of which 6 / 639 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 636 transition count 1059
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 21 place count 629 transition count 1059
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 21 place count 629 transition count 1056
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 626 transition count 1056
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 47 place count 626 transition count 1036
Symmetric choice reduction at 3 with 32 rule applications. Total rules 79 place count 626 transition count 1036
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 32 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 143 place count 594 transition count 1004
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 159 place count 586 transition count 996
Symmetric choice reduction at 3 with 8 rule applications. Total rules 167 place count 586 transition count 996
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 183 place count 578 transition count 988
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 191 place count 578 transition count 980
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 193 place count 577 transition count 979
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 209 place count 577 transition count 963
Free-agglomeration rule applied 371 times with reduction of 3 identical transitions.
Iterating global reduction 5 with 371 rules applied. Total rules applied 580 place count 577 transition count 589
Reduce places removed 372 places and 0 transitions.
Drop transitions removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Graph (trivial) has 102 edges and 205 vertex of which 34 / 205 are part of one of the 16 SCC in 1 ms
Free SCC test removed 18 places
Iterating post reduction 5 with 546 rules applied. Total rules applied 1126 place count 187 transition count 416
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 6 with 36 rules applied. Total rules applied 1162 place count 187 transition count 380
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 1162 place count 187 transition count 360
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 1202 place count 167 transition count 360
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1222 place count 167 transition count 340
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 1270 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 8 with 8 rules applied. Total rules applied 1278 place count 139 transition count 316
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1286 place count 139 transition count 308
Free-agglomeration rule applied 16 times.
Iterating global reduction 9 with 16 rules applied. Total rules applied 1302 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 9 with 90 rules applied. Total rules applied 1392 place count 112 transition count 229
Symmetric choice reduction at 10 with 40 rule applications. Total rules 1432 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 10 with 80 rules applied. Total rules applied 1512 place count 72 transition count 189
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 10 with 40 rules applied. Total rules applied 1552 place count 72 transition count 149
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 11 with 31 rules applied. Total rules applied 1583 place count 72 transition count 118
Applied a total of 1583 rules in 324 ms. Remains 72 /639 variables (removed 567) and now considering 118/1072 (removed 954) transitions.
Finished structural reductions, in 1 iterations. Remains : 72/639 places, 118/1072 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2082 ms. (steps per millisecond=480 ) properties seen :[1, 0, 0]
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 622 ms. (steps per millisecond=1607 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1200 ms. (steps per millisecond=833 ) properties seen :[0, 0]
// Phase 1: matrix 118 rows 72 cols
[2020-06-06 03:20:16] [INFO ] Computed 10 place invariants in 1 ms
[2020-06-06 03:20:16] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2020-06-06 03:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:20:16] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2020-06-06 03:20:16] [INFO ] Computed and/alt/rep : 99/162/99 causal constraints in 9 ms.
[2020-06-06 03:20:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:20:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2020-06-06 03:20:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:20:16] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-06-06 03:20:16] [INFO ] Computed and/alt/rep : 99/162/99 causal constraints in 10 ms.
[2020-06-06 03:20:16] [INFO ] Added : 42 causal constraints over 9 iterations in 91 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2020-06-06 03:20:16] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2020-06-06 03:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:20:16] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-06-06 03:20:16] [INFO ] Deduced a trap composed of 9 places in 29 ms
[2020-06-06 03:20:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2020-06-06 03:20:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:20:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2020-06-06 03:20:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:20:16] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2020-06-06 03:20:16] [INFO ] Deduced a trap composed of 9 places in 40 ms
[2020-06-06 03:20:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2020-06-06 03:20:16] [INFO ] Computed and/alt/rep : 99/162/99 causal constraints in 11 ms.
[2020-06-06 03:20:16] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Incomplete Parikh walk after 600 steps, including 94 resets, run finished after 4 ms. (steps per millisecond=150 ) 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 361 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 0 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 1 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 12 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 108 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=108 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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="itslola"
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 itslola"
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 r170-smll-158987815800399"
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 ;