About the Execution of ITS-LoLa for QuasiCertifProtocol-COL-32
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.590 | 3600000.00 | 454566.00 | 110.30 | TTFTTTTTTFFTFTFF | normal |
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.r176-tajo-158987872400775.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 itslola
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 r176-tajo-158987872400775
=====================================================================
--------------------
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 1591181438948
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:50:40] [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 10:50:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:50:40] [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-06-03 10:50:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 599 ms
[2020-06-03 10:50:41] [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-06-03 10:50:41] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 21 ms.
[2020-06-03 10:50:41] [INFO ] Computed order based on color domains.
[2020-06-03 10:50:41] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions in 29 ms.
[2020-06-03 10:50:41] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 66 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 267 resets, run finished after 330 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 13 resets, run finished after 251 ms. (steps per millisecond=39 ) 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 10 resets, run finished after 244 ms. (steps per millisecond=40 ) 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 248 ms. (steps per millisecond=40 ) 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 10 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 60 ms. (steps per millisecond=166 ) 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 21 ms. (steps per millisecond=476 ) 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 24 ms. (steps per millisecond=416 ) 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 51 ms. (steps per millisecond=196 ) 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 10 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 69 ms. (steps per millisecond=144 ) 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 494 ms. (steps per millisecond=20 ) 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 26 ms. (steps per millisecond=384 ) 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 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 39 ms. (steps per millisecond=256 ) 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 14 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 506 rows 3806 cols
[2020-06-03 10:50:43] [INFO ] Computed 3301 place invariants in 205 ms
[2020-06-03 10:50:44] [INFO ] [Real]Absence check using 37 positive place invariants in 195 ms returned sat
[2020-06-03 10:50:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:50:48] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4467 ms returned (error "Failed to check-sat")
[2020-06-03 10:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:50:48] [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-06-03 10:50:49] [INFO ] [Real]Absence check using 37 positive place invariants in 436 ms returned sat
[2020-06-03 10:50:53] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4184 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 10:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:50:53] [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-06-03 10:50:54] [INFO ] [Real]Absence check using 37 positive place invariants in 605 ms returned sat
[2020-06-03 10:50:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:50:58] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4026 ms returned (error "Failed to check-sat")
[2020-06-03 10:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:50:58] [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-06-03 10:50:59] [INFO ] [Real]Absence check using 37 positive place invariants in 181 ms returned sat
[2020-06-03 10:51:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:51:03] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4368 ms returned (error "Failed to check-sat")
[2020-06-03 10:51:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:51:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2020-06-03 10:51:04] [INFO ] [Real]Absence check using 37 positive place invariants in 313 ms returned sat
[2020-06-03 10:51:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:51:08] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4323 ms returned (error "Failed to check-sat")
[2020-06-03 10:51:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:51:08] [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-06-03 10:51:09] [INFO ] [Real]Absence check using 37 positive place invariants in 120 ms returned sat
[2020-06-03 10:51:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:51:13] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4504 ms returned (error "Failed to check-sat")
[2020-06-03 10:51:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:51:13] [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 5
[2020-06-03 10:51:14] [INFO ] [Real]Absence check using 37 positive place invariants in 260 ms returned sat
[2020-06-03 10:51:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:51:18] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4371 ms returned (error "Failed to check-sat")
[2020-06-03 10:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:51:18] [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: Broken pipe") while checking expression at index 6
[2020-06-03 10:51:19] [INFO ] [Real]Absence check using 37 positive place invariants in 241 ms returned sat
[2020-06-03 10:51:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:51:23] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4355 ms returned (error "Failed to check-sat")
[2020-06-03 10:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:51:23] [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 7
[2020-06-03 10:51:24] [INFO ] [Real]Absence check using 37 positive place invariants in 125 ms returned sat
[2020-06-03 10:51:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:51:28] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4520 ms returned (error "Failed to check-sat")
[2020-06-03 10:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:51:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 8
[2020-06-03 10:51:29] [INFO ] [Real]Absence check using 37 positive place invariants in 321 ms returned unsat
[2020-06-03 10:51:29] [INFO ] [Real]Absence check using 37 positive place invariants in 233 ms returned sat
[2020-06-03 10:51:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:51:34] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4551 ms returned (error "Failed to check-sat")
[2020-06-03 10:51:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:51:34] [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-06-03 10:51:35] [INFO ] [Real]Absence check using 37 positive place invariants in 403 ms returned sat
[2020-06-03 10:51:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:51:39] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4231 ms returned (error "Failed to check-sat")
[2020-06-03 10:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:51:39] [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-06-03 10:51:40] [INFO ] [Real]Absence check using 37 positive place invariants in 260 ms returned sat
[2020-06-03 10:51:44] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4366 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 10:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:51:44] [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-06-03 10:51:45] [INFO ] [Real]Absence check using 37 positive place invariants in 263 ms returned sat
[2020-06-03 10:51:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:51:49] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 4311 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.73 ms
Applied a total of 1 rules in 489 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 26768 resets, run finished after 19947 ms. (steps per millisecond=50 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 186892 steps, including 214 resets, run timeout after 5001 ms. (steps per millisecond=37 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 399121 steps, including 361 resets, run timeout after 5001 ms. (steps per millisecond=79 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 165284 steps, including 153 resets, run timeout after 5001 ms. (steps per millisecond=33 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1136 resets, run finished after 1812 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 792174 steps, including 737 resets, run timeout after 5001 ms. (steps per millisecond=158 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1142 resets, run finished after 1777 ms. (steps per millisecond=562 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 928336 steps, including 566 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1036 resets, run finished after 3864 ms. (steps per millisecond=258 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 990764 steps, including 917 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 651 resets, run finished after 2372 ms. (steps per millisecond=421 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1238 resets, run finished after 4794 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 922 resets, run finished after 3475 ms. (steps per millisecond=287 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1310 resets, run finished after 4929 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 10173352 steps, run timeout after 30001 ms. (steps per millisecond=339 ) properties seen :[1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0]
Probabilistic random walk after 10173352 steps, saw 1216532 distinct states, run finished after 30001 ms. (steps per millisecond=339 ) 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-06-03 10:53:33] [INFO ] Computed 3232 place invariants in 349 ms
[2020-06-03 10:53:40] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 6341 ms returned sat
[2020-06-03 10:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:53:59] [INFO ] [Real]Absence check using state equation in 19661 ms returned unsat
[2020-06-03 10:54:06] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 6676 ms returned sat
[2020-06-03 10:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:54:25] [INFO ] [Real]Absence check using state equation in 18870 ms returned unsat
[2020-06-03 10:54:32] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 6594 ms returned sat
[2020-06-03 10:54:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:54:51] [INFO ] [Real]Absence check using state equation in 19050 ms returned unsat
[2020-06-03 10:54:58] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 6068 ms returned sat
[2020-06-03 10:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:55:17] [INFO ] [Real]Absence check using state equation in 19121 ms returned unsat
[2020-06-03 10:55:24] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 6432 ms returned sat
[2020-06-03 10:55:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:55:46] [INFO ] [Real]Absence check using state equation in 22148 ms returned sat
[2020-06-03 10:55:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:55:52] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 5962 ms returned sat
[2020-06-03 10:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:56:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:56:22] [INFO ] [Nat]Absence check using state equation in 29491 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.19 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 1 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 937 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 25246 resets, run finished after 5018 ms. (steps per millisecond=199 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 952 resets, run finished after 4610 ms. (steps per millisecond=216 ) properties seen :[0]
Interrupted probabilistic random walk after 10541081 steps, run timeout after 30001 ms. (steps per millisecond=351 ) properties seen :[0]
Probabilistic random walk after 10541081 steps, saw 1338418 distinct states, run finished after 30001 ms. (steps per millisecond=351 ) properties seen :[0]
// Phase 1: matrix 336 rows 2513 cols
[2020-06-03 10:57:02] [INFO ] Computed 2178 place invariants in 13 ms
[2020-06-03 10:57:06] [INFO ] [Real]Absence check using 0 positive and 2178 generalized place invariants in 3232 ms returned sat
[2020-06-03 10:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:22] [INFO ] [Real]Absence check using state equation in 16043 ms returned sat
[2020-06-03 10:57:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:57:26] [INFO ] [Nat]Absence check using 0 positive and 2178 generalized place invariants in 3148 ms returned sat
[2020-06-03 10:57:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:40] [INFO ] [Nat]Absence check using state equation in 14592 ms returned sat
[2020-06-03 10:57:40] [INFO ] Computed and/alt/rep : 270/2611/270 causal constraints in 74 ms.
[2020-06-03 10:57:42] [INFO ] Added : 22 causal constraints over 5 iterations in 1888 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 241 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.
--------------------
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="QuasiCertifProtocol-COL-32"
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 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 r176-tajo-158987872400775"
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 '
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 ;