Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339300134.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 Champagne-PT-H09T1U, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339300134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 6.2K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 13:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 6 13:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 13:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 13:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 8.3K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 13:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 13:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 314K Jun 5 20:08 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749331558979

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H09T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-07 21:26:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 21:26:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 21:26:00] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2025-06-07 21:26:00] [INFO ] Transformed 1273 places.
[2025-06-07 21:26:00] [INFO ] Transformed 1915 transitions.
[2025-06-07 21:26:00] [INFO ] Found NUPN structural information;
[2025-06-07 21:26:00] [INFO ] Parsed PT model containing 1273 places and 1915 transitions and 5106 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (40 resets) in 1609 ms. (24 steps per ms) remains 3/10 properties
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 21:26:01] [INFO ] Flatten gal took : 172 ms
BEST_FIRST walk for 40004 steps (8 resets) in 500 ms. (79 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
[2025-06-07 21:26:01] [INFO ] Flatten gal took : 97 ms
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 3/3 properties
[2025-06-07 21:26:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11629689265458701111.gal : 81 ms
[2025-06-07 21:26:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6647744342689686970.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/ReachabilityCardinality11629689265458701111.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6647744342689686970.prop' '--nowitness' '--gen-order' 'FOLLOW'

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
// Phase 1: matrix 1915 rows 1273 cols
[2025-06-07 21:26:01] [INFO ] Computed 49 invariants in 33 ms
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality6647744342689686970.prop.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 744/797 variables, 30/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/797 variables, 744/827 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/797 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 476/1273 variables, 19/846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1273 variables, 476/1322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1273 variables, 0/1322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 8 (OVERLAPS) 1915/3188 variables, 1273/2595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :13 after 102
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :102 after 4097
At refinement iteration 9 (INCLUDED_ONLY) 0/3188 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/3188 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3188/3188 variables, and 2595 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1479 ms.
Refiners :[Domain max(s): 1273/1273 constraints, Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1273/1273 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 744/797 variables, 30/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/797 variables, 744/827 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:03] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:03] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:03] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:03] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:03] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:03] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:03] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:04] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:04] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:04] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:04] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:04] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:04] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:04] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:04] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:04] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:04] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/797 variables, 17/844 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:05] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/797 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:05] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:05] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 2/847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 476/1273 variables, 19/866 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1273 variables, 476/1342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:05] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:06] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 14 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :4097 after 413344
At refinement iteration 10 (INCLUDED_ONLY) 0/1273 variables, 2/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:06] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 15 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 256
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :413344 after 1.15274e+06
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.15274e+06 after 1.15354e+06
[2025-06-07 21:26:06] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 18 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.15354e+06 after 1.15557e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.15557e+06 after 1.1585e+06
[2025-06-07 21:26:06] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.1585e+06 after 1.17542e+06
[2025-06-07 21:26:06] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:06] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 12 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.17542e+06 after 1.20765e+06
At refinement iteration 11 (INCLUDED_ONLY) 0/1273 variables, 5/1349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:07] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:07] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 6 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.20765e+06 after 1.33168e+06
At refinement iteration 12 (INCLUDED_ONLY) 0/1273 variables, 2/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1273 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 6627ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 53 out of 1273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1273/1273 places, 1915/1915 transitions.
Graph (trivial) has 1190 edges and 1273 vertex of which 310 / 1273 are part of one of the 34 SCC in 9 ms
Free SCC test removed 276 places
Drop transitions (Empty/Sink Transition effects.) removed 335 transitions
Reduce isomorphic transitions removed 335 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 408 place count 997 transition count 1173
Reduce places removed 407 places and 0 transitions.
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 485 rules applied. Total rules applied 893 place count 590 transition count 1095
Reduce places removed 39 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 69 rules applied. Total rules applied 962 place count 551 transition count 1065
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 33 rules applied. Total rules applied 995 place count 521 transition count 1062
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 996 place count 520 transition count 1062
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 996 place count 520 transition count 1053
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 1014 place count 511 transition count 1053
Discarding 147 places :
Symmetric choice reduction at 5 with 147 rule applications. Total rules 1161 place count 364 transition count 906
Iterating global reduction 5 with 147 rules applied. Total rules applied 1308 place count 364 transition count 906
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 1308 place count 364 transition count 882
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 1356 place count 340 transition count 882
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1375 place count 321 transition count 726
Iterating global reduction 5 with 19 rules applied. Total rules applied 1394 place count 321 transition count 726
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1413 place count 321 transition count 707
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 6 with 154 rules applied. Total rules applied 1567 place count 244 transition count 630
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1585 place count 235 transition count 682
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 6 with 38 rules applied. Total rules applied 1623 place count 235 transition count 644
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1625 place count 233 transition count 634
Iterating global reduction 7 with 2 rules applied. Total rules applied 1627 place count 233 transition count 634
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 1632 place count 233 transition count 629
Free-agglomeration rule applied 87 times.
Iterating global reduction 7 with 87 rules applied. Total rules applied 1719 place count 233 transition count 542
Reduce places removed 87 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Iterating post reduction 7 with 320 rules applied. Total rules applied 2039 place count 146 transition count 309
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 2044 place count 146 transition count 309
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2045 place count 145 transition count 308
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 8 with 52 rules applied. Total rules applied 2097 place count 130 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 9 with 60 rules applied. Total rules applied 2157 place count 130 transition count 211
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 2162 place count 130 transition count 206
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2167 place count 125 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2169 place count 125 transition count 204
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 2176 place count 125 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 2177 place count 125 transition count 203
Applied a total of 2177 rules in 319 ms. Remains 125 /1273 variables (removed 1148) and now considering 203/1915 (removed 1712) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 125/1273 places, 203/1915 transitions.
SDD proceeding with computation,3 properties remain. new max is 32768
RANDOM walk for 40000 steps (8 resets) in 492 ms. (81 steps per ms) remains 1/3 properties
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD size :1.33168e+06 after 1.80019e+06
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2025-06-07 21:26:08] [INFO ] Flow matrix only has 152 transitions (discarded 51 similar events)
// Phase 1: matrix 152 rows 125 cols
[2025-06-07 21:26:08] [INFO ] Computed 34 invariants in 1 ms
[2025-06-07 21:26:08] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/40 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/66 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:08] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:08] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/79 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 78/157 variables, 50/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/157 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 15/172 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/172 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/175 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/175 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/175 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/197 variables, 18/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/197 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/197 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/198 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/198 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/198 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 13/211 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/211 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 5/216 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/216 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/216 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1/217 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/217 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 2/219 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/219 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 1/220 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/220 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 3/223 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/223 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 1/224 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/224 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/224 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/224 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/277 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 26/34 constraints, State Equation: 100/125 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/40 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/66 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/79 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:09] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 78/157 variables, 50/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/157 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:09] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:09] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/157 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/157 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 15/172 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/172 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/172 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/172 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/175 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/175 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:09] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 27 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/175 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/175 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 22/197 variables, 18/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/197 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/197 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/198 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/198 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/198 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 13/211 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/211 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 5/216 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/216 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/216 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 1/217 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/217 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 2/219 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:09] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/219 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/219 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 1/220 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/220 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 3/223 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/223 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 1/224 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/224 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 8/232 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/232 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 17/249 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/249 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 28/277 variables, 25/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/277 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 0/277 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 125/125 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1477ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2025-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 4 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 9841 ms.

BK_STOP 1749331570033

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="Champagne-PT-H09T1U"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H09T1U, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339300134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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