fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r111-csrt-158961258100719
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.400 48518.00 78972.00 118.00 FTFTTFFTFTTTFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258100719.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258100719
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 248K Apr 27 15:14 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 Peterson-PT-3-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590023223880

[2020-05-21 01:07:06] [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-21 01:07:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:07:07] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2020-05-21 01:07:07] [INFO ] Transformed 244 places.
[2020-05-21 01:07:07] [INFO ] Transformed 332 transitions.
[2020-05-21 01:07:07] [INFO ] Parsed PT model containing 244 places and 332 transitions in 236 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-3-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 96 ms. (steps per millisecond=104 ) properties seen :[0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-3-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-3-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA Peterson-PT-3-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 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 10000 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-21 01:07:07] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-05-21 01:07:07] [INFO ] Computed 15 place invariants in 13 ms
[2020-05-21 01:07:07] [INFO ] [Real]Absence check using 11 positive place invariants in 28 ms returned sat
[2020-05-21 01:07:07] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-21 01:07:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:07] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2020-05-21 01:07:07] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-05-21 01:07:07] [INFO ] [Real]Added 66 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:07:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 41 ms returned sat
[2020-05-21 01:07:08] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:08] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2020-05-21 01:07:08] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-05-21 01:07:08] [INFO ] Deduced a trap composed of 9 places in 265 ms
[2020-05-21 01:07:09] [INFO ] Deduced a trap composed of 31 places in 274 ms
[2020-05-21 01:07:09] [INFO ] Deduced a trap composed of 31 places in 174 ms
[2020-05-21 01:07:09] [INFO ] Deduced a trap composed of 52 places in 129 ms
[2020-05-21 01:07:09] [INFO ] Deduced a trap composed of 52 places in 160 ms
[2020-05-21 01:07:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1113 ms
[2020-05-21 01:07:09] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 21 ms.
[2020-05-21 01:07:11] [INFO ] Added : 304 causal constraints over 61 iterations in 2050 ms. Result :sat
[2020-05-21 01:07:11] [INFO ] Deduced a trap composed of 27 places in 210 ms
[2020-05-21 01:07:12] [INFO ] Deduced a trap composed of 34 places in 233 ms
[2020-05-21 01:07:12] [INFO ] Deduced a trap composed of 13 places in 141 ms
[2020-05-21 01:07:12] [INFO ] Deduced a trap composed of 12 places in 198 ms
[2020-05-21 01:07:12] [INFO ] Deduced a trap composed of 29 places in 183 ms
[2020-05-21 01:07:13] [INFO ] Deduced a trap composed of 49 places in 194 ms
[2020-05-21 01:07:13] [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 s4 s8 s45 s49 s52 s53 s56 s57 s60 s61 s64 s65 s68 s72 s73 s76 s83 s109 s112 s113 s119 s122 s134 s135 s140 s144 s145 s148 s157 s160 s161 s164 s165 s168 s169 s172 s174 s182 s183 s186 s221 s224 s225 s228 s229 s238 s241 s242) 0)") while checking expression at index 0
[2020-05-21 01:07:13] [INFO ] [Real]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-05-21 01:07:13] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-21 01:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:13] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2020-05-21 01:07:13] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:07:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-21 01:07:13] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:14] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2020-05-21 01:07:14] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:07:14] [INFO ] Deduced a trap composed of 9 places in 287 ms
[2020-05-21 01:07:14] [INFO ] Deduced a trap composed of 31 places in 186 ms
[2020-05-21 01:07:14] [INFO ] Deduced a trap composed of 31 places in 179 ms
[2020-05-21 01:07:14] [INFO ] Deduced a trap composed of 52 places in 119 ms
[2020-05-21 01:07:15] [INFO ] Deduced a trap composed of 52 places in 97 ms
[2020-05-21 01:07:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 971 ms
[2020-05-21 01:07:15] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 33 ms.
[2020-05-21 01:07:16] [INFO ] Added : 304 causal constraints over 61 iterations in 1606 ms. Result :sat
[2020-05-21 01:07:17] [INFO ] Deduced a trap composed of 27 places in 1050 ms
[2020-05-21 01:07:17] [INFO ] Deduced a trap composed of 34 places in 117 ms
[2020-05-21 01:07:18] [INFO ] Deduced a trap composed of 13 places in 125 ms
[2020-05-21 01:07:18] [INFO ] Deduced a trap composed of 12 places in 100 ms
[2020-05-21 01:07:18] [INFO ] Deduced a trap composed of 29 places in 114 ms
[2020-05-21 01:07:18] [INFO ] Deduced a trap composed of 49 places in 100 ms
[2020-05-21 01:07:18] [INFO ] Deduced a trap composed of 11 places in 144 ms
[2020-05-21 01:07: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 (> (+ s66 s113 s124 s146 s159 s211 s216 s226 s229 s230 s236) 0)") while checking expression at index 1
[2020-05-21 01:07:18] [INFO ] [Real]Absence check using 11 positive place invariants in 42 ms returned sat
[2020-05-21 01:07:18] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 27 ms returned sat
[2020-05-21 01:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:19] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2020-05-21 01:07:19] [INFO ] [Real]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-05-21 01:07:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:07:19] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:20] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2020-05-21 01:07:20] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:07:20] [INFO ] Deduced a trap composed of 9 places in 115 ms
[2020-05-21 01:07:20] [INFO ] Deduced a trap composed of 31 places in 233 ms
[2020-05-21 01:07:21] [INFO ] Deduced a trap composed of 31 places in 561 ms
[2020-05-21 01:07:21] [INFO ] Deduced a trap composed of 52 places in 153 ms
[2020-05-21 01:07:21] [INFO ] Deduced a trap composed of 52 places in 115 ms
[2020-05-21 01:07:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1288 ms
[2020-05-21 01:07:21] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 18 ms.
[2020-05-21 01:07:23] [INFO ] Added : 304 causal constraints over 61 iterations in 1633 ms. Result :sat
[2020-05-21 01:07:23] [INFO ] Deduced a trap composed of 27 places in 135 ms
[2020-05-21 01:07:23] [INFO ] Deduced a trap composed of 34 places in 218 ms
[2020-05-21 01:07:23] [INFO ] Deduced a trap composed of 13 places in 120 ms
[2020-05-21 01:07:23] [INFO ] Deduced a trap composed of 12 places in 124 ms
[2020-05-21 01:07:24] [INFO ] Deduced a trap composed of 29 places in 87 ms
[2020-05-21 01:07:24] [INFO ] Deduced a trap composed of 49 places in 145 ms
[2020-05-21 01:07:24] [INFO ] Deduced a trap composed of 11 places in 160 ms
[2020-05-21 01:07:24] [INFO ] Deduced a trap composed of 27 places in 133 ms
[2020-05-21 01:07:24] [INFO ] Deduced a trap composed of 9 places in 142 ms
[2020-05-21 01:07:24] [INFO ] Deduced a trap composed of 38 places in 144 ms
[2020-05-21 01:07:24] [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 s12 s51 s55 s57 s59 s62 s66 s74 s76 s79 s111 s113 s118 s121 s124 s125 s134 s144 s146 s159 s163 s167 s169 s171 s178 s182 s184 s206 s211 s223 s226 s227 s229 s230 s236 s239 s243) 0)") while checking expression at index 2
[2020-05-21 01:07:25] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:07:25] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 8 ms returned sat
[2020-05-21 01:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:25] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2020-05-21 01:07:25] [INFO ] [Real]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:07:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-21 01:07:25] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:25] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2020-05-21 01:07:25] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-21 01:07:25] [INFO ] Deduced a trap composed of 31 places in 109 ms
[2020-05-21 01:07:25] [INFO ] Deduced a trap composed of 52 places in 113 ms
[2020-05-21 01:07:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2020-05-21 01:07:26] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 52 ms.
[2020-05-21 01:07:27] [INFO ] Added : 303 causal constraints over 61 iterations in 1489 ms. Result :sat
[2020-05-21 01:07:27] [INFO ] Deduced a trap composed of 30 places in 125 ms
[2020-05-21 01:07:27] [INFO ] Deduced a trap composed of 49 places in 119 ms
[2020-05-21 01:07:27] [INFO ] Deduced a trap composed of 12 places in 102 ms
[2020-05-21 01:07:28] [INFO ] Deduced a trap composed of 16 places in 91 ms
[2020-05-21 01:07:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 572 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-05-21 01:07:28] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:07:28] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:28] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2020-05-21 01:07:28] [INFO ] [Real]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:07:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-21 01:07:28] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:28] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2020-05-21 01:07:28] [INFO ] [Nat]Added 66 Read/Feed constraints in 23 ms returned sat
[2020-05-21 01:07:29] [INFO ] Deduced a trap composed of 52 places in 110 ms
[2020-05-21 01:07:29] [INFO ] Deduced a trap composed of 11 places in 128 ms
[2020-05-21 01:07:29] [INFO ] Deduced a trap composed of 30 places in 101 ms
[2020-05-21 01:07:29] [INFO ] Deduced a trap composed of 20 places in 108 ms
[2020-05-21 01:07:29] [INFO ] Deduced a trap composed of 9 places in 232 ms
[2020-05-21 01:07:29] [INFO ] Deduced a trap composed of 38 places in 91 ms
[2020-05-21 01:07:29] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2020-05-21 01:07:29] [INFO ] Deduced a trap composed of 20 places in 83 ms
[2020-05-21 01:07:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1074 ms
[2020-05-21 01:07:29] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-05-21 01:07:31] [INFO ] Added : 304 causal constraints over 61 iterations in 1467 ms. Result :sat
[2020-05-21 01:07:31] [INFO ] Deduced a trap composed of 49 places in 50 ms
[2020-05-21 01:07:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-05-21 01:07:31] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-21 01:07:31] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-21 01:07:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:31] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2020-05-21 01:07:31] [INFO ] [Real]Added 66 Read/Feed constraints in 38 ms returned sat
[2020-05-21 01:07:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 29 ms returned sat
[2020-05-21 01:07:32] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:32] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2020-05-21 01:07:32] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-21 01:07:32] [INFO ] Deduced a trap composed of 33 places in 90 ms
[2020-05-21 01:07:32] [INFO ] Deduced a trap composed of 23 places in 113 ms
[2020-05-21 01:07:32] [INFO ] Deduced a trap composed of 31 places in 94 ms
[2020-05-21 01:07:32] [INFO ] Deduced a trap composed of 23 places in 131 ms
[2020-05-21 01:07:32] [INFO ] Deduced a trap composed of 40 places in 134 ms
[2020-05-21 01:07:33] [INFO ] Deduced a trap composed of 26 places in 133 ms
[2020-05-21 01:07:33] [INFO ] Deduced a trap composed of 13 places in 111 ms
[2020-05-21 01:07:33] [INFO ] Deduced a trap composed of 13 places in 83 ms
[2020-05-21 01:07:33] [INFO ] Deduced a trap composed of 38 places in 116 ms
[2020-05-21 01:07:33] [INFO ] Deduced a trap composed of 9 places in 147 ms
[2020-05-21 01:07:33] [INFO ] Deduced a trap composed of 34 places in 120 ms
[2020-05-21 01:07:33] [INFO ] Deduced a trap composed of 12 places in 111 ms
[2020-05-21 01:07:34] [INFO ] Deduced a trap composed of 87 places in 93 ms
[2020-05-21 01:07:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1694 ms
[2020-05-21 01:07:34] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-05-21 01:07:35] [INFO ] Added : 304 causal constraints over 61 iterations in 1439 ms. Result :sat
[2020-05-21 01:07:35] [INFO ] Deduced a trap composed of 34 places in 76 ms
[2020-05-21 01:07:35] [INFO ] Deduced a trap composed of 48 places in 82 ms
[2020-05-21 01:07:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-05-21 01:07:35] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-21 01:07:35] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:36] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2020-05-21 01:07:36] [INFO ] [Real]Added 66 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:07:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-21 01:07:36] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:36] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2020-05-21 01:07:36] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:07:36] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2020-05-21 01:07:36] [INFO ] Deduced a trap composed of 23 places in 149 ms
[2020-05-21 01:07:36] [INFO ] Deduced a trap composed of 9 places in 116 ms
[2020-05-21 01:07:36] [INFO ] Deduced a trap composed of 9 places in 105 ms
[2020-05-21 01:07:37] [INFO ] Deduced a trap composed of 25 places in 97 ms
[2020-05-21 01:07:37] [INFO ] Deduced a trap composed of 16 places in 114 ms
[2020-05-21 01:07:37] [INFO ] Deduced a trap composed of 31 places in 127 ms
[2020-05-21 01:07:37] [INFO ] Deduced a trap composed of 25 places in 153 ms
[2020-05-21 01:07:37] [INFO ] Deduced a trap composed of 27 places in 116 ms
[2020-05-21 01:07:37] [INFO ] Deduced a trap composed of 9 places in 141 ms
[2020-05-21 01:07:37] [INFO ] Deduced a trap composed of 26 places in 119 ms
[2020-05-21 01:07:38] [INFO ] Deduced a trap composed of 26 places in 132 ms
[2020-05-21 01:07:38] [INFO ] Deduced a trap composed of 45 places in 61 ms
[2020-05-21 01:07:38] [INFO ] Deduced a trap composed of 27 places in 88 ms
[2020-05-21 01:07:38] [INFO ] Deduced a trap composed of 34 places in 70 ms
[2020-05-21 01:07:38] [INFO ] Deduced a trap composed of 34 places in 69 ms
[2020-05-21 01:07:38] [INFO ] Deduced a trap composed of 16 places in 58 ms
[2020-05-21 01:07:38] [INFO ] Deduced a trap composed of 27 places in 82 ms
[2020-05-21 01:07:38] [INFO ] Deduced a trap composed of 45 places in 74 ms
[2020-05-21 01:07:38] [INFO ] Deduced a trap composed of 45 places in 116 ms
[2020-05-21 01:07:38] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2449 ms
[2020-05-21 01:07:38] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-05-21 01:07:40] [INFO ] Added : 303 causal constraints over 61 iterations in 1401 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-05-21 01:07:40] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-21 01:07:40] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 10 ms returned sat
[2020-05-21 01:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:40] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2020-05-21 01:07:40] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-05-21 01:07:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-21 01:07:40] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 8 ms returned sat
[2020-05-21 01:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:40] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2020-05-21 01:07:40] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-05-21 01:07:41] [INFO ] Deduced a trap composed of 13 places in 122 ms
[2020-05-21 01:07:41] [INFO ] Deduced a trap composed of 18 places in 115 ms
[2020-05-21 01:07:41] [INFO ] Deduced a trap composed of 30 places in 133 ms
[2020-05-21 01:07:41] [INFO ] Deduced a trap composed of 31 places in 124 ms
[2020-05-21 01:07:41] [INFO ] Deduced a trap composed of 34 places in 174 ms
[2020-05-21 01:07:41] [INFO ] Deduced a trap composed of 30 places in 134 ms
[2020-05-21 01:07:41] [INFO ] Deduced a trap composed of 17 places in 103 ms
[2020-05-21 01:07:42] [INFO ] Deduced a trap composed of 31 places in 96 ms
[2020-05-21 01:07:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1128 ms
[2020-05-21 01:07:42] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-05-21 01:07:43] [INFO ] Added : 303 causal constraints over 61 iterations in 1429 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 53 ms.
[2020-05-21 01:07:43] [INFO ] [Real]Absence check using 11 positive place invariants in 94 ms returned sat
[2020-05-21 01:07:43] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 31 ms returned sat
[2020-05-21 01:07:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:43] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2020-05-21 01:07:44] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-21 01:07:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-21 01:07:44] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:07:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:44] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2020-05-21 01:07:44] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:07:44] [INFO ] Deduced a trap composed of 52 places in 102 ms
[2020-05-21 01:07:44] [INFO ] Deduced a trap composed of 11 places in 104 ms
[2020-05-21 01:07:44] [INFO ] Deduced a trap composed of 30 places in 159 ms
[2020-05-21 01:07:44] [INFO ] Deduced a trap composed of 20 places in 128 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 9 places in 137 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 38 places in 214 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 9 places in 130 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 20 places in 129 ms
[2020-05-21 01:07:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1237 ms
[2020-05-21 01:07:45] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-05-21 01:07:47] [INFO ] Added : 304 causal constraints over 61 iterations in 1663 ms. Result :sat
[2020-05-21 01:07:47] [INFO ] Deduced a trap composed of 49 places in 72 ms
[2020-05-21 01:07:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 57800 steps, including 844 resets, run finished after 218 ms. (steps per millisecond=265 ) properties seen :[1, 1, 1, 0, 1, 0, 0, 0, 1] could not realise parikh vector
FORMULA Peterson-PT-3-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 59500 steps, including 754 resets, run finished after 189 ms. (steps per millisecond=314 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 71400 steps, including 819 resets, run finished after 163 ms. (steps per millisecond=438 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 78300 steps, including 861 resets, run finished after 189 ms. (steps per millisecond=414 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 57800 steps, including 846 resets, run finished after 98 ms. (steps per millisecond=589 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 47000 steps, including 679 resets, run finished after 73 ms. (steps per millisecond=643 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 18 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 244 transition count 246
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 158 transition count 246
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 172 place count 158 transition count 201
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 262 place count 113 transition count 201
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 286 place count 101 transition count 189
Applied a total of 286 rules in 83 ms. Remains 101 /244 variables (removed 143) and now considering 189/332 (removed 143) transitions.
Finished structural reductions, in 1 iterations. Remains : 101/244 places, 189/332 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 577 ms. (steps per millisecond=1733 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 387 ms. (steps per millisecond=2583 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 614 ms. (steps per millisecond=1628 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 387 ms. (steps per millisecond=2583 ) properties seen :[0, 0, 0, 0]
Finished probabilistic random walk after 177028 steps, run visited all 4 properties in 292 ms. (steps per millisecond=606 )
Probabilistic random walk after 177028 steps, saw 35406 distinct states, run finished after 293 ms. (steps per millisecond=604 ) properties seen :[1, 1, 1, 1]
FORMULA Peterson-PT-3-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590023272398

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r111-csrt-158961258100719"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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