Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r147-tall-174876819300123.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 NoC3x3-PT-3B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-174876819300123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 581K 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748809452623

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-3B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-06-01 20:24:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-01 20:24:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 20:24:14] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2025-06-01 20:24:14] [INFO ] Transformed 2117 places.
[2025-06-01 20:24:14] [INFO ] Transformed 2435 transitions.
[2025-06-01 20:24:14] [INFO ] Found NUPN structural information;
[2025-06-01 20:24:14] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 262 ms.
Graph (trivial) has 1749 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 20 ms
Free SCC test removed 63 places
Structural test allowed to assert that 340 places are NOT stable. Took 48 ms.
Ensure Unique test removed 63 transitions
Reduce redundant transitions removed 63 transitions.
[2025-06-01 20:24:15] [INFO ] Flatten gal took : 363 ms
[2025-06-01 20:24:15] [INFO ] Flatten gal took : 233 ms
[2025-06-01 20:24:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6394708126305623990.gal : 132 ms
[2025-06-01 20:24:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12310577593643498386.prop : 28 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/ReachabilityCardinality6394708126305623990.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12310577593643498386.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
RANDOM walk for 40000 steps (99 resets) in 5104 ms. (7 steps per ms) remains 230/1777 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 230/230 properties
BEST_FIRST walk for 401 steps (8 resets) in 18 ms. (21 steps per ms) remains 230/230 properties
Loading property file /tmp/ReachabilityCardinality12310577593643498386.prop.
BEST_FIRST walk for 403 steps (8 resets) in 36 ms. (10 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 37 ms. (10 steps per ms) remains 230/230 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 230/230 properties
BEST_FIRST walk for 402 steps (8 resets) in 21 ms. (18 steps per ms) remains 230/230 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 49 ms. (8 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 230/230 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 402 steps (8 resets) in 25 ms. (15 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 26 ms. (14 steps per ms) remains 230/230 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 230/230 properties
[2025-06-01 20:24:16] [INFO ] Flow matrix only has 2364 transitions (discarded 8 similar events)
// Phase 1: matrix 2364 rows 2054 cols
[2025-06-01 20:24:16] [INFO ] Computed 66 invariants in 37 ms
[2025-06-01 20:24:16] [INFO ] State equation strengthened by 1 read => feed constraints.
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/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1063/1293 variables, 33/263 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1293 variables, 1063/1326 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1293/4418 variables, and 1326 constraints, problems are : Problem set: 0 solved, 230 unsolved in 5065 ms.
Refiners :[Domain max(s): 1293/2054 constraints, Positive P Invariants (semi-flows): 33/66 constraints, State Equation: 0/2054 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1063/1293 variables, 33/263 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1293 variables, 1063/1326 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:25] [INFO ] Deduced a trap composed of 32 places in 457 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1777 properties remain. new max is 4
SDD size :1 after 5
[2025-06-01 20:24:25] [INFO ] Deduced a trap composed of 32 places in 437 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:26] [INFO ] Deduced a trap composed of 34 places in 394 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:26] [INFO ] Deduced a trap composed of 40 places in 496 ms of which 62 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1293/4418 variables, and 1330 constraints, problems are : Problem set: 0 solved, 230 unsolved in 5017 ms.
Refiners :[Domain max(s): 1293/2054 constraints, Positive P Invariants (semi-flows): 33/66 constraints, State Equation: 0/2054 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/230 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10303ms problems are : Problem set: 0 solved, 230 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 230 out of 2054 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2054/2054 places, 2372/2372 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 371 transitions
Trivial Post-agglo rules discarded 371 transitions
Performed 371 trivial Post agglomeration. Transition count delta: 371
Iterating post reduction 0 with 385 rules applied. Total rules applied 385 place count 2049 transition count 1992
Reduce places removed 371 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 375 rules applied. Total rules applied 760 place count 1678 transition count 1988
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 762 place count 1676 transition count 1988
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 762 place count 1676 transition count 1964
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 810 place count 1652 transition count 1964
Discarding 286 places :
Symmetric choice reduction at 3 with 286 rule applications. Total rules 1096 place count 1366 transition count 1678
Iterating global reduction 3 with 286 rules applied. Total rules applied 1382 place count 1366 transition count 1678
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 1382 place count 1366 transition count 1663
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1412 place count 1351 transition count 1663
Discarding 105 places :
Symmetric choice reduction at 3 with 105 rule applications. Total rules 1517 place count 1246 transition count 1558
Iterating global reduction 3 with 105 rules applied. Total rules applied 1622 place count 1246 transition count 1558
Discarding 108 places :
Symmetric choice reduction at 3 with 108 rule applications. Total rules 1730 place count 1138 transition count 1437
Iterating global reduction 3 with 108 rules applied. Total rules applied 1838 place count 1138 transition count 1437
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1869 place count 1107 transition count 1380
Iterating global reduction 3 with 31 rules applied. Total rules applied 1900 place count 1107 transition count 1380
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 17 rules applied. Total rules applied 1917 place count 1105 transition count 1365
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1919 place count 1103 transition count 1365
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1937 place count 1085 transition count 1347
Iterating global reduction 5 with 18 rules applied. Total rules applied 1955 place count 1085 transition count 1347
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1964 place count 1076 transition count 1329
Iterating global reduction 5 with 9 rules applied. Total rules applied 1973 place count 1076 transition count 1329
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1982 place count 1067 transition count 1320
Iterating global reduction 5 with 9 rules applied. Total rules applied 1991 place count 1067 transition count 1320
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 11 rules applied. Total rules applied 2002 place count 1066 transition count 1310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2003 place count 1065 transition count 1310
Performed 302 Post agglomeration using F-continuation condition.Transition count delta: 302
Deduced a syphon composed of 302 places in 1 ms
Reduce places removed 302 places and 0 transitions.
Iterating global reduction 7 with 604 rules applied. Total rules applied 2607 place count 763 transition count 1008
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 2620 place count 750 transition count 995
Iterating global reduction 7 with 13 rules applied. Total rules applied 2633 place count 750 transition count 995
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2637 place count 746 transition count 987
Iterating global reduction 7 with 4 rules applied. Total rules applied 2641 place count 746 transition count 987
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2642 place count 746 transition count 986
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2643 place count 745 transition count 981
Iterating global reduction 8 with 1 rules applied. Total rules applied 2644 place count 745 transition count 981
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -133
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 52 rules applied. Total rules applied 2696 place count 719 transition count 1114
Free-agglomeration rule applied 40 times.
Iterating global reduction 8 with 40 rules applied. Total rules applied 2736 place count 719 transition count 1074
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 50 rules applied. Total rules applied 2786 place count 679 transition count 1064
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2788 place count 679 transition count 1062
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2792 place count 679 transition count 1058
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2796 place count 675 transition count 1058
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 2811 place count 675 transition count 1058
Partial Post-agglomeration rule applied 14 times.
Drop transitions (Partial Post agglomeration) removed 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 2825 place count 675 transition count 1058
Applied a total of 2825 rules in 1163 ms. Remains 675 /2054 variables (removed 1379) and now considering 1058/2372 (removed 1314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1169 ms. Remains : 675/2054 places, 1058/2372 transitions.
SDD proceeding with computation,1777 properties remain. new max is 8
SDD size :5 after 10
RANDOM walk for 4000000 steps (54285 resets) in 49940 ms. (80 steps per ms) remains 3/230 properties
BEST_FIRST walk for 4000002 steps (3072 resets) in 7072 ms. (565 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (3062 resets) in 6901 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (3054 resets) in 6953 ms. (575 steps per ms) remains 3/3 properties
[2025-06-01 20:24:46] [INFO ] Flow matrix only has 1056 transitions (discarded 2 similar events)
// Phase 1: matrix 1056 rows 675 cols
[2025-06-01 20:24:46] [INFO ] Computed 59 invariants in 10 ms
[2025-06-01 20:24:46] [INFO ] State equation strengthened by 85 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 590/635 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1037/1672 variables, 635/694 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1672 variables, 72/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1672 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 59/1731 variables, 40/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1731 variables, 13/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1731 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1731 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1731/1731 variables, and 819 constraints, problems are : Problem set: 0 solved, 3 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 675/675 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 3/3 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 590/635 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:46] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:47] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:47] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:47] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:47] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:47] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:47] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:47] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:48] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:48] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:48] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 11 ms to minimize.
SDD proceeding with computation,1777 properties remain. new max is 16
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :10 after 19
[2025-06-01 20:24:48] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:48] [INFO ] Deduced a trap composed of 47 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-01 20:24:48] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:24:48] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem smplace_372 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 3018ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 1058/1058 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 675 transition count 986
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 74 rules applied. Total rules applied 146 place count 603 transition count 984
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 147 place count 602 transition count 984
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 147 place count 602 transition count 970
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 175 place count 588 transition count 970
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 209 place count 554 transition count 933
Iterating global reduction 3 with 34 rules applied. Total rules applied 243 place count 554 transition count 933
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 243 place count 554 transition count 931
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 247 place count 552 transition count 931
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 259 place count 540 transition count 919
Iterating global reduction 3 with 12 rules applied. Total rules applied 271 place count 540 transition count 919
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 277 place count 534 transition count 907
Iterating global reduction 3 with 6 rules applied. Total rules applied 283 place count 534 transition count 907
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 284 place count 534 transition count 906
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 288 place count 530 transition count 902
Iterating global reduction 4 with 4 rules applied. Total rules applied 292 place count 530 transition count 902
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 293 place count 530 transition count 901
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 421 place count 466 transition count 837
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 467 place count 420 transition count 653
Iterating global reduction 5 with 46 rules applied. Total rules applied 513 place count 420 transition count 653
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 525 place count 408 transition count 628
Iterating global reduction 5 with 12 rules applied. Total rules applied 537 place count 408 transition count 628
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 544 place count 408 transition count 621
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 547 place count 405 transition count 616
Iterating global reduction 6 with 3 rules applied. Total rules applied 550 place count 405 transition count 616
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 555 place count 404 transition count 612
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 556 place count 403 transition count 612
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 560 place count 401 transition count 613
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 561 place count 400 transition count 609
Iterating global reduction 8 with 1 rules applied. Total rules applied 562 place count 400 transition count 609
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 563 place count 400 transition count 608
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 565 place count 400 transition count 606
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 567 place count 398 transition count 606
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 568 place count 398 transition count 605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 569 place count 397 transition count 605
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 572 place count 397 transition count 605
Applied a total of 572 rules in 199 ms. Remains 397 /675 variables (removed 278) and now considering 605/1058 (removed 453) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 397/675 places, 605/1058 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 35346 ms.

BK_STOP 1748809489705

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

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="NoC3x3-PT-3B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 NoC3x3-PT-3B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r147-tall-174876819300123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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