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

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 09:13:01] [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-05 09:13:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 09:13:01] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2020-06-05 09:13:01] [INFO ] Transformed 920 places.
[2020-06-05 09:13:02] [INFO ] Transformed 1057 transitions.
[2020-06-05 09:13:02] [INFO ] Found NUPN structural information;
[2020-06-05 09:13:02] [INFO ] Parsed PT model containing 920 places and 1057 transitions in 312 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 76 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 157 resets, run finished after 192 ms. (steps per millisecond=52 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0]
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-10 TRUE 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 19 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 19 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[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 40 ms. (steps per millisecond=250 ) properties seen :[1, 0, 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 10001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[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 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[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, 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 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1057 rows 920 cols
[2020-06-05 09:13:02] [INFO ] Computed 10 place invariants in 56 ms
[2020-06-05 09:13:03] [INFO ] [Real]Absence check using 10 positive place invariants in 60 ms returned sat
[2020-06-05 09:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:13:05] [INFO ] [Real]Absence check using state equation in 2362 ms returned sat
[2020-06-05 09:13:06] [INFO ] Deduced a trap composed of 54 places in 913 ms
[2020-06-05 09:13:07] [INFO ] Deduced a trap composed of 235 places in 960 ms
[2020-06-05 09:13:08] [INFO ] Deduced a trap composed of 294 places in 884 ms
[2020-06-05 09:13:08] [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-06-05 09:13:08] [INFO ] [Real]Absence check using 10 positive place invariants in 76 ms returned sat
[2020-06-05 09:13:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:13:12] [INFO ] [Real]Absence check using state equation in 3280 ms returned sat
[2020-06-05 09:13:13] [INFO ] Deduced a trap composed of 54 places in 929 ms
[2020-06-05 09:13:14] [INFO ] Deduced a trap composed of 331 places in 928 ms
[2020-06-05 09:13:14] [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 s93 s94 s95 s102 s103 s104 s105 s114 s115 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s151 s152 s157 s158 s159 s160 s161 s162 s163 s164 s167 s168 s169 s170 s171 s172 s173 s174 s345 s346 s347 s348 s349 s358 s359 s360 s361 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s381 s382 s383 s385 s387 s388 s389 s390 s391 s392 s393 s394 s395 s396 s397 s398 s399 s400 s401 s403 s404 s409 s410 s411 s412 s413 s414 s415 s416 s419 s420 s421 s422 s423 s424 s425 s426 s512 s513 s514 s515 s516 s517 s522 s523 s524 s525 s538 s539 s540 s541 s542 s543 s545 s546 s547 s548 s549 s550 s551 s552 s553 s554 s555 s556 s557 s559 s560 s561 s562 s563 s564 s565 s566 s567 s568 s569 s571 s572 s577 s578 s579 s580 s581 s582 s583 s584 s587 s588 s589 s592 s593 s594 s595 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667 s668 s669 s670 s671 s676 s677 s678 s679 s680 s681 s686 s691 s696 s698 s699 s700 s701 s706 s711 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 s756 s757 s758 s759 s760 s761 s766 s767 s768 s769 s770 s771 s772 s773 s774 s775 s776 s781 s786 s791 s792 s793 s794 s795 s796 s801 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 s861 s866 s867 s868 s869 s870 s871 s876 s877 s878 s879 s880 s881 s882 s883 s884 s885 s886 s891 s892 s893 s894 s895 s896 s898 s899 s900 s901 s902 s903 s904 s905) 0)") while checking expression at index 1
[2020-06-05 09:13:14] [INFO ] [Real]Absence check using 10 positive place invariants in 48 ms returned sat
[2020-06-05 09:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:13:16] [INFO ] [Real]Absence check using state equation in 1959 ms returned sat
[2020-06-05 09:13:17] [INFO ] Deduced a trap composed of 276 places in 873 ms
[2020-06-05 09:13:18] [INFO ] Deduced a trap composed of 54 places in 790 ms
[2020-06-05 09:13:19] [INFO ] Deduced a trap composed of 92 places in 702 ms
[2020-06-05 09:13:19] [INFO ] Deduced a trap composed of 164 places in 586 ms
[2020-06-05 09:13:19] [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-06-05 09:13:20] [INFO ] [Real]Absence check using 10 positive place invariants in 78 ms returned sat
[2020-06-05 09:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:13:22] [INFO ] [Real]Absence check using state equation in 2989 ms returned sat
[2020-06-05 09:13:23] [INFO ] Deduced a trap composed of 54 places in 316 ms
[2020-06-05 09:13:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2020-06-05 09:13:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:13:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 09:13:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 4813 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 09:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:13:28] [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 3
[2020-06-05 09:13:28] [INFO ] [Real]Absence check using 10 positive place invariants in 48 ms returned sat
[2020-06-05 09:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:13:31] [INFO ] [Real]Absence check using state equation in 3197 ms returned sat
[2020-06-05 09:13:32] [INFO ] Deduced a trap composed of 92 places in 841 ms
[2020-06-05 09:13:33] [INFO ] Deduced a trap composed of 284 places in 748 ms
[2020-06-05 09:13:33] [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 s345 s348 s349 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s372 s373 s374 s375 s377 s378 s379 s381 s382 s383 s384 s385 s386 s387 s388 s389 s390 s391 s392 s393 s394 s395 s396 s397 s398 s399 s400 s401 s403 s404 s409 s410 s411 s412 s413 s414 s415 s416 s419 s420 s421 s422 s423 s424 s425 s426 s655 s656 s657 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667 s668 s669 s670 s671 s672 s673 s674 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 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 s766 s767 s768 s769 s770 s771 s772 s773 s774 s775 s776 s781 s782 s783 s784 s786 s787 s788 s789 s791 s796 s801 s806 s807 s808 s809 s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s831 s832 s833 s834 s835 s836 s837 s838 s839 s840 s841 s842 s843 s844 s845 s846 s847 s848 s849 s850 s851 s852 s853 s854 s855 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 s891 s892 s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905 s906 s907) 0)") while checking expression at index 4
[2020-06-05 09:13:33] [INFO ] [Real]Absence check using 10 positive place invariants in 75 ms returned unsat
[2020-06-05 09:13:34] [INFO ] [Real]Absence check using 10 positive place invariants in 76 ms returned sat
[2020-06-05 09:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:13:37] [INFO ] [Real]Absence check using state equation in 2880 ms returned sat
[2020-06-05 09:13:38] [INFO ] Deduced a trap composed of 335 places in 826 ms
[2020-06-05 09:13:38] [INFO ] Deduced a trap composed of 198 places in 511 ms
[2020-06-05 09:13:39] [INFO ] Deduced a trap composed of 54 places in 351 ms
[2020-06-05 09: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 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 6
[2020-06-05 09:13:39] [INFO ] [Real]Absence check using 10 positive place invariants in 78 ms returned sat
[2020-06-05 09:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:13:42] [INFO ] [Real]Absence check using state equation in 3188 ms returned sat
[2020-06-05 09:13:43] [INFO ] Deduced a trap composed of 139 places in 942 ms
[2020-06-05 09:13:44] [INFO ] Deduced a trap composed of 211 places in 888 ms
[2020-06-05 09:13:44] [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 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 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 s256 s257 s258 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s526 s527 s528 s529 s530 s531 s532 s533 s534 s535 s536 s537 s540 s541 s542 s543 s544 s545 s546 s547 s548 s549 s550 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 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 s625 s626 s627 s628 s629 s630 s631 s632 s633 s634 s635 s636 s637 s638 s639 s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653) 0)") while checking expression at index 7
[2020-06-05 09:13:45] [INFO ] [Real]Absence check using 10 positive place invariants in 76 ms returned sat
[2020-06-05 09:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:13:48] [INFO ] [Real]Absence check using state equation in 3114 ms returned sat
[2020-06-05 09:13:49] [INFO ] Deduced a trap composed of 332 places in 942 ms
[2020-06-05 09:13:50] [INFO ] Deduced a trap composed of 356 places in 938 ms
[2020-06-05 09:13:50] [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 s9 s10 s11 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s37 s39 s41 s42 s43 s44 s45 s46 s47 s49 s51 s52 s53 s55 s56 s57 s58 s59 s60 s77 s78 s79 s80 s83 s84 s85 s88 s89 s90 s93 s94 s95 s96 s97 s102 s103 s104 s105 s112 s113 s118 s119 s121 s122 s123 s125 s127 s128 s129 s130 s131 s133 s135 s136 s137 s138 s139 s140 s141 s143 s144 s161 s162 s163 s164 s167 s168 s169 s170 s171 s172 s173 s174 s177 s178 s179 s182 s183 s192 s193 s194 s195 s202 s203 s204 s205 s207 s209 s210 s211 s212 s213 s215 s216 s217 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s245 s246 s247 s248 s251 s252 s253 s254 s255 s256 s257 s258 s345 s352 s353 s356 s357 s364 s365 s366 s367 s373 s375 s376 s377 s378 s379 s380 s381 s383 s384 s385 s386 s387 s388 s389 s390 s391 s393 s395 s396 s413 s414 s415 s416 s419 s420 s421 s424 s425 s426 s512 s513 s520 s521 s526 s527 s530 s531 s532 s533 s538 s539 s541 s542 s543 s544 s545 s546 s547 s548 s549 s550 s551 s552 s553 s554 s555 s557 s558 s559 s560 s561 s562 s563 s564 s581 s582 s583 s584 s587 s588 s589 s590 s591 s592 s593 s594 s595 s661 s666 s671 s672 s673 s674 s675 s676 s678 s679 s680 s681 s686 s691 s693 s694 s695 s696 s701 s702 s703 s704 s706 s711 s716 s718 s719 s720 s721 s722 s723 s724 s726 s728 s729 s730 s731 s736 s741 s746 s751 s756 s757 s758 s759 s760 s761 s762 s763 s764 s765 s766 s767 s768 s769 s770 s771 s773 s774 s775 s776 s781 s786 s791 s796 s801 s806 s811 s812 s813 s814 s816 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827 s828 s829 s831 s832 s833 s834 s835 s836 s841 s846 s851 s856 s861 s866 s867 s868 s869 s870 s871 s876 s881 s882 s883 s884 s885 s886 s887 s888 s889 s890 s891 s892 s893 s894 s895 s896 s901 s902 s903 s904 s905 s909 s910 s911 s912 s913 s914 s915 s916 s917) 0)") while checking expression at index 8
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 29 out of 920 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 733 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 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 389 place count 712 transition count 732
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 609 place count 602 transition count 732
Symmetric choice reduction at 2 with 298 rule applications. Total rules 907 place count 602 transition count 732
Deduced a syphon composed of 298 places in 2 ms
Reduce places removed 298 places and 298 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1503 place count 304 transition count 434
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 1505 place count 304 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1506 place count 303 transition count 432
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1506 place count 303 transition count 427
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1516 place count 298 transition count 427
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1558 place count 298 transition count 427
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 42 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1642 place count 256 transition count 385
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 1676 place count 256 transition count 351
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 1768 place count 210 transition count 305
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1776 place count 210 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1778 place count 209 transition count 297
Free-agglomeration rule applied 67 times.
Iterating global reduction 6 with 67 rules applied. Total rules applied 1845 place count 209 transition count 230
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 6 with 67 rules applied. Total rules applied 1912 place count 142 transition count 230
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1922 place count 142 transition count 230
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 1942 place count 132 transition count 220
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1952 place count 132 transition count 210
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1958 place count 132 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1959 place count 131 transition count 203
Applied a total of 1959 rules in 429 ms. Remains 131 /920 variables (removed 789) and now considering 203/1057 (removed 854) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/920 places, 203/1057 transitions.
Finished random walk after 63207 steps, including 2058 resets, run visited all 8 properties in 249 ms. (steps per millisecond=253 )
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-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.

--------------------
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-08b"
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-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 r170-smll-158987815700303"
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 ;