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

About the Execution of ITS-LoLa for Peterson-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.140 3600000.00 56885.00 168.40 TTTTFFFTFTFTTTFT 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.r174-csrt-158987853600711.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 itslola
Input is Peterson-PT-2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600711
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K 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 11K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 98K 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-2-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-2-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591163771967

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:56:15] [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-03 05:56:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:56:15] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2020-06-03 05:56:15] [INFO ] Transformed 102 places.
[2020-06-03 05:56:15] [INFO ] Transformed 126 transitions.
[2020-06-03 05:56:15] [INFO ] Parsed PT model containing 102 places and 126 transitions in 179 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 64 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 119 ms. (steps per millisecond=84 ) properties seen :[0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA Peterson-PT-2-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 79 ms. (steps per millisecond=126 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 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 10000 steps, including 0 resets, run finished after 75 ms. (steps per millisecond=133 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA Peterson-PT-2-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 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, 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, 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, 0, 0]
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, 0, 0]
[2020-06-03 05:56:16] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2020-06-03 05:56:16] [INFO ] Computed 11 place invariants in 27 ms
[2020-06-03 05:56:16] [INFO ] [Real]Absence check using 8 positive place invariants in 32 ms returned sat
[2020-06-03 05:56:16] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 17 ms returned sat
[2020-06-03 05:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:16] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2020-06-03 05:56:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-06-03 05:56:17] [INFO ] [Real]Added 26 Read/Feed constraints in 28 ms returned sat
[2020-06-03 05:56:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 111 ms returned sat
[2020-06-03 05:56:17] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:56:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:17] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2020-06-03 05:56:17] [INFO ] [Nat]Added 26 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:56:17] [INFO ] Deduced a trap composed of 8 places in 246 ms
[2020-06-03 05:56:18] [INFO ] Deduced a trap composed of 8 places in 287 ms
[2020-06-03 05:56:18] [INFO ] Deduced a trap composed of 29 places in 108 ms
[2020-06-03 05:56:18] [INFO ] Deduced a trap composed of 42 places in 232 ms
[2020-06-03 05:56:18] [INFO ] Deduced a trap composed of 11 places in 204 ms
[2020-06-03 05:56:18] [INFO ] Deduced a trap composed of 26 places in 40 ms
[2020-06-03 05:56:19] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2020-06-03 05:56:19] [INFO ] Deduced a trap composed of 29 places in 47 ms
[2020-06-03 05:56:19] [INFO ] Deduced a trap composed of 29 places in 44 ms
[2020-06-03 05:56:19] [INFO ] Deduced a trap composed of 25 places in 32 ms
[2020-06-03 05:56:19] [INFO ] Deduced a trap composed of 25 places in 32 ms
[2020-06-03 05:56:19] [INFO ] Deduced a trap composed of 15 places in 27 ms
[2020-06-03 05:56:19] [INFO ] Deduced a trap composed of 12 places in 64 ms
[2020-06-03 05:56:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1605 ms
[2020-06-03 05:56:19] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 16 ms.
[2020-06-03 05:56:19] [INFO ] Added : 93 causal constraints over 20 iterations in 393 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 05:56:19] [INFO ] [Real]Absence check using 8 positive place invariants in 36 ms returned sat
[2020-06-03 05:56:19] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:20] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2020-06-03 05:56:20] [INFO ] [Real]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-06-03 05:56:20] [INFO ] Deduced a trap composed of 8 places in 38 ms
[2020-06-03 05:56:20] [INFO ] Deduced a trap composed of 31 places in 96 ms
[2020-06-03 05:56:20] [INFO ] Deduced a trap composed of 8 places in 160 ms
[2020-06-03 05:56:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 395 ms
[2020-06-03 05:56:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 77 ms returned sat
[2020-06-03 05:56:20] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 23 ms returned sat
[2020-06-03 05:56:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:20] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2020-06-03 05:56:20] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-06-03 05:56:20] [INFO ] Deduced a trap composed of 8 places in 100 ms
[2020-06-03 05:56:21] [INFO ] Deduced a trap composed of 11 places in 59 ms
[2020-06-03 05:56:21] [INFO ] Deduced a trap composed of 22 places in 63 ms
[2020-06-03 05:56:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 270 ms
[2020-06-03 05:56:21] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 46 ms.
[2020-06-03 05:56:21] [INFO ] Added : 117 causal constraints over 24 iterations in 510 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2020-06-03 05:56:21] [INFO ] [Real]Absence check using 8 positive place invariants in 36 ms returned unsat
[2020-06-03 05:56:21] [INFO ] [Real]Absence check using 8 positive place invariants in 31 ms returned sat
[2020-06-03 05:56:21] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:22] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2020-06-03 05:56:22] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:56:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 21 ms returned sat
[2020-06-03 05:56:22] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 05:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:22] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2020-06-03 05:56:22] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:56:23] [INFO ] Deduced a trap composed of 22 places in 598 ms
[2020-06-03 05:56:23] [INFO ] Deduced a trap composed of 22 places in 701 ms
[2020-06-03 05:56:23] [INFO ] Deduced a trap composed of 29 places in 138 ms
[2020-06-03 05:56:24] [INFO ] Deduced a trap composed of 10 places in 89 ms
[2020-06-03 05:56:24] [INFO ] Deduced a trap composed of 12 places in 41 ms
[2020-06-03 05:56:24] [INFO ] Deduced a trap composed of 45 places in 81 ms
[2020-06-03 05:56:24] [INFO ] Deduced a trap composed of 15 places in 318 ms
[2020-06-03 05:56:24] [INFO ] Deduced a trap composed of 8 places in 98 ms
[2020-06-03 05:56:24] [INFO ] Deduced a trap composed of 8 places in 39 ms
[2020-06-03 05:56:24] [INFO ] Deduced a trap composed of 42 places in 215 ms
[2020-06-03 05:56:25] [INFO ] Deduced a trap composed of 28 places in 580 ms
[2020-06-03 05:56:25] [INFO ] Deduced a trap composed of 42 places in 252 ms
[2020-06-03 05:56:25] [INFO ] Deduced a trap composed of 26 places in 44 ms
[2020-06-03 05:56:26] [INFO ] Deduced a trap composed of 25 places in 139 ms
[2020-06-03 05:56:26] [INFO ] Deduced a trap composed of 12 places in 56 ms
[2020-06-03 05:56:26] [INFO ] Deduced a trap composed of 50 places in 45 ms
[2020-06-03 05:56:26] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3741 ms
[2020-06-03 05:56:26] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 13 ms.
[2020-06-03 05:56:26] [INFO ] Added : 117 causal constraints over 24 iterations in 382 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2020-06-03 05:56:26] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-03 05:56:26] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:26] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2020-06-03 05:56:26] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:56:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-06-03 05:56:26] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:56:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:26] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2020-06-03 05:56:26] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:56:26] [INFO ] Deduced a trap composed of 22 places in 61 ms
[2020-06-03 05:56:26] [INFO ] Deduced a trap composed of 12 places in 47 ms
[2020-06-03 05:56:27] [INFO ] Deduced a trap composed of 26 places in 78 ms
[2020-06-03 05:56:27] [INFO ] Deduced a trap composed of 36 places in 128 ms
[2020-06-03 05:56:27] [INFO ] Deduced a trap composed of 42 places in 91 ms
[2020-06-03 05:56:27] [INFO ] Deduced a trap composed of 8 places in 179 ms
[2020-06-03 05:56:27] [INFO ] Deduced a trap composed of 40 places in 87 ms
[2020-06-03 05:56:27] [INFO ] Deduced a trap composed of 12 places in 34 ms
[2020-06-03 05:56:27] [INFO ] Deduced a trap composed of 26 places in 49 ms
[2020-06-03 05:56:27] [INFO ] Deduced a trap composed of 8 places in 39 ms
[2020-06-03 05:56:27] [INFO ] Deduced a trap composed of 15 places in 47 ms
[2020-06-03 05:56:27] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 948 ms
[2020-06-03 05:56:27] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 30 ms.
[2020-06-03 05:56:28] [INFO ] Added : 117 causal constraints over 24 iterations in 264 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-06-03 05:56:28] [INFO ] [Real]Absence check using 8 positive place invariants in 38 ms returned unsat
[2020-06-03 05:56:28] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:56:28] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:28] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2020-06-03 05:56:28] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:56:28] [INFO ] Deduced a trap composed of 10 places in 332 ms
[2020-06-03 05:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2020-06-03 05:56:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-03 05:56:28] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:28] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-06-03 05:56:28] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:56:28] [INFO ] Deduced a trap composed of 8 places in 151 ms
[2020-06-03 05:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2020-06-03 05:56:29] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 20 ms.
[2020-06-03 05:56:29] [INFO ] Added : 115 causal constraints over 24 iterations in 419 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-06-03 05:56:29] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned unsat
[2020-06-03 05:56:29] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2020-06-03 05:56:29] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 15 ms returned sat
[2020-06-03 05:56:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:29] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-03 05:56:29] [INFO ] [Real]Added 26 Read/Feed constraints in 10 ms returned sat
[2020-06-03 05:56:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 51 ms returned sat
[2020-06-03 05:56:29] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:29] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2020-06-03 05:56:29] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:56:29] [INFO ] Deduced a trap composed of 12 places in 183 ms
[2020-06-03 05:56:30] [INFO ] Deduced a trap composed of 8 places in 522 ms
[2020-06-03 05:56:30] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-06-03 05:56:31] [INFO ] Deduced a trap composed of 10 places in 838 ms
[2020-06-03 05:56:31] [INFO ] Deduced a trap composed of 22 places in 107 ms
[2020-06-03 05:56:31] [INFO ] Deduced a trap composed of 25 places in 414 ms
[2020-06-03 05:56:32] [INFO ] Deduced a trap composed of 8 places in 150 ms
[2020-06-03 05:56:32] [INFO ] Deduced a trap composed of 15 places in 102 ms
[2020-06-03 05:56:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2479 ms
[2020-06-03 05:56:32] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 20 ms.
[2020-06-03 05:56:32] [INFO ] Added : 114 causal constraints over 23 iterations in 395 ms. Result :sat
[2020-06-03 05:56:33] [INFO ] Deduced a trap composed of 12 places in 504 ms
[2020-06-03 05:56:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 540 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-06-03 05:56:33] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-03 05:56:33] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:33] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-06-03 05:56:33] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:56:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 39 ms returned sat
[2020-06-03 05:56:33] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:56:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:33] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-03 05:56:33] [INFO ] [Nat]Added 26 Read/Feed constraints in 31 ms returned sat
[2020-06-03 05:56:34] [INFO ] Deduced a trap composed of 12 places in 393 ms
[2020-06-03 05:56:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2020-06-03 05:56:34] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2020-06-03 05:56:34] [INFO ] Added : 116 causal constraints over 24 iterations in 516 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-06-03 05:56:34] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-03 05:56:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:34] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2020-06-03 05:56:34] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:56:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 19 ms returned sat
[2020-06-03 05:56:34] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 10 ms returned sat
[2020-06-03 05:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:35] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2020-06-03 05:56:35] [INFO ] [Nat]Added 26 Read/Feed constraints in 16 ms returned sat
[2020-06-03 05:56:35] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 15 ms.
[2020-06-03 05:56:35] [INFO ] Added : 113 causal constraints over 23 iterations in 245 ms. Result :sat
[2020-06-03 05:56:35] [INFO ] Deduced a trap composed of 11 places in 150 ms
[2020-06-03 05:56:35] [INFO ] Deduced a trap composed of 10 places in 28 ms
[2020-06-03 05:56:35] [INFO ] Deduced a trap composed of 13 places in 63 ms
[2020-06-03 05:56:35] [INFO ] Deduced a trap composed of 25 places in 59 ms
[2020-06-03 05:56:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 395 ms
Attempting to minimize the solution found.
Minimization took 5 ms.
FORMULA Peterson-PT-2-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 16700 steps, including 650 resets, run finished after 63 ms. (steps per millisecond=265 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA Peterson-PT-2-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 22900 steps, including 594 resets, run finished after 72 ms. (steps per millisecond=318 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 34500 steps, including 718 resets, run finished after 87 ms. (steps per millisecond=396 ) properties seen :[0, 0, 0, 0, 1, 1, 0] could not realise parikh vector
FORMULA Peterson-PT-2-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 24900 steps, including 502 resets, run finished after 58 ms. (steps per millisecond=429 ) properties seen :[0, 0, 0, 1, 0] could not realise parikh vector
FORMULA Peterson-PT-2-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 26600 steps, including 539 resets, run finished after 57 ms. (steps per millisecond=466 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 24100 steps, including 514 resets, run finished after 88 ms. (steps per millisecond=273 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 24000 steps, including 384 resets, run finished after 49 ms. (steps per millisecond=489 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 17000 steps, including 392 resets, run finished after 35 ms. (steps per millisecond=485 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 69 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 102 transition count 118
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 94 transition count 118
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 16 place count 94 transition count 114
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 90 transition count 114
Applied a total of 24 rules in 48 ms. Remains 90 /102 variables (removed 12) and now considering 114/126 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/102 places, 114/126 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2331 ms. (steps per millisecond=429 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1535 ms. (steps per millisecond=651 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 2074 ms. (steps per millisecond=482 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1182 ms. (steps per millisecond=846 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 623 ms. (steps per millisecond=1605 ) properties seen :[0, 0, 0, 0]
Finished probabilistic random walk after 25466 steps, run visited all 4 properties in 52 ms. (steps per millisecond=489 )
Probabilistic random walk after 25466 steps, saw 6367 distinct states, run finished after 53 ms. (steps per millisecond=480 ) properties seen :[1, 1, 1, 1]
FORMULA Peterson-PT-2-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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="Peterson-PT-2"
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 Peterson-PT-2, 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 r174-csrt-158987853600711"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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