Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961390900775.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-COL-32, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390900775
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 3.7K Apr 12 07:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 07:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 11 07:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 07:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 20:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 131K 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 QuasiCertifProtocol-COL-32-ReachabilityFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589857499575

[2020-05-19 03:05: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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-19 03:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 03:05:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-19 03:05:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 677 ms
[2020-05-19 03:05:01] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

[2020-05-19 03:05:01] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 27 ms.
[2020-05-19 03:05:01] [INFO ] Computed order based on color domains.
[2020-05-19 03:05:01] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions in 38 ms.
[2020-05-19 03:05:01] [INFO ] Unfolded HLPN properties in 1 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 267 resets, run finished after 327 ms. (steps per millisecond=30 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 287 ms. (steps per millisecond=34 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 270 ms. (steps per millisecond=37 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 292 ms. (steps per millisecond=34 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 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, 1, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 77 ms. (steps per millisecond=129 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 508 ms. (steps per millisecond=19 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 506 rows 3806 cols
[2020-05-19 03:05:04] [INFO ] Computed 3301 place invariants in 144 ms
[2020-05-19 03:05:04] [INFO ] [Real]Absence check using 37 positive place invariants in 200 ms returned sat
[2020-05-19 03:05:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 03:05:09] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4450 ms returned (error "Failed to check-sat")
[2020-05-19 03:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:05:09] [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 0
[2020-05-19 03:05:10] [INFO ] [Real]Absence check using 37 positive place invariants in 422 ms returned sat
[2020-05-19 03:05:14] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4071 ms returned (error "Solver has unexpectedly terminated")
[2020-05-19 03:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:05:14] [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 1
[2020-05-19 03:05:15] [INFO ] [Real]Absence check using 37 positive place invariants in 583 ms returned sat
[2020-05-19 03:05:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 03:05:19] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4167 ms returned (error "Failed to check-sat")
[2020-05-19 03:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:05:19] [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 2
[2020-05-19 03:05:19] [INFO ] [Real]Absence check using 37 positive place invariants in 118 ms returned sat
[2020-05-19 03:05:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 03:05:24] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4631 ms returned (error "Failed to check-sat")
[2020-05-19 03:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:05:24] [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-05-19 03:05:25] [INFO ] [Real]Absence check using 37 positive place invariants in 309 ms returned sat
[2020-05-19 03:05:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 03:05:29] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4341 ms returned (error "Failed to check-sat")
[2020-05-19 03:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:05:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 4
[2020-05-19 03:05:29] [INFO ] [Real]Absence check using 37 positive place invariants in 165 ms returned sat
[2020-05-19 03:05:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= (+ s1884 s3534) (+ s1856 s3506))") while checking expression at index 5
[2020-05-19 03:05:35] [INFO ] [Real]Absence check using 37 positive place invariants in 391 ms returned sat
[2020-05-19 03:05:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 03:05:39] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4172 ms returned unknown
[2020-05-19 03:05:40] [INFO ] [Real]Absence check using 37 positive place invariants in 301 ms returned sat
[2020-05-19 03:05:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 03:05:44] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4252 ms returned unknown
[2020-05-19 03:05:44] [INFO ] [Real]Absence check using 37 positive place invariants in 134 ms returned sat
[2020-05-19 03:05:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 03:05:49] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4556 ms returned (error "Failed to check-sat")
[2020-05-19 03:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:05:49] [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 8
[2020-05-19 03:05:50] [INFO ] [Real]Absence check using 37 positive place invariants in 456 ms returned unsat
[2020-05-19 03:05:51] [INFO ] [Real]Absence check using 37 positive place invariants in 262 ms returned sat
[2020-05-19 03:05:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 03:05:55] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4336 ms returned (error "Failed to check-sat")
[2020-05-19 03:05:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:05:55] [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 10
[2020-05-19 03:05:56] [INFO ] [Real]Absence check using 37 positive place invariants in 499 ms returned sat
[2020-05-19 03:06:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 03:06:00] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4180 ms returned (error "Failed to check-sat")
[2020-05-19 03:06:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:00] [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 11
[2020-05-19 03:06:00] [INFO ] [Real]Absence check using 37 positive place invariants in 265 ms returned sat
[2020-05-19 03:06:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 03:06:05] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4408 ms returned (error "Failed to check-sat")
[2020-05-19 03:06:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:05] [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 12
[2020-05-19 03:06:06] [INFO ] [Real]Absence check using 37 positive place invariants in 267 ms returned sat
[2020-05-19 03:06:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 03:06:10] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4369 ms returned unknown
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 1492 out of 3806 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3806/3806 places, 506/506 transitions.
Discarding 70 places :
Also discarding 0 output transitions
Graph (complete) has 43474 edges and 3806 vertex of which 3736 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.66 ms
Applied a total of 1 rules in 522 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3736/3806 places, 506/506 transitions.
Incomplete random walk after 1000000 steps, including 26775 resets, run finished after 22582 ms. (steps per millisecond=44 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 204139 steps, including 227 resets, run timeout after 5001 ms. (steps per millisecond=40 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 364783 steps, including 339 resets, run timeout after 5001 ms. (steps per millisecond=72 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 184498 steps, including 166 resets, run timeout after 5001 ms. (steps per millisecond=36 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1137 resets, run finished after 1814 ms. (steps per millisecond=551 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 833980 steps, including 767 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1145 resets, run finished after 1905 ms. (steps per millisecond=524 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 897705 steps, including 547 resets, run timeout after 5001 ms. (steps per millisecond=179 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1052 resets, run finished after 3976 ms. (steps per millisecond=251 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 977969 steps, including 906 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 649 resets, run finished after 2397 ms. (steps per millisecond=417 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 945806 steps, including 1181 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 930 resets, run finished after 3610 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 988681 steps, including 1290 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8292578 steps, run timeout after 30001 ms. (steps per millisecond=276 ) properties seen :[1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0]
Probabilistic random walk after 8292578 steps, saw 1015111 distinct states, run finished after 30001 ms. (steps per millisecond=276 ) properties seen :[1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0]
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 506 rows 3736 cols
[2020-05-19 03:07:57] [INFO ] Computed 3232 place invariants in 357 ms
[2020-05-19 03:08:05] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 7569 ms returned sat
[2020-05-19 03:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:36] [INFO ] [Real]Absence check using state equation in 30612 ms returned unsat
[2020-05-19 03:08:43] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 7383 ms returned sat
[2020-05-19 03:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:09:10] [INFO ] [Real]Absence check using state equation in 26563 ms returned unsat
[2020-05-19 03:09:18] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 7902 ms returned sat
[2020-05-19 03:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:09:45] [INFO ] [Real]Absence check using state equation in 26316 ms returned unsat
[2020-05-19 03:09:53] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 7565 ms returned sat
[2020-05-19 03:09:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:10:19] [INFO ] [Real]Absence check using state equation in 26042 ms returned unsat
[2020-05-19 03:10:26] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 7425 ms returned sat
[2020-05-19 03:10:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:10:52] [INFO ] [Real]Absence check using state equation in 25155 ms returned sat
[2020-05-19 03:10:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:11:00] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 7688 ms returned sat
[2020-05-19 03:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:11:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 03:11:32] [INFO ] [Nat]Absence check using state equation in 31740 ms returned unknown
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 69 out of 3736 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3736/3736 places, 506/506 transitions.
Discarding 1123 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Graph (complete) has 42047 edges and 3736 vertex of which 2613 are kept as prefixes of interest. Removing 1123 places using SCC suffix rule.61 ms
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 2613 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 2612 transition count 435
Symmetric choice reduction at 2 with 65 rule applications. Total rules 136 place count 2612 transition count 435
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 65 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 266 place count 2547 transition count 370
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 2 with 33 rules applied. Total rules applied 299 place count 2547 transition count 337
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 332 place count 2514 transition count 337
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 365 place count 2514 transition count 337
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 366 place count 2513 transition count 336
Applied a total of 366 rules in 1900 ms. Remains 2513 /3736 variables (removed 1223) and now considering 336/506 (removed 170) transitions.
Finished structural reductions, in 1 iterations. Remains : 2513/3736 places, 336/506 transitions.
Incomplete random walk after 1000000 steps, including 25260 resets, run finished after 5709 ms. (steps per millisecond=175 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 952 resets, run finished after 4641 ms. (steps per millisecond=215 ) properties seen :[0]
Interrupted probabilistic random walk after 11615533 steps, run timeout after 30001 ms. (steps per millisecond=387 ) properties seen :[0]
Probabilistic random walk after 11615533 steps, saw 1490121 distinct states, run finished after 30002 ms. (steps per millisecond=387 ) properties seen :[0]
// Phase 1: matrix 336 rows 2513 cols
[2020-05-19 03:12:14] [INFO ] Computed 2178 place invariants in 12 ms
[2020-05-19 03:12:18] [INFO ] [Real]Absence check using 0 positive and 2178 generalized place invariants in 3668 ms returned sat
[2020-05-19 03:12:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:12:34] [INFO ] [Real]Absence check using state equation in 15976 ms returned sat
[2020-05-19 03:12:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:12:37] [INFO ] [Nat]Absence check using 0 positive and 2178 generalized place invariants in 3373 ms returned sat
[2020-05-19 03:12:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:12:52] [INFO ] [Nat]Absence check using state equation in 14980 ms returned sat
[2020-05-19 03:12:53] [INFO ] Computed and/alt/rep : 270/2611/270 causal constraints in 47 ms.
[2020-05-19 03:12:55] [INFO ] Added : 22 causal constraints over 5 iterations in 2124 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 312 ms.
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589857975811

--------------------
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="QuasiCertifProtocol-COL-32"
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 QuasiCertifProtocol-COL-32, 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 r126-tajo-158961390900775"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 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 ;