Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446500158.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S04J06T08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446500158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 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 PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717250667417

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:04:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:04:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:04:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 14:04:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:04:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 637 ms
[2024-06-01 14:04:29] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:04:29] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-06-01 14:04:29] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (15 resets) in 1180 ms. (33 steps per ms) remains 12/15 properties
BEST_FIRST walk for 40002 steps (9 resets) in 325 ms. (122 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 364 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (9 resets) in 244 ms. (163 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (9 resets) in 265 ms. (150 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (9 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 291 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 222 ms. (179 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 221 ms. (180 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (11 resets) in 119 ms. (333 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (11 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (19 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
[2024-06-01 14:04:30] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 14:04:31] [INFO ] Computed 26 invariants in 6 ms
[2024-06-01 14:04:31] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-02 is UNSAT
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-03 is UNSAT
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-04 is UNSAT
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-05 is UNSAT
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 9/9 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-08 is UNSAT
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-10 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 10/19 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 4 unsolved
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-09 is UNSAT
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-13 is UNSAT
At refinement iteration 3 (OVERLAPS) 2/79 variables, 2/21 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/21 constraints. Problems are: Problem set: 9 solved, 2 unsolved
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-01 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/81 variables, 5/26 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 10 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/59 variables, 8/9 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/62 variables, 2/11 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/81 variables, 15/26 constraints. Problems are: Problem set: 10 solved, 1 unsolved
[2024-06-01 14:04:31] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 6 ms to minimize.
[2024-06-01 14:04:31] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/28 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/28 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 64/145 variables, 81/109 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 8/117 constraints. Problems are: Problem set: 10 solved, 1 unsolved
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-07 is UNSAT
After SMT solving in domain Int declared 145/145 variables, and 118 constraints, problems are : Problem set: 11 solved, 0 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/11 constraints, Known Traps: 2/2 constraints]
After SMT, in 636ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 14:04:31] [INFO ] Flatten gal took : 23 ms
[2024-06-01 14:04:31] [INFO ] Flatten gal took : 10 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-02 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-03 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-05 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-08 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-10 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-13 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 14:04:31] [INFO ] Unfolded HLPN to a Petri net with 792 places and 4268 transitions 28832 arcs in 79 ms.
[2024-06-01 14:04:31] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
RANDOM walk for 40000 steps (9 resets) in 829 ms. (48 steps per ms) remains 1/4 properties
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
[2024-06-01 14:04:32] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2024-06-01 14:04:32] [INFO ] Computed 58 invariants in 85 ms
[2024-06-01 14:04:32] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 356/381 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/481 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 308/789 variables, 32/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:04:33] [INFO ] Deduced a trap composed of 83 places in 518 ms of which 6 ms to minimize.
[2024-06-01 14:04:33] [INFO ] Deduced a trap composed of 83 places in 462 ms of which 6 ms to minimize.
[2024-06-01 14:04:34] [INFO ] Deduced a trap composed of 84 places in 399 ms of which 4 ms to minimize.
[2024-06-01 14:04:34] [INFO ] Deduced a trap composed of 83 places in 371 ms of which 4 ms to minimize.
[2024-06-01 14:04:34] [INFO ] Deduced a trap composed of 85 places in 342 ms of which 5 ms to minimize.
[2024-06-01 14:04:35] [INFO ] Deduced a trap composed of 200 places in 344 ms of which 4 ms to minimize.
[2024-06-01 14:04:35] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:04:35] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/790 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/790 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2858/2860 variables, and 855 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4295 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 790/792 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 356/381 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/481 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 308/789 variables, 32/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/790 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/790 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2858/2860 variables, and 855 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1214 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 790/792 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 5632ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 9 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 788 transition count 2044
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 116 place count 732 transition count 2044
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 116 place count 732 transition count 1940
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 324 place count 628 transition count 1940
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 332 place count 620 transition count 1932
Iterating global reduction 2 with 8 rules applied. Total rules applied 340 place count 620 transition count 1932
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 484 place count 548 transition count 1860
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 500 place count 548 transition count 1844
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 516 place count 532 transition count 1844
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 524 place count 532 transition count 1844
Applied a total of 524 rules in 385 ms. Remains 532 /792 variables (removed 260) and now considering 1844/2100 (removed 256) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 14:04:38] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 532 cols
[2024-06-01 14:04:38] [INFO ] Computed 54 invariants in 72 ms
[2024-06-01 14:04:38] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 14:05:03] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:05:03] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:05:03] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:05:03] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:05:04] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:05:04] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:05:04] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:05:04] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:05:04] [INFO ] Deduced a trap composed of 227 places in 375 ms of which 3 ms to minimize.
[2024-06-01 14:05:05] [INFO ] Deduced a trap composed of 215 places in 435 ms of which 5 ms to minimize.
[2024-06-01 14:05:06] [INFO ] Deduced a trap composed of 216 places in 464 ms of which 4 ms to minimize.
[2024-06-01 14:05:06] [INFO ] Deduced a trap composed of 214 places in 424 ms of which 4 ms to minimize.
[2024-06-01 14:05:06] [INFO ] Deduced a trap composed of 211 places in 358 ms of which 3 ms to minimize.
[2024-06-01 14:05:07] [INFO ] Deduced a trap composed of 216 places in 379 ms of which 3 ms to minimize.
[2024-06-01 14:05:08] [INFO ] Deduced a trap composed of 206 places in 245 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/2344 variables, and 65 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/532 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 14:05:28] [INFO ] Deduced a trap composed of 184 places in 410 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/2344 variables, and 66 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/532 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 16/16 constraints]
After SMT, in 51387ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 51408ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51818 ms. Remains : 532/792 places, 1844/2100 transitions.
RANDOM walk for 30087 steps (6 resets) in 333 ms. (90 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 61149 ms.
ITS solved all properties within timeout

BK_STOP 1717250729875

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="PolyORBLF-COL-S04J06T08"
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 PolyORBLF-COL-S04J06T08, 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 r516-tajo-171654446500158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J06T08.tgz
mv PolyORBLF-COL-S04J06T08 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 ;