fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r081-smll-158922977800303
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for FlexibleBarrier-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.490 65467.00 83319.00 309.30 TTTTFTTTTFTTFTFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 3.9K Apr 4 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 4 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 4 06:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 4 06: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.6K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 3 21:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 3 21:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 3 13:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 3 13:18 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 241K 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-08b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589663610763

[2020-05-16 21:13:33] [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-16 21:13:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 21:13:33] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2020-05-16 21:13:33] [INFO ] Transformed 920 places.
[2020-05-16 21:13:33] [INFO ] Transformed 1057 transitions.
[2020-05-16 21:13:33] [INFO ] Found NUPN structural information;
[2020-05-16 21:13:33] [INFO ] Parsed PT model containing 920 places and 1057 transitions in 274 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 157 resets, run finished after 129 ms. (steps per millisecond=77 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 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 21 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 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1057 rows 920 cols
[2020-05-16 21:13:33] [INFO ] Computed 10 place invariants in 41 ms
[2020-05-16 21:13:34] [INFO ] [Real]Absence check using 10 positive place invariants in 59 ms returned sat
[2020-05-16 21:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 21:13:36] [INFO ] [Real]Absence check using state equation in 2297 ms returned sat
[2020-05-16 21:13:37] [INFO ] Deduced a trap composed of 54 places in 1021 ms
[2020-05-16 21:13:38] [INFO ] Deduced a trap composed of 235 places in 684 ms
[2020-05-16 21:13:39] [INFO ] Deduced a trap composed of 294 places in 733 ms
[2020-05-16 21:13:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s293 s295 s297 s299 s301 s303 s318 s325 s326 s327 s512 s513 s514 s515 s522 s523 s524 s525 s528 s529 s532 s533 s540 s541 s542 s543 s544 s545 s546 s547 s548 s549 s550 s551 s552 s553 s554 s555 s556 s557 s559 s561 s563 s564 s565 s566 s567 s568 s569 s571 s572 s577 s578 s579 s580 s581 s582 s583 s584 s587 s588 s589 s592 s593 s594 s595 s657 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667 s668 s669 s670 s671 s672 s673 s674 s675 s676 s677 s678 s679 s680 s681 s683 s684 s685 s686 s687 s688 s689 s690 s691 s692 s693 s694 s695 s696 s697 s698 s699 s700 s701 s702 s703 s704 s705 s706 s707 s708 s709 s710 s711 s712 s713 s714 s715 s716 s717 s718 s719 s720 s721 s722 s723 s724 s725 s726 s727 s728 s729 s730 s731 s732 s733 s734 s735 s736 s737 s738 s739 s740 s741 s746 s747 s748 s749 s750 s751 s752 s753 s754 s755 s756 s757 s758 s759 s760 s761 s762 s763 s764 s765 s766 s767 s768 s769 s770 s771 s772 s773 s774 s776 s777 s778 s779 s780 s781 s782 s783 s784 s785 s786 s787 s788 s789 s790 s791 s792 s793 s794 s795 s796 s797 s798 s799 s800 s801 s802 s803 s804 s806 s807 s808 s809 s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s841 s846 s851 s856 s858 s859 s860 s861 s862 s863 s864 s865 s866 s867 s868 s869 s870 s871 s872 s873 s874 s875 s876 s877 s878 s879 s880 s881 s882 s883 s884 s885 s886 s887 s888 s889 s890 s891 s892 s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905) 0)") while checking expression at index 0
[2020-05-16 21:13:39] [INFO ] [Real]Absence check using 10 positive place invariants in 75 ms returned sat
[2020-05-16 21:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 21:13:42] [INFO ] [Real]Absence check using state equation in 2305 ms returned sat
[2020-05-16 21:13:42] [INFO ] Deduced a trap composed of 54 places in 667 ms
[2020-05-16 21:13:43] [INFO ] Deduced a trap composed of 331 places in 900 ms
[2020-05-16 21:13:44] [INFO ] Deduced a trap composed of 163 places in 321 ms
[2020-05-16 21:13:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2128 ms
[2020-05-16 21:13:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 21:13:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-16 21:13:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 4879 ms returned unknown
[2020-05-16 21:13:49] [INFO ] [Real]Absence check using 10 positive place invariants in 54 ms returned sat
[2020-05-16 21:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 21:13:51] [INFO ] [Real]Absence check using state equation in 2186 ms returned sat
[2020-05-16 21:13:52] [INFO ] Deduced a trap composed of 276 places in 707 ms
[2020-05-16 21:13:53] [INFO ] Deduced a trap composed of 54 places in 606 ms
[2020-05-16 21:13:53] [INFO ] Deduced a trap composed of 92 places in 596 ms
[2020-05-16 21:13:54] [INFO ] Deduced a trap composed of 164 places in 549 ms
[2020-05-16 21:13:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s225 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 s528 s529 s530 s531 s532 s533 s534 s535 s536 s537 s538 s539 s540 s541 s542 s543 s544 s545 s546 s547 s548 s549 s551 s552 s553 s554 s555 s556 s557 s558 s559 s560 s561 s562 s563 s564 s565 s566 s567 s568 s569 s570 s571 s572 s573 s574 s575 s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595) 0)") while checking expression at index 2
[2020-05-16 21:13:54] [INFO ] [Real]Absence check using 10 positive place invariants in 49 ms returned sat
[2020-05-16 21:13:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 21:13:57] [INFO ] [Real]Absence check using state equation in 2912 ms returned sat
[2020-05-16 21:13:58] [INFO ] Deduced a trap composed of 54 places in 393 ms
[2020-05-16 21:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2020-05-16 21:13:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 21:14:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-16 21:14:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 4773 ms returned unknown
[2020-05-16 21:14:03] [INFO ] [Real]Absence check using 10 positive place invariants in 75 ms returned sat
[2020-05-16 21:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 21:14:06] [INFO ] [Real]Absence check using state equation in 2754 ms returned sat
[2020-05-16 21:14:07] [INFO ] Deduced a trap composed of 92 places in 866 ms
[2020-05-16 21:14:07] [INFO ] Deduced a trap composed of 284 places in 570 ms
[2020-05-16 21:14:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1642 ms
[2020-05-16 21:14:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 21:14:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-16 21:14:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 4786 ms returned (error "Solver has unexpectedly terminated")
[2020-05-16 21:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 21:14:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 4
[2020-05-16 21:14:13] [INFO ] [Real]Absence check using 10 positive place invariants in 51 ms returned unsat
[2020-05-16 21:14:13] [INFO ] [Real]Absence check using 10 positive place invariants in 76 ms returned sat
[2020-05-16 21:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 21:14:15] [INFO ] [Real]Absence check using state equation in 2523 ms returned sat
[2020-05-16 21:14:16] [INFO ] Deduced a trap composed of 313 places in 744 ms
[2020-05-16 21:14:17] [INFO ] Deduced a trap composed of 280 places in 662 ms
[2020-05-16 21:14:18] [INFO ] Deduced a trap composed of 319 places in 842 ms
[2020-05-16 21:14:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s108 s109 s116 s117 s120 s121 s123 s125 s127 s128 s129 s130 s131 s132 s133 s134 s135 s137 s139 s141 s142 s143 s144 s145 s146 s147 s148 s149 s151 s152 s157 s158 s159 s160 s161 s162 s163 s164 s167 s168 s169 s172 s173 s174 s597 s599 s601 s602 s603 s605 s607 s608 s609 s610 s611 s612 s613 s615 s617 s619 s621 s622 s623 s624 s625 s626 s627 s628 s629 s630 s631 s633 s634 s639 s640 s641 s642 s643 s644 s645 s646 s649 s650 s651 s652 s653 s655 s656 s661 s662 s663 s664 s665 s666 s667 s668 s669 s670 s671 s672 s673 s674 s675 s676 s677 s678 s679 s680 s681 s682 s683 s684 s685 s686 s688 s689 s690 s691 s692 s693 s694 s695 s696 s701 s706 s707 s708 s709 s710 s711 s712 s713 s714 s716 s717 s718 s719 s720 s721 s726 s727 s728 s729 s730 s731 s732 s733 s734 s735 s736 s737 s738 s739 s740 s741 s742 s743 s744 s745 s746 s747 s748 s749 s750 s751 s756 s757 s758 s759 s760 s761 s762 s763 s764 s765 s766 s767 s768 s769 s770 s771 s772 s773 s774 s775 s776 s777 s778 s779 s780 s781 s782 s783 s784 s786 s787 s788 s789 s790 s791 s792 s793 s794 s795 s796 s797 s798 s799 s800 s801 s802 s803 s804 s805 s806 s807 s808 s809 s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s837 s838 s839 s840 s841 s842 s843 s844 s846 s847 s848 s849 s850 s851 s852 s853 s854 s855 s856 s857 s858 s859 s860 s861 s862 s863 s864 s865 s866 s867 s868 s869 s870 s871 s873 s874 s875 s876 s877 s878 s879 s881 s886 s887 s888 s889 s890 s891 s892 s893 s894 s895 s896 s901 s902 s903 s904 s905 s906 s907) 0)") while checking expression at index 6
[2020-05-16 21:14:18] [INFO ] [Real]Absence check using 10 positive place invariants in 76 ms returned sat
[2020-05-16 21:14:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 21:14:21] [INFO ] [Real]Absence check using state equation in 3028 ms returned sat
[2020-05-16 21:14:22] [INFO ] Deduced a trap composed of 335 places in 748 ms
[2020-05-16 21:14:23] [INFO ] Deduced a trap composed of 198 places in 446 ms
[2020-05-16 21:14:23] [INFO ] Deduced a trap composed of 54 places in 284 ms
[2020-05-16 21:14:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s596 s597 s598 s599 s600 s601 s602 s603 s604 s605 s606 s607 s608 s609 s610 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s626 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653 s654 s909 s910 s911 s912 s913 s914 s915 s916 s917) 0)") while checking expression at index 7
[2020-05-16 21:14:23] [INFO ] [Real]Absence check using 10 positive place invariants in 49 ms returned sat
[2020-05-16 21:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 21:14:26] [INFO ] [Real]Absence check using state equation in 2259 ms returned sat
[2020-05-16 21:14:27] [INFO ] Deduced a trap composed of 139 places in 930 ms
[2020-05-16 21:14:27] [INFO ] Deduced a trap composed of 211 places in 693 ms
[2020-05-16 21:14:28] [INFO ] Deduced a trap composed of 283 places in 756 ms
[2020-05-16 21:14:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s157 s158 s159 s172 s512 s513 s540 s541 s542 s543 s544 s545 s547 s548 s549 s551 s552 s553 s554 s555 s556 s557 s558 s559 s560 s561 s562 s563 s564 s565 s566 s567 s568 s569 s571 s572 s577 s578 s579 s580 s581 s582 s583 s584 s587 s592 s593 s594 s595 s657 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667 s668 s669 s670 s671 s672 s673 s674 s675 s676 s677 s678 s679 s680 s681 s682 s683 s684 s685 s686 s687 s688 s689 s690 s691 s692 s693 s694 s695 s696 s697 s698 s699 s700 s701 s702 s703 s704 s705 s706 s707 s708 s709 s710 s711 s712 s713 s714 s715 s716 s717 s718 s719 s720 s721 s722 s723 s724 s725 s726 s727 s728 s729 s730 s731 s732 s733 s734 s735 s736 s737 s738 s739 s740 s741 s742 s743 s744 s745 s746 s747 s748 s749 s750 s751 s752 s753 s754 s755 s756 s757 s758 s759 s760 s761 s762 s763 s764 s765 s766 s767 s768 s769 s770 s771 s772 s773 s774 s775 s776 s777 s778 s779 s780 s781 s782 s783 s784 s785 s786 s787 s788 s789 s790 s791 s792 s793 s794 s795 s796 s797 s798 s799 s800 s801 s802 s803 s804 s805 s806 s807 s808 s809 s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s841 s843 s844 s845 s846 s848 s849 s850 s851 s856 s861 s866 s867 s868 s869 s870 s871 s872 s873 s874 s875 s876 s877 s878 s879 s880 s881 s882 s883 s884 s885 s886 s887 s888 s889 s890 s891 s892 s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905) 0)") while checking expression at index 8
[2020-05-16 21:14:28] [INFO ] [Real]Absence check using 10 positive place invariants in 75 ms returned sat
[2020-05-16 21:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 21:14:31] [INFO ] [Real]Absence check using state equation in 2767 ms returned sat
[2020-05-16 21:14:32] [INFO ] Deduced a trap composed of 332 places in 950 ms
[2020-05-16 21:14:33] [INFO ] Deduced a trap composed of 356 places in 853 ms
[2020-05-16 21:14:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-16 21:14:34] [INFO ] Deduced a trap composed of 92 places in 864 ms
[2020-05-16 21:14:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175) 0)") while checking expression at index 9
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 31 out of 920 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 729 edges and 920 vertex of which 42 / 920 are part of one of the 7 SCC in 15 ms
Free SCC test removed 35 places
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Iterating post reduction 0 with 215 rules applied. Total rules applied 216 place count 885 transition count 842
Reduce places removed 173 places and 0 transitions.
Iterating post reduction 1 with 173 rules applied. Total rules applied 389 place count 712 transition count 842
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 389 place count 712 transition count 735
Deduced a syphon composed of 107 places in 6 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 603 place count 605 transition count 735
Symmetric choice reduction at 2 with 297 rule applications. Total rules 900 place count 605 transition count 735
Deduced a syphon composed of 297 places in 5 ms
Reduce places removed 297 places and 297 transitions.
Iterating global reduction 2 with 594 rules applied. Total rules applied 1494 place count 308 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 1496 place count 308 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1497 place count 307 transition count 436
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1497 place count 307 transition count 431
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1507 place count 302 transition count 431
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1549 place count 302 transition count 431
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 42 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1633 place count 260 transition count 389
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1666 place count 260 transition count 356
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 1758 place count 214 transition count 310
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1766 place count 214 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1768 place count 213 transition count 302
Free-agglomeration rule applied 68 times.
Iterating global reduction 6 with 68 rules applied. Total rules applied 1836 place count 213 transition count 234
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 6 with 68 rules applied. Total rules applied 1904 place count 145 transition count 234
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1914 place count 145 transition count 234
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 1934 place count 135 transition count 224
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1944 place count 135 transition count 214
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 1951 place count 135 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1952 place count 134 transition count 206
Applied a total of 1952 rules in 418 ms. Remains 134 /920 variables (removed 786) and now considering 206/1057 (removed 851) transitions.
Finished structural reductions, in 1 iterations. Remains : 134/920 places, 206/1057 transitions.
Finished random walk after 58000 steps, including 1880 resets, run visited all 9 properties in 336 ms. (steps per millisecond=172 )
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589663676230

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

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