Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998700334.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 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-832, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998700334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.3K Apr 30 06:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 06:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 06:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 06:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 30 07:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 30 07:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 30 07:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 30 07:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 251K May 10 09:34 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-832-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654250013484

Running Version 202205111006
[2022-06-03 09:53:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 09:53:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 09:53:36] [INFO ] Load time of PNML (sax parser for PT used): 368 ms
[2022-06-03 09:53:36] [INFO ] Transformed 737 places.
[2022-06-03 09:53:36] [INFO ] Transformed 993 transitions.
[2022-06-03 09:53:36] [INFO ] Found NUPN structural information;
[2022-06-03 09:53:36] [INFO ] Parsed PT model containing 737 places and 993 transitions in 571 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA Parking-PT-832-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 50 resets, run finished after 931 ms. (steps per millisecond=10 ) properties (out of 15) seen :4
FORMULA Parking-PT-832-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 609 rows 737 cols
[2022-06-03 09:53:37] [INFO ] Computed 184 place invariants in 49 ms
[2022-06-03 09:53:38] [INFO ] After 810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-03 09:53:39] [INFO ] [Nat]Absence check using 176 positive place invariants in 90 ms returned sat
[2022-06-03 09:53:39] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 7 ms returned sat
[2022-06-03 09:53:40] [INFO ] After 1375ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2022-06-03 09:53:40] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-06-03 09:53:41] [INFO ] After 901ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :6 sat :5
[2022-06-03 09:53:42] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 11 ms to minimize.
[2022-06-03 09:53:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2022-06-03 09:53:42] [INFO ] After 1994ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :5
Attempting to minimize the solution found.
Minimization took 775 ms.
[2022-06-03 09:53:43] [INFO ] After 4859ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :5
FORMULA Parking-PT-832-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-832-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-832-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-832-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-832-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-832-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 5 different solutions.
FORMULA Parking-PT-832-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6433 ms.
Support contains 95 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 609/609 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 737 transition count 601
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 19 place count 729 transition count 598
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 726 transition count 598
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 22 place count 726 transition count 589
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 40 place count 717 transition count 589
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 45 place count 712 transition count 584
Iterating global reduction 3 with 5 rules applied. Total rules applied 50 place count 712 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 82 place count 696 transition count 568
Free-agglomeration rule applied 98 times.
Iterating global reduction 3 with 98 rules applied. Total rules applied 180 place count 696 transition count 470
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 278 place count 598 transition count 470
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 281 place count 598 transition count 467
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 598 transition count 467
Applied a total of 283 rules in 396 ms. Remains 598 /737 variables (removed 139) and now considering 467/609 (removed 142) transitions.
Finished structural reductions, in 1 iterations. Remains : 598/737 places, 467/609 transitions.
Incomplete random walk after 1000000 steps, including 4128 resets, run finished after 22757 ms. (steps per millisecond=43 ) properties (out of 4) seen :1
FORMULA Parking-PT-832-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 417779 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen 0
Interrupted Best-First random walk after 818969 steps, including 273 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen 0
Interrupted Best-First random walk after 957959 steps, including 309 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 0
Running SMT prover for 3 properties.
// Phase 1: matrix 467 rows 598 cols
[2022-06-03 09:54:28] [INFO ] Computed 184 place invariants in 11 ms
[2022-06-03 09:54:28] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 09:54:28] [INFO ] [Nat]Absence check using 176 positive place invariants in 55 ms returned sat
[2022-06-03 09:54:28] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-03 09:54:29] [INFO ] After 508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 09:54:29] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-03 09:54:29] [INFO ] After 596ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-03 09:54:30] [INFO ] After 1214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 608 ms.
[2022-06-03 09:54:31] [INFO ] After 2588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1263 ms.
Support contains 47 out of 598 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 598/598 places, 467/467 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 598 transition count 464
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 595 transition count 464
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 595 transition count 457
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 588 transition count 457
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 586 transition count 455
Free-agglomeration rule applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 44 place count 586 transition count 435
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 64 place count 566 transition count 435
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 566 transition count 433
Applied a total of 66 rules in 192 ms. Remains 566 /598 variables (removed 32) and now considering 433/467 (removed 34) transitions.
Finished structural reductions, in 1 iterations. Remains : 566/598 places, 433/467 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21438 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 805713 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen 0
Interrupted Best-First random walk after 762427 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=152 ) properties seen 1
FORMULA Parking-PT-832-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 4206 ms. (steps per millisecond=237 ) properties (out of 2) seen :1
FORMULA Parking-PT-832-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 433 rows 566 cols
[2022-06-03 09:55:08] [INFO ] Computed 184 place invariants in 8 ms
[2022-06-03 09:55:08] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 09:55:08] [INFO ] [Nat]Absence check using 176 positive place invariants in 75 ms returned sat
[2022-06-03 09:55:08] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-03 09:55:09] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 09:55:09] [INFO ] State equation strengthened by 301 read => feed constraints.
[2022-06-03 09:55:09] [INFO ] After 92ms SMT Verify possible using 301 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 09:55:09] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-06-03 09:55:09] [INFO ] After 1138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 ms.
Support contains 9 out of 566 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 566/566 places, 433/433 transitions.
Graph (complete) has 1155 edges and 566 vertex of which 504 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.10 ms
Discarding 62 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 504 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 503 transition count 380
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 17 place count 503 transition count 374
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 29 place count 497 transition count 374
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 495 transition count 372
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 44 place count 495 transition count 361
Reduce places removed 11 places and 0 transitions.
Graph (complete) has 968 edges and 484 vertex of which 357 are kept as prefixes of interest. Removing 127 places using SCC suffix rule.0 ms
Discarding 127 places :
Also discarding 82 output transitions
Drop transitions removed 82 transitions
Iterating post reduction 2 with 12 rules applied. Total rules applied 56 place count 357 transition count 279
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 76 place count 357 transition count 259
Applied a total of 76 rules in 190 ms. Remains 357 /566 variables (removed 209) and now considering 259/433 (removed 174) transitions.
Finished structural reductions, in 1 iterations. Remains : 357/566 places, 259/433 transitions.
Finished random walk after 19257 steps, including 0 resets, run visited all 1 properties in 317 ms. (steps per millisecond=60 )
FORMULA Parking-PT-832-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 94632 ms.

BK_STOP 1654250110382

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-832"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-832, 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 r150-smll-165276998700334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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