Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254400637.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 PolyORBNT-PT-S05J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254400637
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 164K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 232K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 31K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 PolyORBNT-PT-S05J20-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749082645804

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-05 00:17:26] [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-06-05 00:17:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 00:17:27] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2025-06-05 00:17:27] [INFO ] Transformed 349 places.
[2025-06-05 00:17:27] [INFO ] Transformed 1210 transitions.
[2025-06-05 00:17:27] [INFO ] Parsed PT model containing 349 places and 1210 transitions and 8824 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-05 00:17:27] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2025-06-05 00:17:27] [INFO ] Computed 62 invariants in 57 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[70, 32, 384, 1, 1, 27, 64, 79, 21, 128, 1, 32, 21, 4, 1, 96]
RANDOM walk for 10000 steps (675 resets) in 86 ms. (114 steps per ms)
FORMULA PolyORBNT-PT-S05J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120010 steps (1930 resets) in 301 ms. (397 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 3, 1, 2, 1, 1, 3, 1, 1, 1, 3] Max Struct:[70, 32, 384, 27, 64, 79, 21, 128, 32, 21, 4, 96]
[2025-06-05 00:17:27] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
[2025-06-05 00:17:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive place invariants in 33 ms returned sat
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 13 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive place invariants in 27 ms returned sat
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 20 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 10 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 9 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive place invariants in 9 ms returned sat
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 9 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive place invariants in 9 ms returned sat
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 12 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive place invariants in 9 ms returned sat
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 14 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 11 ms returned sat
[2025-06-05 00:17:28] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2025-06-05 00:17:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:29] [INFO ] [Nat]Absence check using 42 positive place invariants in 17 ms returned sat
[2025-06-05 00:17:29] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 12 ms returned sat
[2025-06-05 00:17:29] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2025-06-05 00:17:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:17:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 64 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:29] [INFO ] Deduced a trap composed of 100 places in 211 ms of which 39 ms to minimize.
[2025-06-05 00:17:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2025-06-05 00:17:29] [INFO ] Computed and/alt/rep : 349/889/349 causal constraints (skipped 196 transitions) in 48 ms.
[2025-06-05 00:17:30] [INFO ] Added : 15 causal constraints over 3 iterations in 306 ms. Result :sat
Minimization took 505 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:30] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2025-06-05 00:17:30] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 8 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:30] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2025-06-05 00:17:30] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 4 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:30] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2025-06-05 00:17:30] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 12 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 00:17:30] [INFO ] [Real]Absence check using 42 positive place invariants in 9 ms returned sat
[2025-06-05 00:17:30] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 3, 1, 2, 1, 1, 3, 1, 1, 1, 3] Max Struct:[1, 1, 3, 1, 2, 1, 1, 128, 1, 1, 1, 3]
FORMULA PolyORBNT-PT-S05J20-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[128]
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 504
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 292 transition count 503
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 292 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 290 transition count 501
Applied a total of 113 rules in 205 ms. Remains 290 /349 variables (removed 59) and now considering 501/555 (removed 54) transitions.
Running 495 sub problems to find dead transitions.
[2025-06-05 00:17:31] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2025-06-05 00:17:31] [INFO ] Computed 57 invariants in 11 ms
[2025-06-05 00:17:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/290 variables, 5/57 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/57 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 497/787 variables, 290/347 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/787 variables, 1/348 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/787 variables, 0/348 constraints. Problems are: Problem set: 95 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 787/787 variables, and 348 constraints, problems are : Problem set: 95 solved, 400 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 400 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 42/42 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 10/52 constraints. Problems are: Problem set: 95 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:52] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:52] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:52] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 3/55 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 5/290 variables, 5/60 constraints. Problems are: Problem set: 95 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:08] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 23 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 1/61 constraints. Problems are: Problem set: 95 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/787 variables, and 61 constraints, problems are : Problem set: 95 solved, 400 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/290 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/495 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40695ms problems are : Problem set: 95 solved, 400 unsolved
Search for dead transitions found 95 dead transitions in 40720ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 290/349 places, 406/555 transitions.
Applied a total of 0 rules in 21 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40961 ms. Remains : 290/349 places, 406/555 transitions.
[2025-06-05 00:18:11] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2025-06-05 00:18:11] [INFO ] Computed 57 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (52153 resets) in 3024 ms. (330 steps per ms)
BEST_FIRST walk for 1000000 steps (7279 resets) in 908 ms. (1100 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2025-06-05 00:18:15] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-05 00:18:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 00:18:15] [INFO ] [Real]Absence check using 43 positive place invariants in 8 ms returned sat
[2025-06-05 00:18:15] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 10 ms returned sat
[2025-06-05 00:18:16] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2025-06-05 00:18:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 00:18:16] [INFO ] [Nat]Absence check using 43 positive place invariants in 9 ms returned sat
[2025-06-05 00:18:16] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 7 ms returned sat
[2025-06-05 00:18:16] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2025-06-05 00:18:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:18:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:16] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:16] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:16] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:18] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 14 ms to minimize.
[2025-06-05 00:18:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1653 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[3]
FORMULA PolyORBNT-PT-S05J20-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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-06-05 00:18:18] [INFO ] Flatten gal took : 72 ms
[2025-06-05 00:18:18] [INFO ] Flatten gal took : 34 ms
[2025-06-05 00:18:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13839527654262956379.gal : 21 ms
[2025-06-05 00:18:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality643141415588592151.prop : 1 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/ReachabilityCardinality13839527654262956379.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality643141415588592151.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 51476 ms.

BK_STOP 1749082698515

--------------------
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="PolyORBNT-PT-S05J20"
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 PolyORBNT-PT-S05J20, 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 r156-tall-174881254400637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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