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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K 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 53K 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.6K 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 8.2K Apr 13 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 08:28 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.5M 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-20b-ReachabilityCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717186585182

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-20b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:16:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:16:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:16:26] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2024-05-31 20:16:26] [INFO ] Transformed 5372 places.
[2024-05-31 20:16:26] [INFO ] Transformed 6193 transitions.
[2024-05-31 20:16:26] [INFO ] Found NUPN structural information;
[2024-05-31 20:16:26] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (297 resets) in 1765 ms. (22 steps per ms) remains 10/13 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (21 resets) in 380 ms. (104 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (22 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (21 resets) in 278 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (22 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (20 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (22 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (22 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
// Phase 1: matrix 6193 rows 5372 cols
[2024-05-31 20:16:28] [INFO ] Computed 22 invariants in 250 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 5253/5360 variables, 21/128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5360 variables, 5253/5381 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5360 variables, 0/5381 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 12/5372 variables, 1/5382 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5372 variables, 12/5394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5372 variables, 0/5394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 6193/11565 variables, 5372/10766 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11565/11565 variables, and 10766 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5137 ms.
Refiners :[Domain max(s): 5372/5372 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 5372/5372 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 5253/5360 variables, 21/128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5360 variables, 5253/5381 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 20:16:39] [INFO ] Deduced a trap composed of 2058 places in 4708 ms of which 227 ms to minimize.
SMT process timed out in 11313ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 5372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 4414 edges and 5372 vertex of which 104 / 5372 are part of one of the 17 SCC in 14 ms
Free SCC test removed 87 places
Drop transitions (Empty/Sink Transition effects.) removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 902 transitions
Trivial Post-agglo rules discarded 902 transitions
Performed 902 trivial Post agglomeration. Transition count delta: 902
Iterating post reduction 0 with 902 rules applied. Total rules applied 903 place count 5285 transition count 5186
Reduce places removed 902 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 926 rules applied. Total rules applied 1829 place count 4383 transition count 5162
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 1853 place count 4359 transition count 5162
Performed 695 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 695 Pre rules applied. Total rules applied 1853 place count 4359 transition count 4467
Deduced a syphon composed of 695 places in 8 ms
Reduce places removed 695 places and 0 transitions.
Iterating global reduction 3 with 1390 rules applied. Total rules applied 3243 place count 3664 transition count 4467
Discarding 2141 places :
Symmetric choice reduction at 3 with 2141 rule applications. Total rules 5384 place count 1523 transition count 2326
Iterating global reduction 3 with 2141 rules applied. Total rules applied 7525 place count 1523 transition count 2326
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 7525 place count 1523 transition count 2316
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 7545 place count 1513 transition count 2316
Discarding 320 places :
Symmetric choice reduction at 3 with 320 rule applications. Total rules 7865 place count 1193 transition count 1996
Iterating global reduction 3 with 320 rules applied. Total rules applied 8185 place count 1193 transition count 1996
Ensure Unique test removed 292 transitions
Reduce isomorphic transitions removed 292 transitions.
Iterating post reduction 3 with 292 rules applied. Total rules applied 8477 place count 1193 transition count 1704
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 1 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 4 with 234 rules applied. Total rules applied 8711 place count 1076 transition count 1587
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 8728 place count 1076 transition count 1570
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 8744 place count 1060 transition count 1554
Iterating global reduction 5 with 16 rules applied. Total rules applied 8760 place count 1060 transition count 1554
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8764 place count 1058 transition count 1554
Free-agglomeration rule applied 435 times.
Iterating global reduction 5 with 435 rules applied. Total rules applied 9199 place count 1058 transition count 1119
Reduce places removed 435 places and 0 transitions.
Iterating post reduction 5 with 435 rules applied. Total rules applied 9634 place count 623 transition count 1119
Discarding 71 places :
Symmetric choice reduction at 6 with 71 rule applications. Total rules 9705 place count 552 transition count 1048
Iterating global reduction 6 with 71 rules applied. Total rules applied 9776 place count 552 transition count 1048
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 6 with 71 rules applied. Total rules applied 9847 place count 552 transition count 977
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 7 with 42 rules applied. Total rules applied 9889 place count 552 transition count 935
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 9892 place count 552 transition count 935
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 9893 place count 552 transition count 934
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 9894 place count 551 transition count 933
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t5358.t4252.t4253.t4231.t4232 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 100 edges and 549 vertex of which 30 / 549 are part of one of the 14 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 8 rules applied. Total rules applied 9902 place count 533 transition count 926
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 9 with 35 rules applied. Total rules applied 9937 place count 528 transition count 896
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 21 Pre rules applied. Total rules applied 9937 place count 528 transition count 875
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 10 with 42 rules applied. Total rules applied 9979 place count 507 transition count 875
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 9987 place count 499 transition count 867
Iterating global reduction 10 with 8 rules applied. Total rules applied 9995 place count 499 transition count 867
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 10003 place count 499 transition count 859
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 10039 place count 481 transition count 841
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 10041 place count 480 transition count 841
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 11 with 15 rules applied. Total rules applied 10056 place count 480 transition count 826
Free-agglomeration rule applied 17 times.
Iterating global reduction 11 with 17 rules applied. Total rules applied 10073 place count 480 transition count 809
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 32 rules applied. Total rules applied 10105 place count 463 transition count 794
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 10106 place count 463 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 10107 place count 462 transition count 793
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 10109 place count 462 transition count 793
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 10110 place count 462 transition count 792
Applied a total of 10110 rules in 1557 ms. Remains 462 /5372 variables (removed 4910) and now considering 792/6193 (removed 5401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1566 ms. Remains : 462/5372 places, 792/6193 transitions.
RANDOM walk for 40000 steps (8 resets) in 404 ms. (98 steps per ms) remains 9/10 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 218 ms. (182 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 200 ms. (199 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 231 ms. (172 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 199 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
[2024-05-31 20:16:41] [INFO ] Flow matrix only has 770 transitions (discarded 22 similar events)
// Phase 1: matrix 770 rows 462 cols
[2024-05-31 20:16:41] [INFO ] Computed 21 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 356/462 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 770/1232 variables, 462/483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1232 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/1232 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 483 constraints, problems are : Problem set: 0 solved, 9 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 462/462 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/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 356/462 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:16:42] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-05-31 20:16:42] [INFO ] Deduced a trap composed of 320 places in 167 ms of which 3 ms to minimize.
[2024-05-31 20:16:42] [INFO ] Deduced a trap composed of 319 places in 146 ms of which 3 ms to minimize.
[2024-05-31 20:16:43] [INFO ] Deduced a trap composed of 318 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:16:43] [INFO ] Deduced a trap composed of 321 places in 137 ms of which 3 ms to minimize.
[2024-05-31 20:16:43] [INFO ] Deduced a trap composed of 317 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:16:43] [INFO ] Deduced a trap composed of 317 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:16:43] [INFO ] Deduced a trap composed of 323 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:16:43] [INFO ] Deduced a trap composed of 321 places in 158 ms of which 2 ms to minimize.
[2024-05-31 20:16:44] [INFO ] Deduced a trap composed of 321 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:16:44] [INFO ] Deduced a trap composed of 324 places in 136 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:16:44] [INFO ] Deduced a trap composed of 325 places in 141 ms of which 3 ms to minimize.
[2024-05-31 20:16:44] [INFO ] Deduced a trap composed of 322 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 770/1232 variables, 462/496 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 9/505 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:16:45] [INFO ] Deduced a trap composed of 313 places in 136 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1232 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/1232 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 506 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3809 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 14/14 constraints]
After SMT, in 4554ms problems are : Problem set: 0 solved, 9 unsolved
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 2273 ms.
Support contains 44 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 792/792 transitions.
Graph (trivial) has 366 edges and 462 vertex of which 4 / 462 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 460 transition count 767
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 439 transition count 767
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 75 place count 407 transition count 735
Iterating global reduction 2 with 32 rules applied. Total rules applied 107 place count 407 transition count 735
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 407 transition count 733
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 405 transition count 731
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 405 transition count 731
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 405 transition count 729
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 151 place count 386 transition count 711
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 292 edges and 386 vertex of which 4 / 386 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 11 rules applied. Total rules applied 162 place count 383 transition count 701
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 189 place count 383 transition count 674
Discarding 43 places :
Symmetric choice reduction at 6 with 43 rule applications. Total rules 232 place count 340 transition count 631
Iterating global reduction 6 with 43 rules applied. Total rules applied 275 place count 340 transition count 631
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 6 with 43 rules applied. Total rules applied 318 place count 340 transition count 588
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2461.t2462.t2464.t4585.t4586.t4624.t6015.t1728 and 1 places that fell out of Prefix Of Interest.
Iterating global reduction 7 with 2 rules applied. Total rules applied 320 place count 337 transition count 586
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 322 place count 337 transition count 584
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 339 place count 320 transition count 567
Iterating global reduction 8 with 17 rules applied. Total rules applied 356 place count 320 transition count 567
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 373 place count 320 transition count 550
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 378 place count 320 transition count 545
Free-agglomeration rule applied 225 times with reduction of 6 identical transitions.
Iterating global reduction 9 with 225 rules applied. Total rules applied 603 place count 320 transition count 314
Reduce places removed 226 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 129 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 9 with 359 rules applied. Total rules applied 962 place count 94 transition count 181
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 965 place count 91 transition count 178
Iterating global reduction 10 with 3 rules applied. Total rules applied 968 place count 91 transition count 178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 971 place count 91 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 11 with 39 rules applied. Total rules applied 1010 place count 91 transition count 136
Applied a total of 1010 rules in 128 ms. Remains 91 /462 variables (removed 371) and now considering 136/792 (removed 656) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 91/462 places, 136/792 transitions.
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 108 ms. (366 steps per ms) remains 3/4 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/3 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/2 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 136 rows 91 cols
[2024-05-31 20:16:48] [INFO ] Computed 17 invariants in 0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/76 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/196 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/199 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/227 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, State Equation: 78/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/76 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:16:48] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 120/196 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/199 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/201 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/204 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/210 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/210 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/227 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, State Equation: 83/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
All properties solved without resorting to model-checking.
Total runtime 22661 ms.
ITS solved all properties within timeout

BK_STOP 1717186609023

--------------------
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-20b"
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-20b, 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-171640602700142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20b.tgz
mv FlexibleBarrier-PT-20b 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 ;