Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853728700173.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Anderson-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853728700173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 461K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Anderson-PT-07-UpperBounds-00
FORMULA_NAME Anderson-PT-07-UpperBounds-01
FORMULA_NAME Anderson-PT-07-UpperBounds-02
FORMULA_NAME Anderson-PT-07-UpperBounds-03
FORMULA_NAME Anderson-PT-07-UpperBounds-04
FORMULA_NAME Anderson-PT-07-UpperBounds-05
FORMULA_NAME Anderson-PT-07-UpperBounds-06
FORMULA_NAME Anderson-PT-07-UpperBounds-07
FORMULA_NAME Anderson-PT-07-UpperBounds-08
FORMULA_NAME Anderson-PT-07-UpperBounds-09
FORMULA_NAME Anderson-PT-07-UpperBounds-10
FORMULA_NAME Anderson-PT-07-UpperBounds-11
FORMULA_NAME Anderson-PT-07-UpperBounds-12
FORMULA_NAME Anderson-PT-07-UpperBounds-13
FORMULA_NAME Anderson-PT-07-UpperBounds-14
FORMULA_NAME Anderson-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748543287639

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-29 18:28:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 18:28:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:28:08] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2025-05-29 18:28:08] [INFO ] Transformed 309 places.
[2025-05-29 18:28:08] [INFO ] Transformed 917 transitions.
[2025-05-29 18:28:08] [INFO ] Found NUPN structural information;
[2025-05-29 18:28:08] [INFO ] Parsed PT model containing 309 places and 917 transitions and 3500 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 917 rows 309 cols
[2025-05-29 18:28:09] [INFO ] Computed 17 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 72 ms. (136 steps per ms)
FORMULA Anderson-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 44 ms. (444 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 18:28:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 18:28:09] [INFO ] [Real]Absence check using 8 positive place invariants in 22 ms returned sat
[2025-05-29 18:28:09] [INFO ] [Real]Absence check using 8 positive and 9 generalized place invariants in 32 ms returned sat
[2025-05-29 18:28:09] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2025-05-29 18:28:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 18:28:09] [INFO ] [Real]Added 42 Read/Feed constraints in 29 ms returned sat
[2025-05-29 18:28:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 18:28:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-29 18:28:10] [INFO ] [Nat]Absence check using 8 positive and 9 generalized place invariants in 25 ms returned sat
[2025-05-29 18:28:10] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2025-05-29 18:28:10] [INFO ] [Nat]Added 42 Read/Feed constraints in 84 ms returned sat
[2025-05-29 18:28:10] [INFO ] Computed and/alt/rep : 217/1302/217 causal constraints (skipped 693 transitions) in 128 ms.
[2025-05-29 18:28:12] [INFO ] Added : 89 causal constraints over 18 iterations in 2237 ms. Result :sat
Minimization took 945 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 18:28:13] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 18:28:13] [INFO ] [Real]Absence check using 8 positive and 9 generalized place invariants in 20 ms returned sat
[2025-05-29 18:28:13] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2025-05-29 18:28:13] [INFO ] [Real]Added 42 Read/Feed constraints in 17 ms returned sat
[2025-05-29 18:28:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 18:28:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 18:28:14] [INFO ] [Nat]Absence check using 8 positive and 9 generalized place invariants in 24 ms returned sat
[2025-05-29 18:28:14] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2025-05-29 18:28:14] [INFO ] [Nat]Added 42 Read/Feed constraints in 86 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:14] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 34 ms to minimize.
[2025-05-29 18:28:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2025-05-29 18:28:14] [INFO ] Computed and/alt/rep : 217/1302/217 causal constraints (skipped 693 transitions) in 81 ms.
[2025-05-29 18:28:15] [INFO ] Added : 18 causal constraints over 4 iterations in 978 ms. Result :sat
Minimization took 696 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 917/917 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 0 place count 309 transition count 876
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 268 transition count 876
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 165 place count 185 transition count 289
Iterating global reduction 0 with 83 rules applied. Total rules applied 248 place count 185 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 250 place count 184 transition count 288
Applied a total of 250 rules in 82 ms. Remains 184 /309 variables (removed 125) and now considering 288/917 (removed 629) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 184/309 places, 288/917 transitions.
// Phase 1: matrix 288 rows 184 cols
[2025-05-29 18:28:16] [INFO ] Computed 17 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1208 ms. (827 steps per ms)
FORMULA Anderson-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 588 ms. (1697 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-29 18:28:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 18:28:18] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-29 18:28:18] [INFO ] [Real]Absence check using 9 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-29 18:28:18] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-05-29 18:28:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 18:28:18] [INFO ] [Real]Added 42 Read/Feed constraints in 6 ms returned sat
[2025-05-29 18:28:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 18:28:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-05-29 18:28:18] [INFO ] [Nat]Absence check using 9 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-29 18:28:18] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2025-05-29 18:28:18] [INFO ] [Nat]Added 42 Read/Feed constraints in 15 ms returned sat
[2025-05-29 18:28:18] [INFO ] Computed and/alt/rep : 183/1359/183 causal constraints (skipped 98 transitions) in 19 ms.
[2025-05-29 18:28:19] [INFO ] Added : 101 causal constraints over 21 iterations in 524 ms. Result :sat
Minimization took 173 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 184 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p1_2_12) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 287/287 transitions.
Applied a total of 0 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 184/184 places, 287/287 transitions.
// Phase 1: matrix 287 rows 184 cols
[2025-05-29 18:28:19] [INFO ] Computed 17 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1021 ms. (978 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 546 ms. (1828 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-29 18:28:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 18:28:20] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-29 18:28:20] [INFO ] [Real]Absence check using 9 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-29 18:28:21] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-05-29 18:28:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 18:28:21] [INFO ] [Real]Added 42 Read/Feed constraints in 16 ms returned sat
[2025-05-29 18:28:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 18:28:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-05-29 18:28:21] [INFO ] [Nat]Absence check using 9 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-29 18:28:21] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-05-29 18:28:21] [INFO ] [Nat]Added 42 Read/Feed constraints in 15 ms returned sat
[2025-05-29 18:28:21] [INFO ] Computed and/alt/rep : 182/1357/182 causal constraints (skipped 98 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:21] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 6 ms to minimize.
[2025-05-29 18:28:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2025-05-29 18:28:21] [INFO ] Added : 98 causal constraints over 20 iterations in 645 ms. Result :sat
Minimization took 159 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 287/287 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 184/184 places, 287/287 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 287/287 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2025-05-29 18:28:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:28:22] [INFO ] Implicit Places using invariants in 175 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/184 places, 287/287 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 183 transition count 238
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 134 transition count 238
Applied a total of 98 rules in 10 ms. Remains 134 /183 variables (removed 49) and now considering 238/287 (removed 49) transitions.
// Phase 1: matrix 238 rows 134 cols
[2025-05-29 18:28:22] [INFO ] Computed 16 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:28:22] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-29 18:28:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:28:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 18:28:22] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 134/184 places, 238/287 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 606 ms. Remains : 134/184 places, 238/287 transitions.
[2025-05-29 18:28:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (4 resets) in 867 ms. (1152 steps per ms)
FORMULA Anderson-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 443 ms. (2252 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-29 18:28:24] [INFO ] Flatten gal took : 46 ms
[2025-05-29 18:28:24] [INFO ] Flatten gal took : 18 ms
[2025-05-29 18:28:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10019953178932203023.gal : 12 ms
[2025-05-29 18:28:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1097077588887761719.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10019953178932203023.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1097077588887761719.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 15415 ms.

BK_STOP 1748543304222

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Anderson-PT-07"
export BK_EXAMINATION="UpperBounds"
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-5832"
echo " Executing tool itstools"
echo " Input is Anderson-PT-07, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853728700173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-07.tgz
mv Anderson-PT-07 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;