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

About the Execution of ITS-Tools for Parking-PT-864

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.390 123267.00 151297.00 84.40 FFFTFFFFTTFTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257800558.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Parking-PT-864, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257800558
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 3.1K Apr 12 00:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 00:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 10 23:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 10 23:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 08:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 08:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 12:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 9 12:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 427K 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 Parking-PT-864-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590002543500

[2020-05-20 19:22:25] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-20 19:22:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 19:22:25] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2020-05-20 19:22:25] [INFO ] Transformed 1185 places.
[2020-05-20 19:22:25] [INFO ] Transformed 1697 transitions.
[2020-05-20 19:22:25] [INFO ] Found NUPN structural information;
[2020-05-20 19:22:25] [INFO ] Parsed PT model containing 1185 places and 1697 transitions in 212 ms.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
FORMULA Parking-PT-864-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 38 resets, run finished after 193 ms. (steps per millisecond=51 ) properties seen :[0, 0, 1, 0, 1, 0, 0, 0, 1, 0]
FORMULA Parking-PT-864-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 87 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 72 ms. (steps per millisecond=138 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1009 rows 1185 cols
[2020-05-20 19:22:26] [INFO ] Computed 280 place invariants in 48 ms
[2020-05-20 19:22:27] [INFO ] [Real]Absence check using 272 positive place invariants in 224 ms returned sat
[2020-05-20 19:22:27] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-20 19:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 19:22:30] [INFO ] [Real]Absence check using state equation in 2943 ms returned sat
[2020-05-20 19:22:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 19:22:31] [INFO ] [Nat]Absence check using 272 positive place invariants in 243 ms returned sat
[2020-05-20 19:22:31] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-20 19:22:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 19:22:33] [INFO ] [Nat]Absence check using state equation in 2801 ms returned sat
[2020-05-20 19:22:33] [INFO ] State equation strengthened by 248 read => feed constraints.
[2020-05-20 19:22:33] [INFO ] [Nat]Added 248 Read/Feed constraints in 47 ms returned sat
[2020-05-20 19:22:34] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 98 ms.
[2020-05-20 19:22:35] [INFO ] Added : 80 causal constraints over 16 iterations in 1331 ms. Result :(error "Failed to check-sat")
[2020-05-20 19:22:35] [INFO ] [Real]Absence check using 272 positive place invariants in 266 ms returned sat
[2020-05-20 19:22:35] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-20 19:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 19:22:38] [INFO ] [Real]Absence check using state equation in 2923 ms returned sat
[2020-05-20 19:22:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 19:22:39] [INFO ] [Nat]Absence check using 272 positive place invariants in 207 ms returned sat
[2020-05-20 19:22:39] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 14 ms returned sat
[2020-05-20 19:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 19:22:41] [INFO ] [Nat]Absence check using state equation in 2786 ms returned sat
[2020-05-20 19:22:42] [INFO ] [Nat]Added 248 Read/Feed constraints in 66 ms returned sat
[2020-05-20 19:22:42] [INFO ] Deduced a trap composed of 60 places in 102 ms
[2020-05-20 19:22:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2020-05-20 19:22:42] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 100 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2020-05-20 19:22:43] [INFO ] Added : 85 causal constraints over 17 iterations in 1574 ms. Result :(error "Failed to check-sat")
[2020-05-20 19:22:44] [INFO ] [Real]Absence check using 272 positive place invariants in 207 ms returned sat
[2020-05-20 19:22:44] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-05-20 19:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 19:22:46] [INFO ] [Real]Absence check using state equation in 2755 ms returned sat
[2020-05-20 19:22:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 19:22:47] [INFO ] [Nat]Absence check using 272 positive place invariants in 207 ms returned sat
[2020-05-20 19:22:47] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 13 ms returned sat
[2020-05-20 19:22:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 19:22:50] [INFO ] [Nat]Absence check using state equation in 2968 ms returned sat
[2020-05-20 19:22:50] [INFO ] [Nat]Added 248 Read/Feed constraints in 47 ms returned sat
[2020-05-20 19:22:50] [INFO ] Deduced a trap composed of 60 places in 70 ms
[2020-05-20 19:22:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2020-05-20 19:22:50] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 137 ms.
[2020-05-20 19:22:52] [INFO ] Added : 95 causal constraints over 19 iterations in 1457 ms. Result :unknown
[2020-05-20 19:22:52] [INFO ] [Real]Absence check using 272 positive place invariants in 217 ms returned sat
[2020-05-20 19:22:52] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-05-20 19:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 19:22:55] [INFO ] [Real]Absence check using state equation in 2893 ms returned sat
[2020-05-20 19:22:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 19:22:55] [INFO ] [Nat]Absence check using 272 positive place invariants in 282 ms returned sat
[2020-05-20 19:22:55] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 41 ms returned sat
[2020-05-20 19:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 19:23:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 19:23:00] [INFO ] [Nat]Absence check using state equation in 4518 ms returned (error "Failed to check-sat")
[2020-05-20 19:23:00] [INFO ] [Real]Absence check using 272 positive place invariants in 232 ms returned sat
[2020-05-20 19:23:00] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-05-20 19:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 19:23:03] [INFO ] [Real]Absence check using state equation in 2942 ms returned sat
[2020-05-20 19:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 19:23:04] [INFO ] [Nat]Absence check using 272 positive place invariants in 251 ms returned sat
[2020-05-20 19:23:04] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 13 ms returned sat
[2020-05-20 19:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 19:23:07] [INFO ] [Nat]Absence check using state equation in 2977 ms returned sat
[2020-05-20 19:23:07] [INFO ] [Nat]Added 248 Read/Feed constraints in 43 ms returned sat
[2020-05-20 19:23:07] [INFO ] Deduced a trap composed of 68 places in 65 ms
[2020-05-20 19:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2020-05-20 19:23:07] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 79 ms.
[2020-05-20 19:23:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t80 0) (and (> t353 0) (< o353 o80)))") while checking expression at index 4
[2020-05-20 19:23:09] [INFO ] [Real]Absence check using 272 positive place invariants in 207 ms returned sat
[2020-05-20 19:23:09] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 10 ms returned sat
[2020-05-20 19:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 19:23:11] [INFO ] [Real]Absence check using state equation in 2810 ms returned sat
[2020-05-20 19:23:12] [INFO ] [Real]Added 248 Read/Feed constraints in 52 ms returned sat
[2020-05-20 19:23:12] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 59 ms.
[2020-05-20 19:23:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 19:23:12] [INFO ] [Nat]Absence check using 272 positive place invariants in 315 ms returned sat
[2020-05-20 19:23:12] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 9 ms returned sat
[2020-05-20 19:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 19:23:15] [INFO ] [Nat]Absence check using state equation in 2690 ms returned sat
[2020-05-20 19:23:15] [INFO ] [Nat]Added 248 Read/Feed constraints in 65 ms returned sat
[2020-05-20 19:23:15] [INFO ] Deduced a trap composed of 60 places in 89 ms
[2020-05-20 19:23:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2020-05-20 19:23:15] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 87 ms.
[2020-05-20 19:23:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t90 0) (or (and (> t0 0) (< o0 o90)) (and (> t685 0) (< o685 o90))))") while checking expression at index 5
[2020-05-20 19:23:17] [INFO ] [Real]Absence check using 272 positive place invariants in 205 ms returned sat
[2020-05-20 19:23:17] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 12 ms returned sat
[2020-05-20 19:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 19:23:20] [INFO ] [Real]Absence check using state equation in 2813 ms returned sat
[2020-05-20 19:23:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 19:23:21] [INFO ] [Nat]Absence check using 272 positive place invariants in 204 ms returned sat
[2020-05-20 19:23:21] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-05-20 19:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 19:23:23] [INFO ] [Nat]Absence check using state equation in 2774 ms returned sat
[2020-05-20 19:23:23] [INFO ] [Nat]Added 248 Read/Feed constraints in 63 ms returned sat
[2020-05-20 19:23:24] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 71 ms.
[2020-05-20 19:23:25] [INFO ] Added : 90 causal constraints over 18 iterations in 1773 ms. Result :unknown
Incomplete Parikh walk after 118400 steps, including 343 resets, run finished after 1667 ms. (steps per millisecond=71 ) properties seen :[0, 1, 0, 0, 0, 0, 0] could not realise parikh vector
FORMULA Parking-PT-864-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 115400 steps, including 338 resets, run finished after 1563 ms. (steps per millisecond=73 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 22 out of 1185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1185 transition count 977
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1153 transition count 977
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1153 transition count 945
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 1121 transition count 945
Symmetric choice reduction at 2 with 7 rule applications. Total rules 135 place count 1121 transition count 945
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 149 place count 1114 transition count 938
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 229 place count 1074 transition count 898
Free-agglomeration rule applied 183 times.
Iterating global reduction 2 with 183 rules applied. Total rules applied 412 place count 1074 transition count 715
Reduce places removed 183 places and 0 transitions.
Iterating post reduction 2 with 183 rules applied. Total rules applied 595 place count 891 transition count 715
Applied a total of 595 rules in 502 ms. Remains 891 /1185 variables (removed 294) and now considering 715/1009 (removed 294) transitions.
Finished structural reductions, in 1 iterations. Remains : 891/1185 places, 715/1009 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 5566 ms. (steps per millisecond=179 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3734 ms. (steps per millisecond=267 ) properties seen :[0, 1, 0, 1, 0, 0]
FORMULA Parking-PT-864-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3934 ms. (steps per millisecond=254 ) properties seen :[0, 0, 1, 0]
FORMULA Parking-PT-864-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3642 ms. (steps per millisecond=274 ) properties seen :[0, 0, 1]
FORMULA Parking-PT-864-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 715 rows 891 cols
[2020-05-20 19:23:46] [INFO ] Computed 280 place invariants in 9 ms
[2020-05-20 19:23:46] [INFO ] [Real]Absence check using 272 positive place invariants in 177 ms returned sat
[2020-05-20 19:23:46] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-20 19:23:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 19:23:48] [INFO ] [Real]Absence check using state equation in 1639 ms returned sat
[2020-05-20 19:23:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 19:23:48] [INFO ] [Nat]Absence check using 272 positive place invariants in 171 ms returned sat
[2020-05-20 19:23:48] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 11 ms returned sat
[2020-05-20 19:23:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 19:23:50] [INFO ] [Nat]Absence check using state equation in 1682 ms returned sat
[2020-05-20 19:23:50] [INFO ] State equation strengthened by 543 read => feed constraints.
[2020-05-20 19:23:50] [INFO ] [Nat]Added 543 Read/Feed constraints in 72 ms returned sat
[2020-05-20 19:23:50] [INFO ] Computed and/alt/rep : 714/2792/714 causal constraints in 31 ms.
[2020-05-20 19:24:00] [INFO ] Added : 714 causal constraints over 143 iterations in 9586 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2020-05-20 19:24:00] [INFO ] [Real]Absence check using 272 positive place invariants in 493 ms returned sat
[2020-05-20 19:24:00] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 33 ms returned sat
[2020-05-20 19:24:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 19:24:07] [INFO ] [Real]Absence check using state equation in 6219 ms returned sat
[2020-05-20 19:24:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 19:24:07] [INFO ] [Nat]Absence check using 272 positive place invariants in 526 ms returned sat
[2020-05-20 19:24:07] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 35 ms returned sat
[2020-05-20 19:24:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 19:24:13] [INFO ] [Nat]Absence check using state equation in 6127 ms returned sat
[2020-05-20 19:24:14] [INFO ] [Nat]Added 543 Read/Feed constraints in 91 ms returned sat
[2020-05-20 19:24:14] [INFO ] Computed and/alt/rep : 714/2792/714 causal constraints in 55 ms.
[2020-05-20 19:24:26] [INFO ] Added : 600 causal constraints over 120 iterations in 12123 ms. Result :sat
[2020-05-20 19:24:26] [INFO ] Deduced a trap composed of 62 places in 69 ms
[2020-05-20 19:24:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
Attempting to minimize the solution found.
Minimization took 52 ms.
Finished Parikh walk after 2416 steps, including 9 resets, run visited all 2 properties in 31 ms. (steps per millisecond=77 )
FORMULA Parking-PT-864-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590002666767

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-864"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Parking-PT-864, 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 r111-csrt-158961257800558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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