Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640602700127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is FlexibleBarrier-PT-18b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602700127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717183774205

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:29:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:29:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:29:35] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2024-05-31 19:29:35] [INFO ] Transformed 4370 places.
[2024-05-31 19:29:35] [INFO ] Transformed 5037 transitions.
[2024-05-31 19:29:35] [INFO ] Found NUPN structural information;
[2024-05-31 19:29:35] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (327 resets) in 1784 ms. (22 steps per ms) remains 14/16 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (24 resets) in 288 ms. (138 steps per ms) remains 13/14 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (26 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (25 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (25 resets) in 221 ms. (180 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (22 resets) in 706 ms. (56 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (26 resets) in 889 ms. (44 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (22 resets) in 50 ms. (784 steps per ms) remains 12/13 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (21 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (25 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (21 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (24 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (24 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (25 resets) in 38 ms. (1025 steps per ms) remains 12/12 properties
// Phase 1: matrix 5037 rows 4370 cols
[2024-05-31 19:29:37] [INFO ] Computed 20 invariants in 132 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem FlexibleBarrier-PT-18b-ReachabilityFireability-2024-07 is UNSAT
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 4221/4370 variables, 20/169 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4370 variables, 4221/4390 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4370 variables, 0/4390 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 5037/9407 variables, 4370/8760 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9407/9407 variables, and 8760 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5047 ms.
Refiners :[Domain max(s): 4370/4370 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 4370/4370 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 4239/4370 variables, 20/151 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4370 variables, 4239/4390 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-31 19:29:46] [INFO ] Deduced a trap composed of 1622 places in 2562 ms of which 168 ms to minimize.
[2024-05-31 19:29:48] [INFO ] Deduced a trap composed of 1506 places in 2385 ms of which 20 ms to minimize.
SMT process timed out in 11586ms, After SMT, problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 131 out of 4370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 3216 edges and 4370 vertex of which 42 / 4370 are part of one of the 7 SCC in 12 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 750 transitions
Trivial Post-agglo rules discarded 750 transitions
Performed 750 trivial Post agglomeration. Transition count delta: 750
Iterating post reduction 0 with 750 rules applied. Total rules applied 751 place count 4335 transition count 4245
Reduce places removed 750 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 763 rules applied. Total rules applied 1514 place count 3585 transition count 4232
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1527 place count 3572 transition count 4232
Performed 559 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 559 Pre rules applied. Total rules applied 1527 place count 3572 transition count 3673
Deduced a syphon composed of 559 places in 4 ms
Reduce places removed 559 places and 0 transitions.
Iterating global reduction 3 with 1118 rules applied. Total rules applied 2645 place count 3013 transition count 3673
Discarding 1699 places :
Symmetric choice reduction at 3 with 1699 rule applications. Total rules 4344 place count 1314 transition count 1974
Iterating global reduction 3 with 1699 rules applied. Total rules applied 6043 place count 1314 transition count 1974
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 6045 place count 1314 transition count 1972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6046 place count 1313 transition count 1972
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 6046 place count 1313 transition count 1969
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 6052 place count 1310 transition count 1969
Discarding 241 places :
Symmetric choice reduction at 5 with 241 rule applications. Total rules 6293 place count 1069 transition count 1728
Iterating global reduction 5 with 241 rules applied. Total rules applied 6534 place count 1069 transition count 1728
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Iterating post reduction 5 with 224 rules applied. Total rules applied 6758 place count 1069 transition count 1504
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 6 with 258 rules applied. Total rules applied 7016 place count 940 transition count 1375
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 7036 place count 930 transition count 1375
Free-agglomeration rule applied 171 times.
Iterating global reduction 6 with 171 rules applied. Total rules applied 7207 place count 930 transition count 1204
Reduce places removed 171 places and 0 transitions.
Iterating post reduction 6 with 171 rules applied. Total rules applied 7378 place count 759 transition count 1204
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 7384 place count 753 transition count 1198
Iterating global reduction 7 with 6 rules applied. Total rules applied 7390 place count 753 transition count 1198
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 7396 place count 753 transition count 1192
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 7415 place count 753 transition count 1173
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 7425 place count 753 transition count 1173
Applied a total of 7425 rules in 1033 ms. Remains 753 /4370 variables (removed 3617) and now considering 1173/5037 (removed 3864) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1042 ms. Remains : 753/4370 places, 1173/5037 transitions.
RANDOM walk for 40000 steps (322 resets) in 713 ms. (56 steps per ms) remains 8/11 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (29 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (30 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (30 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 134 ms. (296 steps per ms) remains 6/8 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (30 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 96 ms. (412 steps per ms) remains 5/6 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-31 19:29:50] [INFO ] Flow matrix only has 1150 transitions (discarded 23 similar events)
// Phase 1: matrix 1150 rows 753 cols
[2024-05-31 19:29:50] [INFO ] Computed 20 invariants in 20 ms
[2024-05-31 19:29:50] [INFO ] State equation strengthened by 164 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 684/753 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/753 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1150/1903 variables, 753/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1903 variables, 164/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1903 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/1903 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1903/1903 variables, and 937 constraints, problems are : Problem set: 0 solved, 5 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 753/753 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 684/753 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:29:51] [INFO ] Deduced a trap composed of 333 places in 224 ms of which 5 ms to minimize.
[2024-05-31 19:29:51] [INFO ] Deduced a trap composed of 355 places in 232 ms of which 4 ms to minimize.
Problem FlexibleBarrier-PT-18b-ReachabilityFireability-2024-09 is UNSAT
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-31 19:29:52] [INFO ] Deduced a trap composed of 335 places in 248 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/753 variables, 3/23 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1150/1903 variables, 753/776 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1903 variables, 164/940 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 4/944 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/944 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1903 variables, 0/944 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1903/1903 variables, and 944 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2657 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 753/753 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 3497ms problems are : Problem set: 1 solved, 4 unsolved
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 575 ms.
Support contains 55 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 1173/1173 transitions.
Graph (trivial) has 195 edges and 753 vertex of which 14 / 753 are part of one of the 6 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 745 transition count 1146
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 732 transition count 1146
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 27 place count 732 transition count 1137
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 45 place count 723 transition count 1137
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 88 place count 680 transition count 1094
Iterating global reduction 2 with 43 rules applied. Total rules applied 131 place count 680 transition count 1094
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 140 place count 680 transition count 1085
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 142 place count 678 transition count 1083
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 678 transition count 1083
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 146 place count 678 transition count 1081
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 190 place count 656 transition count 1059
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 194 place count 656 transition count 1055
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 212 place count 638 transition count 1037
Iterating global reduction 5 with 18 rules applied. Total rules applied 230 place count 638 transition count 1037
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 248 place count 638 transition count 1019
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 253 place count 638 transition count 1014
Free-agglomeration rule applied 98 times.
Iterating global reduction 6 with 98 rules applied. Total rules applied 351 place count 638 transition count 916
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 6 with 98 rules applied. Total rules applied 449 place count 540 transition count 916
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 464 place count 525 transition count 901
Iterating global reduction 7 with 15 rules applied. Total rules applied 479 place count 525 transition count 901
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 494 place count 525 transition count 886
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 500 place count 525 transition count 880
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 502 place count 525 transition count 880
Applied a total of 502 rules in 299 ms. Remains 525 /753 variables (removed 228) and now considering 880/1173 (removed 293) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 525/753 places, 880/1173 transitions.
RANDOM walk for 40000 steps (377 resets) in 400 ms. (99 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (39 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (39 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 396912 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 2
Probabilistic random walk after 396912 steps, saw 102811 distinct states, run finished after 3004 ms. (steps per millisecond=132 ) properties seen :0
[2024-05-31 19:29:58] [INFO ] Flow matrix only has 851 transitions (discarded 29 similar events)
// Phase 1: matrix 851 rows 525 cols
[2024-05-31 19:29:58] [INFO ] Computed 20 invariants in 10 ms
[2024-05-31 19:29:58] [INFO ] State equation strengthened by 227 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 470/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 851/1376 variables, 525/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1376 variables, 227/772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1376 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1376 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1376/1376 variables, and 772 constraints, problems are : Problem set: 0 solved, 2 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 525/525 constraints, ReadFeed: 227/227 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 470/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:29:58] [INFO ] Deduced a trap composed of 279 places in 154 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 851/1376 variables, 525/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1376 variables, 227/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1376 variables, 2/775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1376 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1376 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1376/1376 variables, and 775 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1002 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 525/525 constraints, ReadFeed: 227/227 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1499ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 249 ms.
Support contains 55 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 880/880 transitions.
Applied a total of 0 rules in 21 ms. Remains 525 /525 variables (removed 0) and now considering 880/880 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 525/525 places, 880/880 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 880/880 transitions.
Applied a total of 0 rules in 29 ms. Remains 525 /525 variables (removed 0) and now considering 880/880 (removed 0) transitions.
[2024-05-31 19:29:59] [INFO ] Flow matrix only has 851 transitions (discarded 29 similar events)
[2024-05-31 19:29:59] [INFO ] Invariant cache hit.
[2024-05-31 19:30:00] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-31 19:30:00] [INFO ] Flow matrix only has 851 transitions (discarded 29 similar events)
[2024-05-31 19:30:00] [INFO ] Invariant cache hit.
[2024-05-31 19:30:00] [INFO ] State equation strengthened by 227 read => feed constraints.
[2024-05-31 19:30:01] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1356 ms to find 0 implicit places.
[2024-05-31 19:30:01] [INFO ] Redundant transitions in 50 ms returned []
Running 879 sub problems to find dead transitions.
[2024-05-31 19:30:01] [INFO ] Flow matrix only has 851 transitions (discarded 29 similar events)
[2024-05-31 19:30:01] [INFO ] Invariant cache hit.
[2024-05-31 19:30:01] [INFO ] State equation strengthened by 227 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (OVERLAPS) 1/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 879 unsolved
[2024-05-31 19:30:16] [INFO ] Deduced a trap composed of 277 places in 172 ms of which 2 ms to minimize.
[2024-05-31 19:30:17] [INFO ] Deduced a trap composed of 279 places in 141 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 879 unsolved
SMT process timed out in 31653ms, After SMT, problems are : Problem set: 0 solved, 879 unsolved
Search for dead transitions found 0 dead transitions in 31662ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33118 ms. Remains : 525/525 places, 880/880 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 525 transition count 781
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 237 place count 455 transition count 713
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 332 place count 360 transition count 618
Iterating global reduction 2 with 95 rules applied. Total rules applied 427 place count 360 transition count 618
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 505 place count 360 transition count 540
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 507 place count 359 transition count 539
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 508 place count 358 transition count 538
Iterating global reduction 3 with 1 rules applied. Total rules applied 509 place count 358 transition count 538
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 510 place count 358 transition count 537
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 513 place count 358 transition count 537
Applied a total of 513 rules in 78 ms. Remains 358 /525 variables (removed 167) and now considering 537/880 (removed 343) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 537 rows 358 cols
[2024-05-31 19:30:33] [INFO ] Computed 20 invariants in 3 ms
[2024-05-31 19:30:33] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 19:30:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2024-05-31 19:30:33] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 19:30:33] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 19:30:33] [INFO ] After 638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 818 ms.
[2024-05-31 19:30:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-31 19:30:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 525 places, 880 transitions and 3247 arcs took 8 ms.
[2024-05-31 19:30:34] [INFO ] Flatten gal took : 89 ms
Total runtime 58716 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FlexibleBarrier-PT-18b-ReachabilityFireability-2024-05
Could not compute solution for formula : FlexibleBarrier-PT-18b-ReachabilityFireability-2023-08

BK_STOP 1717183834380

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name FlexibleBarrier-PT-18b-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/571/inv_0_
rfs formula name FlexibleBarrier-PT-18b-ReachabilityFireability-2023-08
rfs formula type AG
rfs formula formula --invariant=/tmp/571/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-18b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-18b, 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 r496-tall-171640602700127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-18b.tgz
mv FlexibleBarrier-PT-18b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;