fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r476-tall-171620505100086
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CANConstruction-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2995.592 367442.00 435178.00 863.20 ??FFTTFT??F?FTFF normal

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.r476-tall-171620505100086.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 CANConstruction-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505100086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 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 15M 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 CANConstruction-PT-100-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2023-11
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717184942178

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:49:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:49:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:49:04] [INFO ] Load time of PNML (sax parser for PT used): 732 ms
[2024-05-31 19:49:04] [INFO ] Transformed 21202 places.
[2024-05-31 19:49:04] [INFO ] Transformed 40800 transitions.
[2024-05-31 19:49:04] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 954 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (20 resets) in 4171 ms. (9 steps per ms) remains 13/16 properties
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 557 ms. (71 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 994 ms. (40 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-31 19:49:07] [INFO ] Computed 201 invariants in 637 ms
[2024-05-31 19:49:07] [INFO ] State equation strengthened by 19900 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem CANConstruction-PT-100-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-100-ReachabilityCardinality-2024-12 is UNSAT
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 20809/21093 variables, 93/93 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 21093/62002 variables, and 93 constraints, problems are : Problem set: 2 solved, 11 unsolved in 5048 ms.
Refiners :[Positive P Invariants (semi-flows): 93/101 constraints, Generalized P Invariants (flows): 0/100 constraints, State Equation: 0/21202 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 20885/21085 variables, 85/85 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-31 19:50:26] [INFO ] Deduced a trap composed of 5 places in 70633 ms of which 786 ms to minimize.
SMT process timed out in 79955ms, After SMT, problems are : Problem set: 2 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 200 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 684 transitions
Trivial Post-agglo rules discarded 684 transitions
Performed 684 trivial Post agglomeration. Transition count delta: 684
Iterating post reduction 0 with 684 rules applied. Total rules applied 684 place count 21202 transition count 40116
Reduce places removed 684 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 691 rules applied. Total rules applied 1375 place count 20518 transition count 40109
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1382 place count 20511 transition count 40109
Performed 9509 Post agglomeration using F-continuation condition.Transition count delta: 9509
Deduced a syphon composed of 9509 places in 14 ms
Reduce places removed 9509 places and 0 transitions.
Iterating global reduction 3 with 19018 rules applied. Total rules applied 20400 place count 11002 transition count 30600
Discarding 387 places :
Symmetric choice reduction at 3 with 387 rule applications. Total rules 20787 place count 10615 transition count 29826
Iterating global reduction 3 with 387 rules applied. Total rules applied 21174 place count 10615 transition count 29826
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21180 place count 10615 transition count 29820
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 21186 place count 10609 transition count 29820
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 21190 place count 10609 transition count 29820
Applied a total of 21190 rules in 23458 ms. Remains 10609 /21202 variables (removed 10593) and now considering 29820/40800 (removed 10980) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23473 ms. Remains : 10609/21202 places, 29820/40800 transitions.
RANDOM walk for 40000 steps (54 resets) in 1921 ms. (20 steps per ms) remains 8/11 properties
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
// Phase 1: matrix 29820 rows 10609 cols
[2024-05-31 19:50:51] [INFO ] Computed 201 invariants in 251 ms
[2024-05-31 19:50:51] [INFO ] State equation strengthened by 29408 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10303/10490 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10490 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 18/10508 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10508 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 100/10608 variables, 100/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10608 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 29820/40428 variables, 10608/10809 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40428 variables, 29408/40217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40428 variables, 0/40217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/40429 variables, 1/40218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 40429/40429 variables, and 40218 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45039 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 10609/10609 constraints, ReadFeed: 29408/29408 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10303/10490 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 19:52:05] [INFO ] Deduced a trap composed of 2 places in 26934 ms of which 69 ms to minimize.
[2024-05-31 19:52:19] [INFO ] Deduced a trap composed of 106 places in 13848 ms of which 50 ms to minimize.
[2024-05-31 19:52:32] [INFO ] Deduced a trap composed of 105 places in 12784 ms of which 48 ms to minimize.
SMT process timed out in 101069ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 187 out of 10609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10609/10609 places, 29820/29820 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 10602 transition count 29813
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 10602 transition count 29813
Applied a total of 15 rules in 12151 ms. Remains 10602 /10609 variables (removed 7) and now considering 29813/29820 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12152 ms. Remains : 10602/10609 places, 29813/29820 transitions.
RANDOM walk for 40000 steps (56 resets) in 2466 ms. (16 steps per ms) remains 5/8 properties
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 5/5 properties
// Phase 1: matrix 29813 rows 10602 cols
[2024-05-31 19:52:45] [INFO ] Computed 201 invariants in 281 ms
[2024-05-31 19:52:46] [INFO ] State equation strengthened by 29415 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10374/10453 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10453 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 48/10501 variables, 48/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10501 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 100/10601 variables, 100/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10601 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 29813/40414 variables, 10601/10802 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40414 variables, 29415/40217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40414 variables, 0/40217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/40415 variables, 1/40218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40415 variables, 0/40218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/40415 variables, 0/40218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40415/40415 variables, and 40218 constraints, problems are : Problem set: 0 solved, 5 unsolved in 46091 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 10602/10602 constraints, ReadFeed: 29415/29415 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10374/10453 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:53:59] [INFO ] Deduced a trap composed of 2 places in 25979 ms of which 55 ms to minimize.
[2024-05-31 19:54:24] [INFO ] Deduced a trap composed of 2 places in 25150 ms of which 65 ms to minimize.
[2024-05-31 19:54:28] [INFO ] Deduced a trap composed of 104 places in 3661 ms of which 25 ms to minimize.
[2024-05-31 19:54:32] [INFO ] Deduced a trap composed of 104 places in 3634 ms of which 25 ms to minimize.
[2024-05-31 19:54:35] [INFO ] Deduced a trap composed of 104 places in 3293 ms of which 23 ms to minimize.
[2024-05-31 19:54:39] [INFO ] Deduced a trap composed of 106 places in 3108 ms of which 25 ms to minimize.
[2024-05-31 19:54:41] [INFO ] Deduced a trap composed of 104 places in 2663 ms of which 19 ms to minimize.
[2024-05-31 19:54:44] [INFO ] Deduced a trap composed of 105 places in 2856 ms of which 23 ms to minimize.
[2024-05-31 19:54:47] [INFO ] Deduced a trap composed of 104 places in 2687 ms of which 23 ms to minimize.
SMT process timed out in 122148ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 79 out of 10602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 29813/29813 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10602 transition count 29811
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10600 transition count 29811
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 14 place count 10590 transition count 29791
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 10590 transition count 29791
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 88 place count 10558 transition count 29759
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 104 place count 10550 transition count 29761
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 10550 transition count 29761
Applied a total of 107 rules in 19985 ms. Remains 10550 /10602 variables (removed 52) and now considering 29761/29813 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19987 ms. Remains : 10550/10602 places, 29761/29813 transitions.
[2024-05-31 19:55:07] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-31 19:55:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10550 places, 29761 transitions and 118969 arcs took 107 ms.
[2024-05-31 19:55:09] [INFO ] Flatten gal took : 1048 ms
Total runtime 366007 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CANConstruction-PT-100-ReachabilityCardinality-2024-00
Could not compute solution for formula : CANConstruction-PT-100-ReachabilityCardinality-2024-01
Could not compute solution for formula : CANConstruction-PT-100-ReachabilityCardinality-2024-08
Could not compute solution for formula : CANConstruction-PT-100-ReachabilityCardinality-2024-09
Could not compute solution for formula : CANConstruction-PT-100-ReachabilityCardinality-2023-11

BK_STOP 1717185309620

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name CANConstruction-PT-100-ReachabilityCardinality-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_0_
rfs formula name CANConstruction-PT-100-ReachabilityCardinality-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_1_
rfs formula name CANConstruction-PT-100-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_2_
rfs formula name CANConstruction-PT-100-ReachabilityCardinality-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_3_
rfs formula name CANConstruction-PT-100-ReachabilityCardinality-2023-11
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CANConstruction-PT-100"
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 CANConstruction-PT-100, 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 r476-tall-171620505100086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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