fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r168-smll-158987806500310
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for CloudDeployment-PT-4b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.790 3600000.00 71828.00 399.40 FFFFTFTTTFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806500310.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 CloudDeployment-PT-4b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806500310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 3.2K Mar 30 01:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 30 01:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 28 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 26 07:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 26 07:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 591K 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 CloudDeployment-PT-4b-ReachabilityCardinality-00
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-01
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-02
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-03
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-04
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-05
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-06
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-07
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-08
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-09
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-10
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-11
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-12
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-13
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-14
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591285126695

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:38:49] [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-04 15:38:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:38:50] [INFO ] Load time of PNML (sax parser for PT used): 378 ms
[2020-06-04 15:38:50] [INFO ] Transformed 1182 places.
[2020-06-04 15:38:50] [INFO ] Transformed 1824 transitions.
[2020-06-04 15:38:50] [INFO ] Found NUPN structural information;
[2020-06-04 15:38:50] [INFO ] Parsed PT model containing 1182 places and 1824 transitions in 484 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 113 ms.
Working with output stream class java.io.PrintStream
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 81 resets, run finished after 107 ms. (steps per millisecond=93 ) properties seen :[0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1]
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1824 rows 1182 cols
[2020-06-04 15:38:50] [INFO ] Computed 17 place invariants in 72 ms
[2020-06-04 15:38:51] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 127 ms returned sat
[2020-06-04 15:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:38:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 15:38:56] [INFO ] [Real]Absence check using state equation in 4295 ms returned (error "Failed to check-sat")
[2020-06-04 15:38:56] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 111 ms returned sat
[2020-06-04 15:38:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 15:39:01] [INFO ] [Real]Absence check using state equation in 4393 ms returned (error "Failed to check-sat")
[2020-06-04 15:39:01] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 108 ms returned sat
[2020-06-04 15:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 15:39:06] [INFO ] [Real]Absence check using state equation in 4498 ms returned (error "Failed to check-sat")
[2020-06-04 15:39:06] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 111 ms returned sat
[2020-06-04 15:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 15:39:11] [INFO ] [Real]Absence check using state equation in 4541 ms returned (error "Failed to check-sat")
[2020-06-04 15:39:11] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 98 ms returned sat
[2020-06-04 15:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 15:39:16] [INFO ] [Real]Absence check using state equation in 4588 ms returned (error "Failed to check-sat")
[2020-06-04 15:39:16] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 110 ms returned sat
[2020-06-04 15:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 15:39:21] [INFO ] [Real]Absence check using state equation in 4521 ms returned (error "Failed to check-sat")
Support contains 21 out of 1182 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Graph (trivial) has 1163 edges and 1182 vertex of which 276 / 1182 are part of one of the 30 SCC in 25 ms
Free SCC test removed 246 places
Discarding 30 places :
Also discarding 260 output transitions
Drop transitions removed 260 transitions
Graph (complete) has 2423 edges and 936 vertex of which 906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.26 ms
Drop transitions removed 317 transitions
Reduce isomorphic transitions removed 317 transitions.
Performed 444 Post agglomeration using F-continuation condition.Transition count delta: 444
Iterating post reduction 0 with 761 rules applied. Total rules applied 763 place count 906 transition count 803
Reduce places removed 444 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 449 rules applied. Total rules applied 1212 place count 462 transition count 798
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1214 place count 460 transition count 798
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 1214 place count 460 transition count 780
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 1250 place count 442 transition count 780
Symmetric choice reduction at 3 with 157 rule applications. Total rules 1407 place count 442 transition count 780
Deduced a syphon composed of 157 places in 4 ms
Reduce places removed 157 places and 157 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 1721 place count 285 transition count 623
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1732 place count 285 transition count 612
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 1732 place count 285 transition count 599
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 1758 place count 272 transition count 599
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1760 place count 272 transition count 599
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1764 place count 270 transition count 597
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1765 place count 270 transition count 597
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1767 place count 269 transition count 596
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 1901 place count 202 transition count 529
Performed 35 Post agglomeration using F-continuation condition with reduction of 53 identical transitions.
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1971 place count 167 transition count 678
Drop transitions removed 14 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 1988 place count 167 transition count 661
Free-agglomeration rule applied 37 times with reduction of 11 identical transitions.
Iterating global reduction 5 with 37 rules applied. Total rules applied 2025 place count 167 transition count 613
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 58 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 74 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 815 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Iterating post reduction 5 with 112 rules applied. Total rules applied 2137 place count 129 transition count 539
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2138 place count 129 transition count 538
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 2148 place count 129 transition count 538
Partial Post-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 2157 place count 129 transition count 538
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2162 place count 129 transition count 533
Drop transitions removed 158 transitions
Redundant transition composition rules discarded 158 transitions
Iterating global reduction 8 with 158 rules applied. Total rules applied 2320 place count 129 transition count 375
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2321 place count 128 transition count 374
Applied a total of 2321 rules in 621 ms. Remains 128 /1182 variables (removed 1054) and now considering 374/1824 (removed 1450) transitions.
Finished structural reductions, in 1 iterations. Remains : 128/1182 places, 374/1824 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3814 ms. (steps per millisecond=262 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1059 ms. (steps per millisecond=944 ) properties seen :[0, 0, 0, 0, 1, 0]
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1065 ms. (steps per millisecond=938 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1257 ms. (steps per millisecond=795 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 932 ms. (steps per millisecond=1072 ) properties seen :[0, 0, 0, 1, 0]
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1411 ms. (steps per millisecond=708 ) properties seen :[0, 0, 0, 0]
[2020-06-04 15:39:31] [INFO ] Flow matrix only has 240 transitions (discarded 134 similar events)
// Phase 1: matrix 240 rows 128 cols
[2020-06-04 15:39:31] [INFO ] Computed 15 place invariants in 6 ms
[2020-06-04 15:39:31] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-06-04 15:39:31] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 6 ms returned sat
[2020-06-04 15:39:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:31] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2020-06-04 15:39:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:39:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2020-06-04 15:39:31] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 6 ms returned sat
[2020-06-04 15:39:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:31] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2020-06-04 15:39:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2020-06-04 15:39:31] [INFO ] [Nat]Added 9 Read/Feed constraints in 15 ms returned sat
[2020-06-04 15:39:31] [INFO ] Deduced a trap composed of 7 places in 149 ms
[2020-06-04 15:39:32] [INFO ] Deduced a trap composed of 4 places in 131 ms
[2020-06-04 15:39:32] [INFO ] Deduced a trap composed of 5 places in 165 ms
[2020-06-04 15:39:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 524 ms
[2020-06-04 15:39:32] [INFO ] Computed and/alt/rep : 369/1935/237 causal constraints in 37 ms.
[2020-06-04 15:39:33] [INFO ] Added : 104 causal constraints over 21 iterations in 770 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-06-04 15:39:33] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2020-06-04 15:39:33] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 11 ms returned sat
[2020-06-04 15:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:33] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-06-04 15:39:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:39:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 27 ms returned sat
[2020-06-04 15:39:33] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 11 ms returned sat
[2020-06-04 15:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:33] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2020-06-04 15:39:33] [INFO ] [Nat]Added 9 Read/Feed constraints in 21 ms returned sat
[2020-06-04 15:39:33] [INFO ] Deduced a trap composed of 5 places in 159 ms
[2020-06-04 15:39:34] [INFO ] Deduced a trap composed of 5 places in 182 ms
[2020-06-04 15:39:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2020-06-04 15:39:34] [INFO ] Computed and/alt/rep : 369/1935/237 causal constraints in 38 ms.
[2020-06-04 15:39:34] [INFO ] Added : 115 causal constraints over 24 iterations in 824 ms. Result :sat
[2020-06-04 15:39:35] [INFO ] Deduced a trap composed of 12 places in 116 ms
[2020-06-04 15:39:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-04 15:39:35] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2020-06-04 15:39:35] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 11 ms returned sat
[2020-06-04 15:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:35] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-04 15:39:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:39:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2020-06-04 15:39:35] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 11 ms returned sat
[2020-06-04 15:39:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:35] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2020-06-04 15:39:35] [INFO ] [Nat]Added 9 Read/Feed constraints in 28 ms returned sat
[2020-06-04 15:39:35] [INFO ] Computed and/alt/rep : 369/1935/237 causal constraints in 48 ms.
[2020-06-04 15:39:36] [INFO ] Added : 87 causal constraints over 18 iterations in 629 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-06-04 15:39:36] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2020-06-04 15:39:36] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 11 ms returned sat
[2020-06-04 15:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:36] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2020-06-04 15:39:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:39:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2020-06-04 15:39:36] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 11 ms returned sat
[2020-06-04 15:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:39:36] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2020-06-04 15:39:36] [INFO ] [Nat]Added 9 Read/Feed constraints in 19 ms returned sat
[2020-06-04 15:39:37] [INFO ] Deduced a trap composed of 5 places in 154 ms
[2020-06-04 15:39:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2020-06-04 15:39:37] [INFO ] Computed and/alt/rep : 369/1935/237 causal constraints in 44 ms.
[2020-06-04 15:39:37] [INFO ] Added : 112 causal constraints over 23 iterations in 776 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 13100 steps, including 288 resets, run finished after 112 ms. (steps per millisecond=116 ) properties seen :[1, 1, 0, 1] could not realise parikh vector
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 3972 steps, including 99 resets, run visited all 1 properties in 33 ms. (steps per millisecond=120 )
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-06 TRUE 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="CloudDeployment-PT-4b"
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 CloudDeployment-PT-4b, 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 r168-smll-158987806500310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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