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.r078-tall-165260110700735.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 FamilyReunion-PT-L00050M0005C002P002G001, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110700735
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 101K Apr 30 08:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 605K Apr 30 08:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 278K Apr 30 08:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 1002K Apr 30 08:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 64K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 277K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 80K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 229K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 309K Apr 30 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Apr 30 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 478K Apr 30 09:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.8M Apr 30 09:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.7M May 10 09:33 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 FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654195144679

Running Version 202205111006
[2022-06-02 18:39:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-02 18:39:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 18:39:06] [INFO ] Load time of PNML (sax parser for PT used): 417 ms
[2022-06-02 18:39:06] [INFO ] Transformed 12194 places.
[2022-06-02 18:39:06] [INFO ] Transformed 10560 transitions.
[2022-06-02 18:39:06] [INFO ] Parsed PT model containing 12194 places and 10560 transitions in 601 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 61 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 17 places and 0 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 716 ms. (steps per millisecond=13 ) properties (out of 16) seen :11
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 954 ms. (steps per millisecond=10 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10560 rows 12177 cols
[2022-06-02 18:39:09] [INFO ] Computed 2768 place invariants in 702 ms
[2022-06-02 18:39:14] [INFO ] [Real]Absence check using 149 positive place invariants in 358 ms returned sat
[2022-06-02 18:39:15] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1512 ms returned sat
[2022-06-02 18:39:36] [INFO ] After 25069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 18:39:38] [INFO ] [Nat]Absence check using 149 positive place invariants in 323 ms returned sat
[2022-06-02 18:39:40] [INFO ] [Nat]Absence check using 149 positive and 2619 generalized place invariants in 1414 ms returned sat
[2022-06-02 18:40:01] [INFO ] After 20001ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 18:40:01] [INFO ] After 20015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-02 18:40:01] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2826 out of 12177 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 11701 are kept as prefixes of interest. Removing 476 places using SCC suffix rule.44 ms
Discarding 476 places :
Also discarding 253 output transitions
Drop transitions removed 253 transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 99 transitions.
Discarding 1521 places :
Implicit places reduction removed 1521 places
Drop transitions removed 1091 transitions
Trivial Post-agglo rules discarded 1091 transitions
Performed 1091 trivial Post agglomeration. Transition count delta: 1091
Iterating post reduction 0 with 2711 rules applied. Total rules applied 2712 place count 10180 transition count 9117
Reduce places removed 1091 places and 0 transitions.
Performed 1067 Post agglomeration using F-continuation condition.Transition count delta: 1067
Iterating post reduction 1 with 2158 rules applied. Total rules applied 4870 place count 9089 transition count 8050
Reduce places removed 1067 places and 0 transitions.
Iterating post reduction 2 with 1067 rules applied. Total rules applied 5937 place count 8022 transition count 8050
Performed 757 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 757 Pre rules applied. Total rules applied 5937 place count 8022 transition count 7293
Deduced a syphon composed of 757 places in 22 ms
Ensure Unique test removed 50 places
Reduce places removed 807 places and 0 transitions.
Iterating global reduction 3 with 1564 rules applied. Total rules applied 7501 place count 7215 transition count 7293
Discarding 150 places :
Implicit places reduction removed 150 places
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Iterating post reduction 3 with 297 rules applied. Total rules applied 7798 place count 7065 transition count 7146
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 4 with 147 rules applied. Total rules applied 7945 place count 6918 transition count 7146
Discarding 1011 places :
Symmetric choice reduction at 5 with 1011 rule applications. Total rules 8956 place count 5907 transition count 6135
Iterating global reduction 5 with 1011 rules applied. Total rules applied 9967 place count 5907 transition count 6135
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 5 with 249 rules applied. Total rules applied 10216 place count 5808 transition count 5985
Reduce places removed 50 places and 0 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Iterating post reduction 6 with 99 rules applied. Total rules applied 10315 place count 5758 transition count 5936
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 7 with 49 rules applied. Total rules applied 10364 place count 5709 transition count 5936
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 150 Pre rules applied. Total rules applied 10364 place count 5709 transition count 5786
Deduced a syphon composed of 150 places in 6 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 8 with 300 rules applied. Total rules applied 10664 place count 5559 transition count 5786
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 10665 place count 5558 transition count 5735
Iterating global reduction 8 with 1 rules applied. Total rules applied 10666 place count 5558 transition count 5735
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 4 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 8 with 106 rules applied. Total rules applied 10772 place count 5505 transition count 5682
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 10773 place count 5505 transition count 5681
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 10774 place count 5504 transition count 5681
Free-agglomeration rule (complex) applied 104 times.
Iterating global reduction 9 with 104 rules applied. Total rules applied 10878 place count 5504 transition count 5673
Ensure Unique test removed 50 places
Reduce places removed 154 places and 0 transitions.
Iterating post reduction 9 with 154 rules applied. Total rules applied 11032 place count 5350 transition count 5673
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 50 Pre rules applied. Total rules applied 11032 place count 5350 transition count 5623
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 10 with 100 rules applied. Total rules applied 11132 place count 5300 transition count 5623
Applied a total of 11132 rules in 3798 ms. Remains 5300 /12177 variables (removed 6877) and now considering 5623/10560 (removed 4937) transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/12177 places, 5623/10560 transitions.
Incomplete random walk after 1000000 steps, including 682 resets, run finished after 24807 ms. (steps per millisecond=40 ) properties (out of 5) seen :3
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 51674 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 12 resets, run finished after 2436 ms. (steps per millisecond=410 ) properties (out of 2) seen :1
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 5623 rows 5300 cols
[2022-06-02 18:40:37] [INFO ] Computed 736 place invariants in 111 ms
[2022-06-02 18:40:40] [INFO ] [Real]Absence check using 0 positive and 736 generalized place invariants in 332 ms returned sat
[2022-06-02 18:40:40] [INFO ] After 1121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:40:41] [INFO ] [Nat]Absence check using 0 positive and 736 generalized place invariants in 270 ms returned sat
[2022-06-02 18:40:57] [INFO ] After 16865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2760 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5300/5300 places, 5623/5623 transitions.
Graph (complete) has 9077 edges and 5300 vertex of which 5294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 5285 transition count 5604
Reduce places removed 11 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 32 rules applied. Total rules applied 57 place count 5274 transition count 5583
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 78 place count 5253 transition count 5583
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 78 place count 5253 transition count 5572
Deduced a syphon composed of 11 places in 132 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 101 place count 5241 transition count 5572
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 107 place count 5238 transition count 5569
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 110 place count 5235 transition count 5569
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 113 place count 5232 transition count 5468
Iterating global reduction 5 with 3 rules applied. Total rules applied 116 place count 5232 transition count 5468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 120 place count 5230 transition count 5466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 121 place count 5229 transition count 5466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 121 place count 5229 transition count 5465
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 123 place count 5228 transition count 5465
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 131 place count 5224 transition count 5461
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 137 place count 5224 transition count 5458
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 144 place count 5217 transition count 5458
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 144 place count 5217 transition count 5457
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 146 place count 5216 transition count 5457
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 148 place count 5214 transition count 5304
Iterating global reduction 8 with 2 rules applied. Total rules applied 150 place count 5214 transition count 5304
Applied a total of 150 rules in 1510 ms. Remains 5214 /5300 variables (removed 86) and now considering 5304/5623 (removed 319) transitions.
Finished structural reductions, in 1 iterations. Remains : 5214/5300 places, 5304/5623 transitions.
Incomplete random walk after 1000000 steps, including 693 resets, run finished after 17496 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 50569 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=10 ) properties seen 0
Interrupted probabilistic random walk after 3165663 steps, run timeout after 66001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 3165663 steps, saw 660482 distinct states, run finished after 66004 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5304 rows 5214 cols
[2022-06-02 18:42:27] [INFO ] Computed 719 place invariants in 82 ms
[2022-06-02 18:42:30] [INFO ] [Real]Absence check using 0 positive and 719 generalized place invariants in 258 ms returned sat
[2022-06-02 18:42:30] [INFO ] After 972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:42:31] [INFO ] [Nat]Absence check using 0 positive and 719 generalized place invariants in 276 ms returned sat
[2022-06-02 18:42:39] [INFO ] After 8077ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:42:43] [INFO ] After 11935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 630 ms.
[2022-06-02 18:42:44] [INFO ] After 13562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 530 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=40 )
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 18 ms.
All properties solved without resorting to model-checking.
Total runtime 218315 ms.

BK_STOP 1654195364289

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="FamilyReunion-PT-L00050M0005C002P002G001"
export BK_EXAMINATION="ReachabilityFireability"
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 FamilyReunion-PT-L00050M0005C002P002G001, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110700735"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00050M0005C002P002G001.tgz
mv FamilyReunion-PT-L00050M0005C002P002G001 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;