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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 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 726K 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-14b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717182946229

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-14b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:15:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:15:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:15:47] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-05-31 19:15:47] [INFO ] Transformed 2678 places.
[2024-05-31 19:15:47] [INFO ] Transformed 3085 transitions.
[2024-05-31 19:15:47] [INFO ] Found NUPN structural information;
[2024-05-31 19:15:47] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (404 resets) in 2543 ms. (15 steps per ms) remains 10/16 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (35 resets) in 301 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (19 resets) in 410 ms. (97 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (33 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (38 resets) in 1165 ms. (34 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (34 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (37 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (37 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (37 resets) in 37 ms. (1052 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
// Phase 1: matrix 3085 rows 2678 cols
[2024-05-31 19:15:49] [INFO ] Computed 16 invariants in 72 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2584/2678 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2678 variables, 2584/2694 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2678 variables, 0/2694 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3085/5763 variables, 2678/5372 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5763 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/5763 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5763/5763 variables, and 5372 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3605 ms.
Refiners :[Domain max(s): 2678/2678 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 2678/2678 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/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FlexibleBarrier-PT-14b-ReachabilityFireability-2024-06 is UNSAT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2584/2678 variables, 16/110 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2678 variables, 2584/2694 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-31 19:15:55] [INFO ] Deduced a trap composed of 26 places in 1438 ms of which 110 ms to minimize.
[2024-05-31 19:15:56] [INFO ] Deduced a trap composed of 243 places in 1310 ms of which 14 ms to minimize.
[2024-05-31 19:15:57] [INFO ] Deduced a trap composed of 137 places in 1167 ms of which 13 ms to minimize.
[2024-05-31 19:15:59] [INFO ] Deduced a trap composed of 312 places in 1225 ms of which 13 ms to minimize.
SMT process timed out in 9788ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 90 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Graph (trivial) has 1937 edges and 2678 vertex of which 32 / 2678 are part of one of the 5 SCC in 9 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 460 transitions
Trivial Post-agglo rules discarded 460 transitions
Performed 460 trivial Post agglomeration. Transition count delta: 460
Iterating post reduction 0 with 460 rules applied. Total rules applied 461 place count 2651 transition count 2592
Reduce places removed 460 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 477 rules applied. Total rules applied 938 place count 2191 transition count 2575
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 955 place count 2174 transition count 2575
Performed 325 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 325 Pre rules applied. Total rules applied 955 place count 2174 transition count 2250
Deduced a syphon composed of 325 places in 6 ms
Reduce places removed 325 places and 0 transitions.
Iterating global reduction 3 with 650 rules applied. Total rules applied 1605 place count 1849 transition count 2250
Discarding 995 places :
Symmetric choice reduction at 3 with 995 rule applications. Total rules 2600 place count 854 transition count 1255
Iterating global reduction 3 with 995 rules applied. Total rules applied 3595 place count 854 transition count 1255
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 3595 place count 854 transition count 1248
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 3609 place count 847 transition count 1248
Discarding 141 places :
Symmetric choice reduction at 3 with 141 rule applications. Total rules 3750 place count 706 transition count 1107
Iterating global reduction 3 with 141 rules applied. Total rules applied 3891 place count 706 transition count 1107
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 3 with 132 rules applied. Total rules applied 4023 place count 706 transition count 975
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 4205 place count 615 transition count 884
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 4223 place count 606 transition count 884
Free-agglomeration rule applied 86 times.
Iterating global reduction 4 with 86 rules applied. Total rules applied 4309 place count 606 transition count 798
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 4 with 86 rules applied. Total rules applied 4395 place count 520 transition count 798
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4399 place count 516 transition count 794
Iterating global reduction 5 with 4 rules applied. Total rules applied 4403 place count 516 transition count 794
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 4407 place count 516 transition count 790
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 4412 place count 516 transition count 785
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 4423 place count 516 transition count 785
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 4424 place count 516 transition count 785
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4425 place count 515 transition count 784
Applied a total of 4425 rules in 635 ms. Remains 515 /2678 variables (removed 2163) and now considering 784/3085 (removed 2301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 645 ms. Remains : 515/2678 places, 784/3085 transitions.
RANDOM walk for 40000 steps (605 resets) in 663 ms. (60 steps per ms) remains 4/9 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (50 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (51 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (50 resets) in 97 ms. (408 steps per ms) remains 3/4 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (47 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
[2024-05-31 19:16:00] [INFO ] Flow matrix only has 769 transitions (discarded 15 similar events)
// Phase 1: matrix 769 rows 515 cols
[2024-05-31 19:16:00] [INFO ] Computed 16 invariants in 9 ms
[2024-05-31 19:16:00] [INFO ] State equation strengthened by 98 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 464/500 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/515 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 769/1284 variables, 515/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1284 variables, 98/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1284 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1284 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1284/1284 variables, and 629 constraints, problems are : Problem set: 0 solved, 3 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 515/515 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 464/500 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:16:00] [INFO ] Deduced a trap composed of 226 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:16:01] [INFO ] Deduced a trap composed of 225 places in 155 ms of which 3 ms to minimize.
[2024-05-31 19:16:01] [INFO ] Deduced a trap composed of 200 places in 142 ms of which 3 ms to minimize.
[2024-05-31 19:16:01] [INFO ] Deduced a trap composed of 205 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/515 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 769/1284 variables, 515/535 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1284 variables, 98/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1284 variables, 3/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1284 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1284 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1284/1284 variables, and 636 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 515/515 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 2085ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 797 ms.
Support contains 36 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 784/784 transitions.
Graph (trivial) has 124 edges and 515 vertex of which 8 / 515 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 511 transition count 767
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 502 transition count 767
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 19 place count 502 transition count 761
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 31 place count 496 transition count 761
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 53 place count 474 transition count 739
Iterating global reduction 2 with 22 rules applied. Total rules applied 75 place count 474 transition count 739
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 111 place count 456 transition count 721
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 456 transition count 719
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 127 place count 442 transition count 705
Iterating global reduction 3 with 14 rules applied. Total rules applied 141 place count 442 transition count 705
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 155 place count 442 transition count 691
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 160 place count 442 transition count 686
Free-agglomeration rule applied 61 times.
Iterating global reduction 4 with 61 rules applied. Total rules applied 221 place count 442 transition count 625
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 284 place count 381 transition count 623
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 301 place count 364 transition count 606
Iterating global reduction 5 with 17 rules applied. Total rules applied 318 place count 364 transition count 606
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 335 place count 364 transition count 589
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 339 place count 364 transition count 585
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 340 place count 364 transition count 585
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 341 place count 363 transition count 584
Applied a total of 341 rules in 155 ms. Remains 363 /515 variables (removed 152) and now considering 584/784 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 363/515 places, 584/784 transitions.
RANDOM walk for 40000 steps (349 resets) in 240 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (40 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (47 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (47 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 527536 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 3
Probabilistic random walk after 527536 steps, saw 150087 distinct states, run finished after 3016 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-31 19:16:06] [INFO ] Flow matrix only has 564 transitions (discarded 20 similar events)
// Phase 1: matrix 564 rows 363 cols
[2024-05-31 19:16:06] [INFO ] Computed 16 invariants in 5 ms
[2024-05-31 19:16:06] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 315/351 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 564/915 variables, 351/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 12/927 variables, 12/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/927 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/927 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 380 constraints, problems are : Problem set: 0 solved, 3 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 363/363 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 315/351 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:16:06] [INFO ] Deduced a trap composed of 171 places in 103 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 564/915 variables, 351/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/915 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:16:07] [INFO ] Deduced a trap composed of 172 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/915 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/915 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 12/927 variables, 12/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/927 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/927 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 927/927 variables, and 385 constraints, problems are : Problem set: 0 solved, 3 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 363/363 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1270ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 320 ms.
Support contains 35 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 584/584 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 362 transition count 583
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 361 transition count 582
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 361 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 361 transition count 581
Applied a total of 5 rules in 29 ms. Remains 361 /363 variables (removed 2) and now considering 581/584 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 361/363 places, 581/584 transitions.
RANDOM walk for 40000 steps (346 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (47 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 601371 steps, run timeout after 3006 ms. (steps per millisecond=200 ) properties seen :0 out of 2
Probabilistic random walk after 601371 steps, saw 189486 distinct states, run finished after 3006 ms. (steps per millisecond=200 ) properties seen :0
[2024-05-31 19:16:11] [INFO ] Flow matrix only has 561 transitions (discarded 20 similar events)
// Phase 1: matrix 561 rows 361 cols
[2024-05-31 19:16:11] [INFO ] Computed 16 invariants in 4 ms
[2024-05-31 19:16:11] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 314/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 561/910 variables, 349/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/910 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/910 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 12/922 variables, 12/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/922 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/922 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 922/922 variables, and 378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 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/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 314/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:16:11] [INFO ] Deduced a trap composed of 171 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:16:11] [INFO ] Deduced a trap composed of 172 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 561/910 variables, 349/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/910 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/910 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/910 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/922 variables, 12/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/922 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/922 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/922 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/922 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 922/922 variables, and 382 constraints, problems are : Problem set: 0 solved, 2 unsolved in 756 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1040ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 44 ms.
Support contains 6 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 581/581 transitions.
Graph (trivial) has 257 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 357 transition count 563
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 347 transition count 563
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 21 place count 347 transition count 561
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 345 transition count 561
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 39 place count 345 transition count 547
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 63 place count 321 transition count 523
Iterating global reduction 3 with 24 rules applied. Total rules applied 87 place count 321 transition count 523
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 87 place count 321 transition count 522
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 89 place count 320 transition count 522
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 102 place count 320 transition count 509
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 128 place count 307 transition count 496
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 144 place count 291 transition count 480
Iterating global reduction 4 with 16 rules applied. Total rules applied 160 place count 291 transition count 480
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 173 place count 291 transition count 467
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 179 place count 291 transition count 461
Free-agglomeration rule applied 196 times.
Iterating global reduction 5 with 196 rules applied. Total rules applied 375 place count 291 transition count 265
Reduce places removed 197 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (trivial) has 72 edges and 94 vertex of which 26 / 94 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 313 rules applied. Total rules applied 688 place count 81 transition count 150
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 28 rules applied. Total rules applied 716 place count 80 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 717 place count 79 transition count 123
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 717 place count 79 transition count 110
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 743 place count 66 transition count 110
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 754 place count 66 transition count 99
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 784 place count 51 transition count 84
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 787 place count 51 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 788 place count 51 transition count 80
Free-agglomeration rule applied 13 times.
Iterating global reduction 10 with 13 rules applied. Total rules applied 801 place count 51 transition count 67
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 44 rules applied. Total rules applied 845 place count 28 transition count 46
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 854 place count 19 transition count 37
Iterating global reduction 11 with 9 rules applied. Total rules applied 863 place count 19 transition count 37
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 872 place count 19 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 875 place count 19 transition count 25
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 877 place count 19 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 879 place count 17 transition count 23
Applied a total of 879 rules in 131 ms. Remains 17 /361 variables (removed 344) and now considering 23/581 (removed 558) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 17/361 places, 23/581 transitions.
RANDOM walk for 311 steps (0 resets) in 6 ms. (44 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 24899 ms.
ITS solved all properties within timeout

BK_STOP 1717182972374

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

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

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