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.r464-smll-171620117700023.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 ASLink-PT-01b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 7.1K 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.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 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 293K 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 ASLink-PT-01b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717179704060

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:21:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:21:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:21:47] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2024-05-31 18:21:47] [INFO ] Transformed 846 places.
[2024-05-31 18:21:47] [INFO ] Transformed 1148 transitions.
[2024-05-31 18:21:47] [INFO ] Found NUPN structural information;
[2024-05-31 18:21:47] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 680 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (249 resets) in 3334 ms. (11 steps per ms) remains 8/16 properties
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (71 resets) in 307 ms. (129 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (77 resets) in 609 ms. (65 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (72 resets) in 1813 ms. (22 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (62 resets) in 392 ms. (101 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (73 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (67 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (63 resets) in 291 ms. (136 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (71 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
// Phase 1: matrix 1148 rows 846 cols
[2024-05-31 18:21:50] [INFO ] Computed 82 invariants in 131 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 199/417 variables, 19/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 199/436 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem ASLink-PT-01b-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 426/843 variables, 60/498 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/843 variables, 426/924 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 0/924 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 3/846 variables, 1/925 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/846 variables, 3/928 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/846 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1148/1994 variables, 846/1774 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1994 variables, 0/1774 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1994/1994 variables, and 1774 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5077 ms.
Refiners :[Domain max(s): 846/846 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 846/846 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 204/394 variables, 19/209 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 204/413 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 2/415 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-31 18:21:56] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 1/416 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/416 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem ASLink-PT-01b-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01b-ReachabilityFireability-2024-14 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 449/843 variables, 60/476 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 449/925 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-31 18:21:57] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 4 ms to minimize.
[2024-05-31 18:21:57] [INFO ] Deduced a trap composed of 184 places in 625 ms of which 10 ms to minimize.
Problem ASLink-PT-01b-ReachabilityFireability-2024-05 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-31 18:21:58] [INFO ] Deduced a trap composed of 147 places in 553 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/843 variables, 3/928 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-31 18:21:59] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 4 ms to minimize.
[2024-05-31 18:21:59] [INFO ] Deduced a trap composed of 106 places in 419 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/843 variables, 2/930 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/843 variables, 0/930 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3/846 variables, 1/931 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/846 variables, 3/934 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/846 variables, 0/934 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1994/1994 variables, and 1780 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5007 ms.
Refiners :[Domain max(s): 846/846 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 846/846 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 10849ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 846 transition count 1002
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 156 rules applied. Total rules applied 302 place count 700 transition count 992
Reduce places removed 3 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 12 rules applied. Total rules applied 314 place count 697 transition count 983
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 323 place count 688 transition count 983
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 169 Pre rules applied. Total rules applied 323 place count 688 transition count 814
Deduced a syphon composed of 169 places in 5 ms
Ensure Unique test removed 9 places
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 4 with 347 rules applied. Total rules applied 670 place count 510 transition count 814
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 674 place count 509 transition count 811
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 680 place count 506 transition count 808
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 683 place count 503 transition count 808
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 683 place count 503 transition count 804
Deduced a syphon composed of 4 places in 5 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 695 place count 495 transition count 804
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 695 place count 495 transition count 800
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 703 place count 491 transition count 800
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 724 place count 470 transition count 779
Iterating global reduction 7 with 21 rules applied. Total rules applied 745 place count 470 transition count 779
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 746 place count 470 transition count 778
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 746 place count 470 transition count 771
Deduced a syphon composed of 7 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 15 rules applied. Total rules applied 761 place count 462 transition count 771
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 761 place count 462 transition count 770
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 764 place count 460 transition count 770
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 765 place count 459 transition count 761
Iterating global reduction 8 with 1 rules applied. Total rules applied 766 place count 459 transition count 761
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 4 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 8 with 60 rules applied. Total rules applied 826 place count 429 transition count 731
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 827 place count 428 transition count 730
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 829 place count 427 transition count 730
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 830 place count 426 transition count 729
Iterating global reduction 8 with 1 rules applied. Total rules applied 831 place count 426 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 833 place count 426 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 834 place count 425 transition count 727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 836 place count 424 transition count 736
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 839 place count 424 transition count 733
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 842 place count 421 transition count 733
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 844 place count 421 transition count 731
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 846 place count 419 transition count 731
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 847 place count 419 transition count 731
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 848 place count 418 transition count 730
Applied a total of 848 rules in 744 ms. Remains 418 /846 variables (removed 428) and now considering 730/1148 (removed 418) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 769 ms. Remains : 418/846 places, 730/1148 transitions.
RANDOM walk for 40000 steps (465 resets) in 375 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (156 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (150 resets) in 370 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (159 resets) in 247 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (171 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 273207 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :1 out of 4
Probabilistic random walk after 273207 steps, saw 85613 distinct states, run finished after 3009 ms. (steps per millisecond=90 ) properties seen :1
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 730 rows 418 cols
[2024-05-31 18:22:05] [INFO ] Computed 65 invariants in 40 ms
[2024-05-31 18:22:05] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/219 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/221 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 197/418 variables, 48/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 730/1148 variables, 418/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1148 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1148 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1148 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1148/1148 variables, and 484 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 418/418 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/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/219 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/221 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 197/418 variables, 48/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:22:07] [INFO ] Deduced a trap composed of 76 places in 481 ms of which 7 ms to minimize.
[2024-05-31 18:22:07] [INFO ] Deduced a trap composed of 76 places in 485 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:22:07] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:22:08] [INFO ] Deduced a trap composed of 81 places in 228 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem ASLink-PT-01b-ReachabilityFireability-2024-04 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01b-ReachabilityFireability-2024-06 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01b-ReachabilityFireability-2024-08 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 1148/1148 variables, and 487 constraints, problems are : Problem set: 3 solved, 0 unsolved in 2569 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 418/418 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 3715ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 22226 ms.
ITS solved all properties within timeout

BK_STOP 1717179728904

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="ASLink-PT-01b"
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 ASLink-PT-01b, 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 r464-smll-171620117700023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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