Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102800559.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 FlexibleBarrier-PT-22b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102800559
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.8M 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

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

=== Now, execution of the tool begins

BK_START 1748993681809

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-22b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-03 23:34:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 23:34:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 23:34:45] [INFO ] Load time of PNML (sax parser for PT used): 851 ms
[2025-06-03 23:34:45] [INFO ] Transformed 6478 places.
[2025-06-03 23:34:45] [INFO ] Transformed 7469 transitions.
[2025-06-03 23:34:45] [INFO ] Found NUPN structural information;
[2025-06-03 23:34:45] [INFO ] Parsed PT model containing 6478 places and 7469 transitions and 18797 arcs in 1198 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (273 resets) in 3394 ms. (11 steps per ms) remains 14/16 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (17 resets) in 364 ms. (109 steps per ms) remains 13/14 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (16 resets) in 276 ms. (144 steps per ms) remains 12/13 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 565 ms. (70 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (17 resets) in 340 ms. (117 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (19 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 215 ms. (185 steps per ms) remains 11/12 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (20 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1177 ms. (33 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (18 resets) in 339 ms. (117 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (18 resets) in 182 ms. (218 steps per ms) remains 10/11 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (17 resets) in 299 ms. (133 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 344 ms. (115 steps per ms) remains 10/10 properties
[2025-06-03 23:34:48] [INFO ] Flatten gal took : 982 ms
BEST_FIRST walk for 40004 steps (19 resets) in 445 ms. (89 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
// Phase 1: matrix 7469 rows 6478 cols
[2025-06-03 23:34:48] [INFO ] Flatten gal took : 342 ms
[2025-06-03 23:34:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9993395456906278298.gal : 199 ms
[2025-06-03 23:34:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14677073484630383042.prop : 3 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/ReachabilityCardinality9993395456906278298.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14677073484630383042.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
[2025-06-03 23:34:48] [INFO ] Computed 24 invariants in 511 ms
Excessive predecessor constraint size, skipping predecessor.
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/281 variables, 281/281 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality14677073484630383042.prop.
Problem FlexibleBarrier-PT-22b-ReachabilityFireability-2025-02 is UNSAT
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem FlexibleBarrier-PT-22b-ReachabilityFireability-2025-09 is UNSAT
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 6197/6478 variables, 24/305 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6478 variables, 6197/6502 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6478/13947 variables, and 6502 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5049 ms.
Refiners :[Domain max(s): 6478/6478 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 0/6478 constraints, PredecessorRefiner: 10/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem FlexibleBarrier-PT-22b-ReachabilityFireability-2025-08 is UNSAT
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 6280/6478 variables, 24/222 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6478 variables, 6280/6502 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:09] [INFO ] Deduced a trap composed of 385 places in 11397 ms of which 3466 ms to minimize.
SMT process timed out in 21090ms, After SMT, problems are : Problem set: 3 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 165 out of 6478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Graph (trivial) has 4833 edges and 6478 vertex of which 54 / 6478 are part of one of the 9 SCC in 23 ms
Free SCC test removed 45 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1070 transitions
Trivial Post-agglo rules discarded 1070 transitions
Performed 1070 trivial Post agglomeration. Transition count delta: 1070
Iterating post reduction 0 with 1070 rules applied. Total rules applied 1071 place count 6433 transition count 6345
Reduce places removed 1070 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 1095 rules applied. Total rules applied 2166 place count 5363 transition count 6320
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 2191 place count 5338 transition count 6320
Performed 859 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 859 Pre rules applied. Total rules applied 2191 place count 5338 transition count 5461
Deduced a syphon composed of 859 places in 11 ms
Reduce places removed 859 places and 0 transitions.
Iterating global reduction 3 with 1718 rules applied. Total rules applied 3909 place count 4479 transition count 5461
Discarding 2594 places :
Symmetric choice reduction at 3 with 2594 rule applications. Total rules 6503 place count 1885 transition count 2867
Iterating global reduction 3 with 2594 rules applied. Total rules applied 9097 place count 1885 transition count 2867
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 3 with 2 rules applied. Total rules applied 9099 place count 1885 transition count 2865
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 9100 place count 1884 transition count 2865
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 9100 place count 1884 transition count 2856
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 9118 place count 1875 transition count 2856
Discarding 383 places :
Symmetric choice reduction at 5 with 383 rule applications. Total rules 9501 place count 1492 transition count 2473
Iterating global reduction 5 with 383 rules applied. Total rules applied 9884 place count 1492 transition count 2473
Ensure Unique test removed 359 transitions
Reduce isomorphic transitions removed 359 transitions.
Iterating post reduction 5 with 359 rules applied. Total rules applied 10243 place count 1492 transition count 2114
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 2 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 6 with 304 rules applied. Total rules applied 10547 place count 1340 transition count 1962
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 10569 place count 1329 transition count 1962
Free-agglomeration rule applied 250 times.
Iterating global reduction 6 with 250 rules applied. Total rules applied 10819 place count 1329 transition count 1712
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 6 with 250 rules applied. Total rules applied 11069 place count 1079 transition count 1712
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 11085 place count 1063 transition count 1696
Iterating global reduction 7 with 16 rules applied. Total rules applied 11101 place count 1063 transition count 1696
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 11117 place count 1063 transition count 1680
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 11136 place count 1063 transition count 1661
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 11150 place count 1063 transition count 1661
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 11151 place count 1063 transition count 1661
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 11152 place count 1062 transition count 1660
Applied a total of 11152 rules in 2947 ms. Remains 1062 /6478 variables (removed 5416) and now considering 1660/7469 (removed 5809) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2962 ms. Remains : 1062/6478 places, 1660/7469 transitions.
RANDOM walk for 40000 steps (502 resets) in 1602 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (24 resets) in 238 ms. (167 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (25 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (27 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (26 resets) in 237 ms. (168 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (26 resets) in 264 ms. (150 steps per ms) remains 6/7 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (25 resets) in 317 ms. (125 steps per ms) remains 6/6 properties
[2025-06-03 23:35:13] [INFO ] Flow matrix only has 1633 transitions (discarded 27 similar events)
// Phase 1: matrix 1633 rows 1062 cols
[2025-06-03 23:35:13] [INFO ] Computed 24 invariants in 52 ms
[2025-06-03 23:35:13] [INFO ] State equation strengthened by 178 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/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 908/1062 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1633/2695 variables, 1062/1086 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2695 variables, 178/1264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2695 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/2695 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2695/2695 variables, and 1264 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1971 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 1062/1062 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 908/1062 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:17] [INFO ] Deduced a trap composed of 500 places in 1288 ms of which 357 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:18] [INFO ] Deduced a trap composed of 88 places in 1313 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:19] [INFO ] Deduced a trap composed of 18 places in 709 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:20] [INFO ] Deduced a trap composed of 501 places in 1471 ms of which 358 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:22] [INFO ] Deduced a trap composed of 502 places in 1322 ms of which 364 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:22] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:24] [INFO ] Deduced a trap composed of 502 places in 1691 ms of which 475 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:25] [INFO ] Deduced a trap composed of 502 places in 1714 ms of which 552 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:27] [INFO ] Deduced a trap composed of 503 places in 1326 ms of which 377 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:28] [INFO ] Deduced a trap composed of 504 places in 1297 ms of which 311 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
[2025-06-03 23:35:30] [INFO ] Deduced a trap composed of 506 places in 1766 ms of which 586 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
[2025-06-03 23:35:31] [INFO ] Deduced a trap composed of 500 places in 1130 ms of which 399 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 19
At refinement iteration 3 (INCLUDED_ONLY) 0/1062 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :19 after 74
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :74 after 2726
[2025-06-03 23:35:32] [INFO ] Deduced a trap composed of 123 places in 291 ms of which 46 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :2726 after 140681
At refinement iteration 4 (INCLUDED_ONLY) 0/1062 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :140681 after 3.80347e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/1062 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :3.80347e+08 after 3.74359e+14
At refinement iteration 6 (OVERLAPS) 1633/2695 variables, 1062/1099 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2695 variables, 178/1277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2695 variables, 2/1279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :3.74359e+14 after 5.49812e+25
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :5.49812e+25 after 5.97856e+37
[2025-06-03 23:35:35] [INFO ] Deduced a trap composed of 505 places in 1252 ms of which 346 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:35] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2695 variables, 2/1281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2695 variables, 0/1281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:39] [INFO ] Deduced a trap composed of 504 places in 1313 ms of which 305 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/2695 variables, 1/1282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2695 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2695 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2695/2695 variables, and 1282 constraints, problems are : Problem set: 0 solved, 6 unsolved in 26323 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 1062/1062 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28389ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 1778 ms.
Support contains 99 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1660/1660 transitions.
Graph (trivial) has 205 edges and 1062 vertex of which 11 / 1062 are part of one of the 5 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 1056 transition count 1631
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 1038 transition count 1631
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 37 place count 1038 transition count 1624
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 1031 transition count 1624
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 78 place count 1004 transition count 1597
Iterating global reduction 2 with 27 rules applied. Total rules applied 105 place count 1004 transition count 1597
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 1004 transition count 1594
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 1002 transition count 1592
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 1002 transition count 1592
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 1002 transition count 1590
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 166 place count 976 transition count 1564
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 172 place count 976 transition count 1558
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 191 place count 957 transition count 1539
Iterating global reduction 5 with 19 rules applied. Total rules applied 210 place count 957 transition count 1539
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 229 place count 957 transition count 1520
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 233 place count 957 transition count 1516
Free-agglomeration rule applied 113 times.
Iterating global reduction 6 with 113 rules applied. Total rules applied 346 place count 957 transition count 1403
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 114 rules applied. Total rules applied 460 place count 844 transition count 1402
Discarding 37 places :
Symmetric choice reduction at 7 with 37 rule applications. Total rules 497 place count 807 transition count 1365
Iterating global reduction 7 with 37 rules applied. Total rules applied 534 place count 807 transition count 1365
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 7 with 37 rules applied. Total rules applied 571 place count 807 transition count 1328
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 572 place count 807 transition count 1327
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 573 place count 807 transition count 1327
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 574 place count 806 transition count 1326
Applied a total of 574 rules in 915 ms. Remains 806 /1062 variables (removed 256) and now considering 1326/1660 (removed 334) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 916 ms. Remains : 806/1062 places, 1326/1660 transitions.
RANDOM walk for 40000 steps (314 resets) in 527 ms. (75 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 311 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (22 resets) in 490 ms. (81 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 174582 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 174582 steps, saw 54035 distinct states, run finished after 3010 ms. (steps per millisecond=58 ) properties seen :0
[2025-06-03 23:35:47] [INFO ] Flow matrix only has 1293 transitions (discarded 33 similar events)
// Phase 1: matrix 1293 rows 806 cols
[2025-06-03 23:35:47] [INFO ] Computed 24 invariants in 34 ms
[2025-06-03 23:35:47] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 695/794 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/794 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1293/2087 variables, 794/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2087 variables, 31/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2087 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 12/2099 variables, 12/859 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2099 variables, 2/861 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2099 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2099 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2099/2099 variables, and 861 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1114 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 806/806 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 695/794 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:50] [INFO ] Deduced a trap composed of 418 places in 910 ms of which 218 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:50] [INFO ] Deduced a trap composed of 419 places in 804 ms of which 201 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:35:51] [INFO ] Deduced a trap composed of 419 places in 779 ms of which 194 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/794 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/794 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1293/2087 variables, 794/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2087 variables, 31/850 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2087 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/2099 variables, 12/862 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2099 variables, 2/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2099 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2099 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2099/2099 variables, and 864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4033 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 806/806 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5201ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-13 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 6904 steps, including 143 resets, run visited all 1 properties in 75 ms. (steps per millisecond=92 )
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2025-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 155 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 68797 ms.

BK_STOP 1748993753197

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-22b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102800559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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