fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r041-tajo-167813694600393
Last Updated
May 14, 2023

About the Execution of LTSMin+red for BugTracking-PT-q8m004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14068.836 819786.00 3196477.00 89.70 FT???FTF????F?FF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694600393.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BugTracking-PT-q8m004, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694600393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K Feb 26 07:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 07:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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 BugTracking-PT-q8m004-CTLCardinality-00
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-01
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-02
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-03
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-04
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-05
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-06
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-07
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-08
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-09
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-10
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-11
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-12
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-13
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-14
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678633429758

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m004
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:03:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 15:03:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:03:52] [INFO ] Load time of PNML (sax parser for PT used): 664 ms
[2023-03-12 15:03:52] [INFO ] Transformed 754 places.
[2023-03-12 15:03:52] [INFO ] Transformed 27370 transitions.
[2023-03-12 15:03:52] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 842 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 474 places in 99 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 84 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2023-03-12 15:03:52] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 15:03:52] [INFO ] Computed 8 place invariants in 48 ms
[2023-03-12 15:03:53] [INFO ] Implicit Places using invariants in 763 ms returned []
[2023-03-12 15:03:53] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:03:53] [INFO ] Invariant cache hit.
[2023-03-12 15:03:54] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:03:55] [INFO ] Implicit Places using invariants and state equation in 2131 ms returned []
Implicit Place search using SMT with State Equation took 2922 ms to find 0 implicit places.
[2023-03-12 15:03:55] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:03:55] [INFO ] Invariant cache hit.
[2023-03-12 15:03:56] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4153 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 27 out of 277 places after structural reductions.
[2023-03-12 15:03:57] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2023-03-12 15:03:57] [INFO ] Flatten gal took : 295 ms
[2023-03-12 15:03:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q8m004-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 15:03:57] [INFO ] Flatten gal took : 202 ms
[2023-03-12 15:03:57] [INFO ] Input system was already deterministic with 3871 transitions.
Support contains 7 out of 277 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 15:03:58] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:03:58] [INFO ] Invariant cache hit.
[2023-03-12 15:03:58] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 15:03:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:03:59] [INFO ] After 669ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2023-03-12 15:03:59] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:04:00] [INFO ] After 415ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :5 sat :1
[2023-03-12 15:04:00] [INFO ] Deduced a trap composed of 12 places in 291 ms of which 5 ms to minimize.
[2023-03-12 15:04:00] [INFO ] Deduced a trap composed of 39 places in 300 ms of which 1 ms to minimize.
[2023-03-12 15:04:01] [INFO ] Deduced a trap composed of 62 places in 324 ms of which 2 ms to minimize.
[2023-03-12 15:04:01] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 2 ms to minimize.
[2023-03-12 15:04:01] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 1 ms to minimize.
[2023-03-12 15:04:02] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 0 ms to minimize.
[2023-03-12 15:04:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2167 ms
[2023-03-12 15:04:02] [INFO ] After 2770ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-12 15:04:02] [INFO ] After 3661ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 269 transition count 3871
Applied a total of 16 rules in 270 ms. Remains 269 /277 variables (removed 8) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 129901 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129901 steps, saw 51184 distinct states, run finished after 3003 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:04:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:04:05] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 15:04:05] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:04:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:04:06] [INFO ] After 809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:04:06] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:04:07] [INFO ] After 306ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:04:07] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 1 ms to minimize.
[2023-03-12 15:04:07] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 0 ms to minimize.
[2023-03-12 15:04:08] [INFO ] Deduced a trap composed of 56 places in 294 ms of which 0 ms to minimize.
[2023-03-12 15:04:08] [INFO ] Deduced a trap composed of 56 places in 290 ms of which 0 ms to minimize.
[2023-03-12 15:04:08] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-12 15:04:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1599 ms
[2023-03-12 15:04:08] [INFO ] After 2040ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-12 15:04:08] [INFO ] After 3017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:04:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:04:09] [INFO ] Invariant cache hit.
[2023-03-12 15:04:09] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-12 15:04:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:04:09] [INFO ] Invariant cache hit.
[2023-03-12 15:04:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:04:11] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 2039 ms to find 0 implicit places.
[2023-03-12 15:04:11] [INFO ] Redundant transitions in 321 ms returned []
[2023-03-12 15:04:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:04:11] [INFO ] Invariant cache hit.
[2023-03-12 15:04:12] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3512 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 281 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-12 15:04:12] [INFO ] Computed 9 place invariants in 20 ms
[2023-03-12 15:04:12] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:04:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:04:13] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:04:13] [INFO ] After 655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-12 15:04:13] [INFO ] After 812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 5 atomic propositions for a total of 3 simplifications.
[2023-03-12 15:04:13] [INFO ] Flatten gal took : 183 ms
[2023-03-12 15:04:14] [INFO ] Flatten gal took : 198 ms
[2023-03-12 15:04:14] [INFO ] Input system was already deterministic with 3871 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 13 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:04:14] [INFO ] Flatten gal took : 144 ms
[2023-03-12 15:04:14] [INFO ] Flatten gal took : 162 ms
[2023-03-12 15:04:15] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 14 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:04:15] [INFO ] Flatten gal took : 132 ms
[2023-03-12 15:04:15] [INFO ] Flatten gal took : 128 ms
[2023-03-12 15:04:15] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 18 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:04:16] [INFO ] Flatten gal took : 177 ms
[2023-03-12 15:04:16] [INFO ] Flatten gal took : 139 ms
[2023-03-12 15:04:16] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 11 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:04:16] [INFO ] Flatten gal took : 117 ms
[2023-03-12 15:04:16] [INFO ] Flatten gal took : 129 ms
[2023-03-12 15:04:17] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 11 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:04:17] [INFO ] Flatten gal took : 117 ms
[2023-03-12 15:04:17] [INFO ] Flatten gal took : 126 ms
[2023-03-12 15:04:17] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 12 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:04:17] [INFO ] Flatten gal took : 114 ms
[2023-03-12 15:04:17] [INFO ] Flatten gal took : 124 ms
[2023-03-12 15:04:18] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 11 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:04:18] [INFO ] Flatten gal took : 114 ms
[2023-03-12 15:04:18] [INFO ] Flatten gal took : 125 ms
[2023-03-12 15:04:18] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 11 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:04:18] [INFO ] Flatten gal took : 115 ms
[2023-03-12 15:04:18] [INFO ] Flatten gal took : 123 ms
[2023-03-12 15:04:19] [INFO ] Input system was already deterministic with 3871 transitions.
[2023-03-12 15:04:19] [INFO ] Flatten gal took : 124 ms
[2023-03-12 15:04:19] [INFO ] Flatten gal took : 124 ms
[2023-03-12 15:04:19] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-12 15:04:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 3871 transitions and 19025 arcs took 20 ms.
Total runtime 28224 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/559/ctl_0_ --ctl=/tmp/559/ctl_1_ --ctl=/tmp/559/ctl_2_ --ctl=/tmp/559/ctl_3_ --ctl=/tmp/559/ctl_4_ --ctl=/tmp/559/ctl_5_ --ctl=/tmp/559/ctl_6_ --ctl=/tmp/559/ctl_7_ --mu-par --mu-opt
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-02
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-03
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-04
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-08
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-09
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-10
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-11
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-13

