fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r176-tajo-158987872400814
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for QuasiCertifProtocol-PT-22

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.000 3600000.00 351214.00 106.60 FFTFFTFFFTTTTFTF 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-158987872400814.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-PT-22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872400814
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 25K Apr 12 06:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 12 06:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 11 07:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 11 07:57 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 21K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 51K Apr 10 13:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 202K Apr 10 13:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 9 20:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 9 20:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 23K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 949K 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-PT-22-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591183054216

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 11:17:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 11:17:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 11:17:36] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2020-06-03 11:17:36] [INFO ] Transformed 1966 places.
[2020-06-03 11:17:36] [INFO ] Transformed 356 transitions.
[2020-06-03 11:17:36] [INFO ] Parsed PT model containing 1966 places and 356 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 66 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 371 resets, run finished after 356 ms. (steps per millisecond=28 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 128 ms. (steps per millisecond=78 ) properties seen :[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 180 ms. (steps per millisecond=55 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 98 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 114 ms. (steps per millisecond=87 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 87 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 23 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, 0]
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 25 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, 0]
Incomplete Best-First random walk after 10001 steps, including 22 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, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 356 rows 1966 cols
[2020-06-03 11:17:37] [INFO ] Computed 1611 place invariants in 71 ms
[2020-06-03 11:17:38] [INFO ] [Real]Absence check using 3 positive place invariants in 42 ms returned sat
[2020-06-03 11:17:40] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 2549 ms returned sat
[2020-06-03 11:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:17:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:17:42] [INFO ] [Real]Absence check using state equation in 2190 ms returned (error "Failed to check-sat")
[2020-06-03 11:17:43] [INFO ] [Real]Absence check using 3 positive place invariants in 49 ms returned sat
[2020-06-03 11:17:46] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 3032 ms returned sat
[2020-06-03 11:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:17:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:17:47] [INFO ] [Real]Absence check using state equation in 1731 ms returned (error "Failed to check-sat")
[2020-06-03 11:17:48] [INFO ] [Real]Absence check using 3 positive place invariants in 30 ms returned sat
[2020-06-03 11:17:50] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 1941 ms returned sat
[2020-06-03 11:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:17:52] [INFO ] [Real]Absence check using state equation in 2828 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 11:17:53] [INFO ] [Real]Absence check using 3 positive place invariants in 51 ms returned sat
[2020-06-03 11:17:55] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 2411 ms returned sat
[2020-06-03 11:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:17:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:17:57] [INFO ] [Real]Absence check using state equation in 2346 ms returned (error "Failed to check-sat")
[2020-06-03 11:17:58] [INFO ] [Real]Absence check using 3 positive place invariants in 25 ms returned sat
[2020-06-03 11:18:00] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 1924 ms returned sat
[2020-06-03 11:18:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:18:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:18:03] [INFO ] [Real]Absence check using state equation in 2880 ms returned (error "Failed to check-sat")
[2020-06-03 11:18:03] [INFO ] [Real]Absence check using 3 positive place invariants in 26 ms returned sat
[2020-06-03 11:18:04] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 1618 ms returned sat
[2020-06-03 11:18:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:18:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:18:08] [INFO ] [Real]Absence check using state equation in 3158 ms returned (error "Failed to check-sat")
[2020-06-03 11:18:08] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned unsat
[2020-06-03 11:18:08] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-06-03 11:18:10] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 1912 ms returned sat
[2020-06-03 11:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:18:13] [INFO ] [Real]Absence check using state equation in 2972 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 11:18:13] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-06-03 11:18:15] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 1801 ms returned sat
[2020-06-03 11:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:18:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:18:18] [INFO ] [Real]Absence check using state equation in 3031 ms returned (error "Failed to check-sat")
[2020-06-03 11:18:18] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:18:20] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 1794 ms returned sat
[2020-06-03 11:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:18:20] [INFO ] [Real]Absence check using state equation in 549 ms returned unsat
[2020-06-03 11:18:21] [INFO ] [Real]Absence check using 3 positive place invariants in 25 ms returned sat
[2020-06-03 11:18:23] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 2241 ms returned sat
[2020-06-03 11:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:18:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:18:25] [INFO ] [Real]Absence check using state equation in 2517 ms returned (error "Failed to check-sat")
[2020-06-03 11:18:26] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:18:27] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 1820 ms returned sat
[2020-06-03 11:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:18:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:18:30] [INFO ] [Real]Absence check using state equation in 2976 ms returned (error "Failed to check-sat")
[2020-06-03 11:18:31] [INFO ] [Real]Absence check using 3 positive place invariants in 26 ms returned sat
[2020-06-03 11:18:33] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 1895 ms returned sat
[2020-06-03 11:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:18:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:18:35] [INFO ] [Real]Absence check using state equation in 2859 ms returned (error "Failed to check-sat")
[2020-06-03 11:18:36] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:18:38] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 1935 ms returned sat
[2020-06-03 11:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:18:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:18:40] [INFO ] [Real]Absence check using state equation in 2852 ms returned (error "Failed to check-sat")
[2020-06-03 11:18:41] [INFO ] [Real]Absence check using 3 positive place invariants in 61 ms returned sat
[2020-06-03 11:18:43] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 1880 ms returned sat
[2020-06-03 11:18:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:18:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:18:45] [INFO ] [Real]Absence check using state equation in 2864 ms returned (error "Failed to check-sat")
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 1377 out of 1966 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1966/1966 places, 356/356 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 16044 edges and 1966 vertex of which 1965 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.44 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 1965 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 1964 transition count 353
Applied a total of 5 rules in 196 ms. Remains 1964 /1966 variables (removed 2) and now considering 353/356 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 1964/1966 places, 353/356 transitions.
Incomplete random walk after 1000000 steps, including 37140 resets, run finished after 25915 ms. (steps per millisecond=38 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 467771 steps, including 1201 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 310407 steps, including 262 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen :[0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 546239 steps, including 1219 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2243 resets, run finished after 2808 ms. (steps per millisecond=356 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 553082 steps, including 1239 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2235 resets, run finished after 1745 ms. (steps per millisecond=573 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2194 resets, run finished after 1813 ms. (steps per millisecond=551 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2226 resets, run finished after 1861 ms. (steps per millisecond=537 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2217 resets, run finished after 1833 ms. (steps per millisecond=545 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2209 resets, run finished after 1869 ms. (steps per millisecond=535 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2227 resets, run finished after 1863 ms. (steps per millisecond=536 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 353 rows 1964 cols
[2020-06-03 11:19:45] [INFO ] Computed 1611 place invariants in 127 ms
[2020-06-03 11:19:46] [INFO ] [Real]Absence check using 2 positive place invariants in 34 ms returned sat
[2020-06-03 11:19:48] [INFO ] [Real]Absence check using 2 positive and 1609 generalized place invariants in 2338 ms returned sat
[2020-06-03 11:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:19:56] [INFO ] [Real]Absence check using state equation in 7640 ms returned sat
[2020-06-03 11:19:56] [INFO ] Computed and/alt/rep : 329/2008/329 causal constraints in 49 ms.
[2020-06-03 11:19:59] [INFO ] Added : 155 causal constraints over 31 iterations in 3011 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 57 ms.
[2020-06-03 11:19:59] [INFO ] [Real]Absence check using 2 positive place invariants in 29 ms returned sat
[2020-06-03 11:20:02] [INFO ] [Real]Absence check using 2 positive and 1609 generalized place invariants in 2838 ms returned sat
[2020-06-03 11:20:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:20:44] [INFO ] [Real]Absence check using state equation in 41894 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 11:20:44] [INFO ] [Real]Absence check using 2 positive place invariants in 28 ms returned sat
[2020-06-03 11:20:46] [INFO ] [Real]Absence check using 2 positive and 1609 generalized place invariants in 1900 ms returned sat
[2020-06-03 11:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:20:52] [INFO ] [Real]Absence check using state equation in 5471 ms returned unsat
[2020-06-03 11:20:52] [INFO ] [Real]Absence check using 2 positive place invariants in 51 ms returned sat
[2020-06-03 11:20:54] [INFO ] [Real]Absence check using 2 positive and 1609 generalized place invariants in 1941 ms returned sat
[2020-06-03 11:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:21:09] [INFO ] [Real]Absence check using state equation in 14932 ms returned sat
[2020-06-03 11:21:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:21:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 34 ms returned sat
[2020-06-03 11:21:11] [INFO ] [Nat]Absence check using 2 positive and 1609 generalized place invariants in 2004 ms returned sat
[2020-06-03 11:21:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:21:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:21:27] [INFO ] [Nat]Absence check using state equation in 16095 ms returned unknown
[2020-06-03 11:21:28] [INFO ] [Real]Absence check using 2 positive place invariants in 25 ms returned sat
[2020-06-03 11:21:30] [INFO ] [Real]Absence check using 2 positive and 1609 generalized place invariants in 1986 ms returned sat
[2020-06-03 11:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:21:36] [INFO ] [Real]Absence check using state equation in 5989 ms returned sat
[2020-06-03 11:21:36] [INFO ] Computed and/alt/rep : 329/2008/329 causal constraints in 130 ms.
[2020-06-03 11:21:38] [INFO ] Added : 156 causal constraints over 32 iterations in 2361 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-06-03 11:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 30 ms returned sat
[2020-06-03 11:21:41] [INFO ] [Real]Absence check using 2 positive and 1609 generalized place invariants in 2337 ms returned sat
[2020-06-03 11:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:21:48] [INFO ] [Real]Absence check using state equation in 6695 ms returned sat
[2020-06-03 11:21:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:21:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 25 ms returned sat
[2020-06-03 11:21:50] [INFO ] [Nat]Absence check using 2 positive and 1609 generalized place invariants in 1845 ms returned sat
[2020-06-03 11:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:21:54] [INFO ] [Nat]Absence check using state equation in 4352 ms returned unsat
[2020-06-03 11:21:54] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned sat
[2020-06-03 11:21:56] [INFO ] [Real]Absence check using 2 positive and 1609 generalized place invariants in 1954 ms returned sat
[2020-06-03 11:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:22:00] [INFO ] [Real]Absence check using state equation in 4180 ms returned unsat
[2020-06-03 11:22:01] [INFO ] [Real]Absence check using 2 positive place invariants in 24 ms returned sat
[2020-06-03 11:22:03] [INFO ] [Real]Absence check using 2 positive and 1609 generalized place invariants in 1877 ms returned sat
[2020-06-03 11:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:22:09] [INFO ] [Real]Absence check using state equation in 6353 ms returned sat
[2020-06-03 11:22:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:22:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 26 ms returned sat
[2020-06-03 11:22:11] [INFO ] [Nat]Absence check using 2 positive and 1609 generalized place invariants in 1994 ms returned sat
[2020-06-03 11:22:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:22:18] [INFO ] [Nat]Absence check using state equation in 6412 ms returned sat
[2020-06-03 11:22:18] [INFO ] Computed and/alt/rep : 329/2008/329 causal constraints in 59 ms.
[2020-06-03 11:22:20] [INFO ] Added : 147 causal constraints over 30 iterations in 2594 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 49 ms.
[2020-06-03 11:22:21] [INFO ] [Real]Absence check using 2 positive place invariants in 24 ms returned sat
[2020-06-03 11:22:23] [INFO ] [Real]Absence check using 2 positive and 1609 generalized place invariants in 2316 ms returned sat
[2020-06-03 11:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:22:29] [INFO ] [Real]Absence check using state equation in 6163 ms returned sat
[2020-06-03 11:22:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:22:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 25 ms returned sat
[2020-06-03 11:22:31] [INFO ] [Nat]Absence check using 2 positive and 1609 generalized place invariants in 2059 ms returned sat
[2020-06-03 11:22:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:22:36] [INFO ] [Nat]Absence check using state equation in 4416 ms returned unsat
[2020-06-03 11:22:36] [INFO ] [Real]Absence check using 2 positive place invariants in 29 ms returned sat
[2020-06-03 11:22:40] [INFO ] [Real]Absence check using 2 positive and 1609 generalized place invariants in 3817 ms returned sat
[2020-06-03 11:22:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:22:48] [INFO ] [Real]Absence check using state equation in 8346 ms returned sat
[2020-06-03 11:22:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:22:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 18 ms returned sat
[2020-06-03 11:22:50] [INFO ] [Nat]Absence check using 2 positive and 1609 generalized place invariants in 1671 ms returned sat
[2020-06-03 11:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:22:56] [INFO ] [Nat]Absence check using state equation in 5555 ms returned sat
[2020-06-03 11:22:56] [INFO ] Computed and/alt/rep : 329/2008/329 causal constraints in 25 ms.
[2020-06-03 11:22:57] [INFO ] Added : 155 causal constraints over 31 iterations in 1323 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 15600 steps, including 176 resets, run finished after 382 ms. (steps per millisecond=40 ) properties seen :[1, 0, 1, 1, 0, 1] could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 14800 steps, including 151 resets, run finished after 254 ms. (steps per millisecond=58 ) properties seen :[0, 1] could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 3624 steps, including 24 resets, run visited all 1 properties in 72 ms. (steps per millisecond=50 )
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-03 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-PT-22"
export BK_EXAMINATION="ReachabilityCardinality"
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-PT-22, examination is ReachabilityCardinality"
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-158987872400814"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-22.tgz
mv QuasiCertifProtocol-PT-22 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;