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-171640602700110.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-16b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602700110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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 May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 13 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 08:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 08:02 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 945K 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-16b-ReachabilityCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-12
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-13
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-14
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717183283222

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:21:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:21:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:21:24] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2024-05-31 19:21:24] [INFO ] Transformed 3472 places.
[2024-05-31 19:21:24] [INFO ] Transformed 4001 transitions.
[2024-05-31 19:21:24] [INFO ] Found NUPN structural information;
[2024-05-31 19:21:24] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (361 resets) in 2457 ms. (16 steps per ms) remains 9/10 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (29 resets) in 715 ms. (55 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (30 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (30 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (29 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (31 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (30 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (32 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (29 resets) in 594 ms. (67 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (31 resets) in 378 ms. (105 steps per ms) remains 9/9 properties
// Phase 1: matrix 4001 rows 3472 cols
[2024-05-31 19:21:26] [INFO ] Computed 18 invariants in 114 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 3333/3472 variables, 18/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3472 variables, 3333/3490 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3472 variables, 0/3490 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 4001/7473 variables, 3472/6962 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7473 variables, 0/6962 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/7473 variables, 0/6962 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7473/7473 variables, and 6962 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4445 ms.
Refiners :[Domain max(s): 3472/3472 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 3472/3472 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-10 is UNSAT
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 3333/3472 variables, 18/157 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3472 variables, 3333/3490 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-31 19:21:33] [INFO ] Deduced a trap composed of 1217 places in 1807 ms of which 141 ms to minimize.
[2024-05-31 19:21:35] [INFO ] Deduced a trap composed of 1210 places in 1606 ms of which 16 ms to minimize.
[2024-05-31 19:21:37] [INFO ] Deduced a trap composed of 1217 places in 1554 ms of which 14 ms to minimize.
SMT process timed out in 10676ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 130 out of 3472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Graph (trivial) has 3200 edges and 3472 vertex of which 74 / 3472 are part of one of the 12 SCC in 12 ms
Free SCC test removed 62 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 754 transitions
Trivial Post-agglo rules discarded 754 transitions
Performed 754 trivial Post agglomeration. Transition count delta: 754
Iterating post reduction 0 with 754 rules applied. Total rules applied 755 place count 3410 transition count 3172
Reduce places removed 754 places and 0 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 1 with 792 rules applied. Total rules applied 1547 place count 2656 transition count 3134
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1585 place count 2618 transition count 3134
Performed 242 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 242 Pre rules applied. Total rules applied 1585 place count 2618 transition count 2892
Deduced a syphon composed of 242 places in 3 ms
Reduce places removed 242 places and 0 transitions.
Iterating global reduction 3 with 484 rules applied. Total rules applied 2069 place count 2376 transition count 2892
Discarding 1301 places :
Symmetric choice reduction at 3 with 1301 rule applications. Total rules 3370 place count 1075 transition count 1591
Iterating global reduction 3 with 1301 rules applied. Total rules applied 4671 place count 1075 transition count 1591
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4671 place count 1075 transition count 1589
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4675 place count 1073 transition count 1589
Discarding 178 places :
Symmetric choice reduction at 3 with 178 rule applications. Total rules 4853 place count 895 transition count 1411
Iterating global reduction 3 with 178 rules applied. Total rules applied 5031 place count 895 transition count 1411
Ensure Unique test removed 165 transitions
Reduce isomorphic transitions removed 165 transitions.
Iterating post reduction 3 with 165 rules applied. Total rules applied 5196 place count 895 transition count 1246
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5398 place count 794 transition count 1145
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 5407 place count 794 transition count 1136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 5409 place count 793 transition count 1136
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 5412 place count 793 transition count 1133
Free-agglomeration rule applied 517 times.
Iterating global reduction 5 with 517 rules applied. Total rules applied 5929 place count 793 transition count 616
Reduce places removed 517 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 5 with 596 rules applied. Total rules applied 6525 place count 276 transition count 537
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 6 with 71 rules applied. Total rules applied 6596 place count 276 transition count 466
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 6598 place count 276 transition count 466
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 6602 place count 276 transition count 462
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 6605 place count 276 transition count 462
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 6606 place count 275 transition count 461
Applied a total of 6606 rules in 1139 ms. Remains 275 /3472 variables (removed 3197) and now considering 461/4001 (removed 3540) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1148 ms. Remains : 275/3472 places, 461/4001 transitions.
RANDOM walk for 40000 steps (345 resets) in 650 ms. (61 steps per ms) remains 4/8 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (28 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (30 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (30 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
[2024-05-31 19:21:38] [INFO ] Flow matrix only has 425 transitions (discarded 36 similar events)
// Phase 1: matrix 425 rows 275 cols
[2024-05-31 19:21:38] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 19:21:38] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 180/267 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 415/682 variables, 267/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/682 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/682 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 5/687 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/687 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/687 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/692 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/692 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/692 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/696 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 4/700 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/700 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/700 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 700/700 variables, and 296 constraints, problems are : Problem set: 0 solved, 4 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 275/275 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 180/267 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:21:39] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:21:39] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-31 19:21:39] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-05-31 19:21:39] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:21:39] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 2 ms to minimize.
[2024-05-31 19:21:39] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-05-31 19:21:39] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 ms to minimize.
[2024-05-31 19:21:39] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 2 ms to minimize.
[2024-05-31 19:21:39] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:21:39] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 415/682 variables, 267/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/682 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:21:40] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/682 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/682 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/687 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/687 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/687 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:21:40] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-05-31 19:21:40] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/687 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:21:40] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/687 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:21:40] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/687 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/687 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 5/692 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/692 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/692 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:21:40] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/692 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/692 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 4/696 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/696 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 4/700 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:21:41] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/700 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 700/700 variables, and 317 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2534 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 275/275 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 17/17 constraints]
After SMT, in 3015ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 5930 steps, including 192 resets, run visited all 4 properties in 57 ms. (steps per millisecond=104 )
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 64 ms.
All properties solved without resorting to model-checking.
Total runtime 17339 ms.
ITS solved all properties within timeout

BK_STOP 1717183301777

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

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-16b"
export BK_EXAMINATION="ReachabilityCardinality"
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-16b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640602700110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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