BK_STOP 1678634249544

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name BugTracking-PT-q8m004-CTLCardinality-02
ctl formula formula --ctl=/tmp/559/ctl_0_
ctl formula name BugTracking-PT-q8m004-CTLCardinality-03
ctl formula formula --ctl=/tmp/559/ctl_1_
ctl formula name BugTracking-PT-q8m004-CTLCardinality-04
ctl formula formula --ctl=/tmp/559/ctl_2_
ctl formula name BugTracking-PT-q8m004-CTLCardinality-08
ctl formula formula --ctl=/tmp/559/ctl_3_
ctl formula name BugTracking-PT-q8m004-CTLCardinality-09
ctl formula formula --ctl=/tmp/559/ctl_4_
ctl formula name BugTracking-PT-q8m004-CTLCardinality-10
ctl formula formula --ctl=/tmp/559/ctl_5_
ctl formula name BugTracking-PT-q8m004-CTLCardinality-11
ctl formula formula --ctl=/tmp/559/ctl_6_
ctl formula name BugTracking-PT-q8m004-CTLCardinality-13
ctl formula formula --ctl=/tmp/559/ctl_7_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 277 places, 3871 transitions and 19025 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.040 real 0.030 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 3871->3714 groups
pnml2lts-sym: Regrouping took 3.740 real 3.740 user 0.000 sys
pnml2lts-sym: state vector length is 277; there are 3714 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done

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="BugTracking-PT-q8m004"
export BK_EXAMINATION="CTLCardinality"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q8m004, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694600393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m004.tgz
mv BugTracking-PT-q8m004 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;